Adventures in Supersingularland

References

• Gora Adj, O. A., Menezes, A. On isogeny graphs of supersingular elliptic curves over finite fields. Finite Fields Their Appl., 55, 268–283.
   Web of Science ®Google Scholar
• Arpin, S., Camacho-Navarro, C., Lauter, K., Lim, J., Nelson, K., Scholl, T., Sotáková, J. (2019). Adventures in supersingularland.
   Google Scholar
• Biasse, J.-F., Jao, D., and Sankar, A. (2014), A quantum algorithm for computing isogenies between supersingular elliptic curves. In Progress in cryptology—INDOCRYPT 2014, volume 8885 of Lecture Notes in Comput. Sci., Springer, Cham, pp. 428–442.
   Google Scholar
• Costache, A., Feigon, B., Lauter, K., Massierer, M., Pusks, A. Ramanujan graphs in cryptography. In: Jennifer, S. B., Folsom, A., Laln, M., Manes, M. Eds., Research Directions in Number Theory, Association for Women in Mathematics Series, Springer International Publishing, pp. 1–40.
   Google Scholar
• Charles, D., Goren, E., Lauter, K. (2006), Cryptographic hash functions from expander graphs. Cryptology ePrint Archive, Report 2006/021. Available at: https://eprint.iacr.org/2006/021.
   Google Scholar
• Charles, D., Goren, Ey., and Lauter, K. (2009), Families of Ramanujan graphs and quaternion algebras, In: Groups and symmetries, CRM Proc. Lecture Notes, Amer. Math. Soc., Vol. 47, pp. 53–80.
   Google Scholar
• Castryck, W., Lange, T., Martindale, C., Panny, L., and Renes, J. CSIDH: An efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S., Advances in Cryptology ASIACRYPT 2018, Lecture Notes in Computer Science, Springer International Publishing, pp. 395–427.
   Google Scholar
• Cox, D. (1989), Primes of the form x² + ny². New York: John Wiley and Sons, Inc.
   Google Scholar
• Castryck, W., Panny, L., and Vercauteren, F. (2020), Rational isogenies from irrational endomorphisms. In: Canteaut, A., Ishai, Y., Eds., Advances in Cryptology EUROCRYPT 2020, Lecture Notes in Computer Science, Springer International Publishing, pp. 523–548.
   Google Scholar
• Delfs, C., and Galbraith, S. D. (2016), Computing isogenies between supersingular elliptic curves over 𝔽p. Des. Codes Cryptog., 78: 425–440. Available at: https://arxiv.org/pdf/1310.7789.pdf.
   Web of Science ®Google Scholar
• Hallgren, E.S., Lauter, K., Morrison, T., and Petit, C. (2018), Supersingular isogeny graphs and endomorphism rings: Reductions and solutions. In: Nielsen, J. B., Rijmen, V., Eds., Advances in Cryptology EUROCRYPT 2018, Lecture Notes in Computer Science, Springer International Publishing, pp. 329–368.
   Google Scholar
• Eisentrger, K., Hallgren, S., Leonardi, C., Morrison, T., Park, J. Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs. In Proceedings of the Fourteenth Algorithmic Number Theory Symposium, Vol. 4, Mathematical Sciences Publishers, pp. 215–232.
   Google Scholar
• Galbraith, S. D., Petit, C., Shani, B., and Ti, Y. B. (2016), On the security of supersingular isogeny cryptosystems. In: Cheon, J. H., Hee, J., Takagi, T., Eds., Advances in Cryptology ASIACRYPT 2016, Lecture Notes in Computer Science, Springer.
   Google Scholar
• Ibukiyama, T. (1982), On maximal orders of division quaternion algebras over the rational number field with certain optimal embeddings. Nagoya Math. J., 88: 181–195.
   Web of Science ®Google Scholar
• Jao, D., De Feo, L. Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B-Y., Ed., Post-Quantum Cryptography, Lecture Notes in Computer Science, Springer, pp. 19–34.
   Google Scholar
• Kaneko, M. (1989), Supersingular j-invariants as singular moduli mod p. Osaka J. Math., 26, 12.
   Web of Science ®Google Scholar
• Kohel, D., Lauter, K., Petit, C., and Tignol, J-P. (2014), On the quaternion ℓ-isogeny path problem. LMS J. Comput. Math., 17: 418–432.
   Google Scholar
• Kohel, D. (1996), Endomorphism rings of elliptic curves over finite fields. PhD thesis, Berkely: University of California.
   Google Scholar
• Love, J., Boneh, D. Supersingular curves with small noninteger endomorphisms. In: Proceedings of the Fourteenth Algorithmic Number Theory Symposium, Vol. 4, Mathematical Sciences Publishers, pp. 7–22.
   Google Scholar
• Lubotzky, A., Phillips, R. S., Sarnak, P. C. (1988), Ramanujan graphs. Combinatorica, 8: 261–277. doi:10.1007/BF02126799
   Web of Science ®Google Scholar
• Ogg, A. P. (1975), Automorphismes de courbes modulaires. Séminaire Delange-Pisot-Poitou. Théorie des nombres, 16:1–8.
   Google Scholar
• Sardari, N. T. Diameter of Ramanujan graphs and random cayley graphs. 39: 427–446.
   Google Scholar
• Shor, P. W. (1999), Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev., 41: 303–332.
   Web of Science ®Google Scholar
• Silverman, J. H. (2009), The Arithmetic of Elliptic Curves, 2nd ed. New York: Springer-Verlag.
   Google Scholar
• Sutherlandm, A. V. (2013), Isogeny volcanoes. In: ANTS X—Proceedings of the Tenth Algorithmic Number Theory Symposium, volume 1 of Open Book Ser. Berkeley, CA: Math. Sci. Publ., pp. 507–530.
   Google Scholar
• The Sage Developers. (2019), SageMath, the Sage Mathematics Software System (Version 8.7). Available at: https://www.sagemath.org.
   Google Scholar
• Vlu, J. (1971), Isognies entre courbes elliptiques. Comptes Rendus de l’Acadmie des Sciences de Paris, 273: 238–241.
   Google Scholar