Author:
Corrigan-Gibbs Henry,Wu David J.
Publisher
Springer Nature Switzerland
Reference21 articles.
1. Adleman, L.M., McCurley, K.S.: Open Problems in Number Theoretic Complexity. Algorithmic Number Theory, II. In (1994)
2. Ankeny, N.C.: The least quadratic non residue. Ann. Math. 55, 65–72 (1952)
3. Bach, E.: Explicit bounds for primality testing and related problems. Math. Comput. 55(191), 355–380 (1990)
4. Ball, M., Holmgren, J., Ishai, Y., Liu, T., Malkin, T.: On the complexity of decomposable randomized encodings, or: how friendly can a garbling-friendly PRF be? In: ITCS (2020)
5. Beullens, W., Beyne, T., Udovenko, A., Vitto, G.: Cryptanalysis of the Legendre PRF and generalizations. IACR Trans. Symmetric Cryptology 2020, 313–330 (2020)