References 59 54. P. W. Shor. »Algorithms for quantum computation: discrete logarithms and factoring«. In: Foundations of Computer Science. IEEE, 1994, pp. 124–134 (cit. on p. 16). 55. P. W. Shor. »Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer«. In: SIAM Review 41.2 (1999), pp. 303–332 (cit. on p. 16). 56. D. Stehlé and R. Steinfeld. »Making NTRU as Secure as Worst-Case Problems over Ideal Lattices«. In: Advances in Cryptology—EUROCRYPT 2011. Ed. byK.G. Paterson. Vol. 6632. LNCS. Springer, 2011, pp. 27–47 (cit. on p. 30). 57. A. Stolbunov. »Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves«. In: Advances in Mathematics of Communications 4.2 (2010), pp. 215–235 (cit. on p. 36).
PQC_for_Dummies
To see the actual publication please follow the link above