Compositeness test with nodal curves

References

• L.M. Adleman, C. Pomerance, and R.S. Rumely, On distinguishing prime numbers from composite numbers, Ann. Math. 2 117(1) (1983), pp. 173–206. doi: 10.2307/2006975
   Web of Science ®Google Scholar
• M. Agrawal, N. Kayal, and N. Saxena, Primes is in P, Ann. of Math. 160 (2004), pp. 781–793. doi: 10.4007/annals.2004.160.781
   Web of Science ®Google Scholar
• A.O.L. Atkin and F. Morain, Elliptic curves and primality proving, Math. Comp. 61(203) (1993), pp. 29–68. doi: 10.1090/S0025-5718-1993-1199989-X
   Web of Science ®Google Scholar
• D. Boneh, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc. 46(2) (1999), pp. 203–213.
   Google Scholar
• D.G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Math. Comp. 48 (1987), pp. 95–101. doi: 10.1090/S0025-5718-1987-0866101-0
   Web of Science ®Google Scholar
• H. Cohen, A Course in Computational Algebraic Number Theory, Springer, Berlin, Germany, 2000.
   Google Scholar
• H. Cohen and G. Frey, Handbook of Elliptic and Hyperelliptic Curve Cryptography, Chapman & Hall/CRC, Boca Raton, FL, 2005.
   Google Scholar
• R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, New York, 2001.
   Google Scholar
• I. Dechene, Generalized Jacobians in cryptography, Ph.D. thesis, McGill University, 2005.
   Google Scholar
• G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp. 61(204) (1993), pp. 915–926. doi: 10.1090/S0025-5718-1993-1192971-8
   Web of Science ®Google Scholar
• N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48 (1987), pp. 203–209. doi: 10.1090/S0025-5718-1987-0866109-5
   Web of Science ®Google Scholar
• N. Koblitz, Hyperelliptic cryptosystems, J. Cryptology 1(3) (1989), pp. 139–150. doi: 10.1007/BF02252872
   Google Scholar
• H.W. Lenstra Jr., Factoring integers with elliptic curves, Ann. of Math. (2) 126 (1987), pp. 649–673. doi: 10.2307/1971363
   Web of Science ®Google Scholar
• H.W. LenstraJr., J. Pila, and C. Pomerance, A hyperelliptic smoothness test, Philos. Trans. R. Soc. Lond. 345 (1993), pp. 397–408. doi: 10.1098/rsta.1993.0138
   Web of Science ®Google Scholar
• Q. Liu, Algebraic Geometry and Arithmetic Curves, Oxford Science Publications, New York, 2002.
   Google Scholar
• G.L. Miller, Riemann's hypothesis and tests for primality, J. Comput. System Sci. 13(3) (1976), pp. 300–317. doi: 10.1016/S0022-0000(76)80043-8
   Web of Science ®Google Scholar
• V. Miller, Use of Elliptic Curves in Cryptography, Advances in Cryptology – CRYPTO 85, Vol. 218, Springer Lecture Notes in Computer Science, Santa Barbara, CA, 1985.
   Google Scholar
• D. Mumford, Tata Lectures on Theta II, Birkhauser, Boston, MA, 1982.
   Google Scholar
• E. Ozdemir, Computing square roots in finite fields, IEEE Trans. Inf. Theory 59(9) (2013), pp. 5613–5615. doi: 10.1109/TIT.2013.2263194
   Web of Science ®Google Scholar
• E. Ozdemir, Curves and their applications to factoring polynomials, Ph.D. thesis, University of Maryland, 2009.
   Google Scholar
• The PARI Group, PARI/GP, Bordeaux, 2010. Available at http://pari.math.u-bordeaux.fr/.
   Google Scholar
• C. Pomerance, J.L. Selfridge, and S.S. Wagstaff Jr., The pseudoprimes to 25, 109, Math. Comp. 35 (1980), pp. 1003–1026.
   Web of Science ®Google Scholar
• M.O. Rabin, Probabilistic algorithm for testing primality, J. Number Theory 12(1) (1980), pp. 128–138. doi: 10.1016/0022-314X(80)90084-0
   Web of Science ®Google Scholar
• R.L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Commun. ACM 21 (1978), pp. 120–126. doi: 10.1145/359340.359342
   Web of Science ®Google Scholar
• R. Schoof, Four Primality Testing Algorithms, Algorithmic Number Theory, Vol. 44, MSRI Publications, Berkeley, CA, 2008, pp. 101–126.
   Google Scholar
• J.H. Silverman, The Arithmetic of Elliptic Curves, 1st ed., Springer, Berlin, Germany, 1992.
   Google Scholar
• L.C. Washington, Elliptic Curves: Number Theory and Cryptography, 2nd ed., Chapman & Hall/CRC, Boca Raton, FL, 2008.
   Google Scholar
• Z. Zhang and M. Tang, Finding strong pseudoprimes to several bases II, Math. Comp 72 (2003), pp. 2085–2097. doi: 10.1090/S0025-5718-03-01545-X
   Web of Science ®Google Scholar