A generic approach to searching for jacobians

Mathematics of Computation

Volumn 78, Issue 265, 2009, Pages 485-507

  Sutherland, Andrew V ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58149236779     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-08-02143-1     Document Type: Article

References (66)

1. Eric Bach and René Peralta, Asymptotic semismoothness probabilities, Mathematics of Computation 65 (1996), 1701-1715. MR1370848 (98a:11123)
2. 3,4 curves, Algorithmic Number Theory Symposium-ANTS VI, Lecture Notes in Computer Science, vol. 3076, Springer-Verlag, 2004, pp. 87-101. MR2137346 (2006a:14101)
3. Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, and Nicolas Gürel, The arithmetic of Jacobian groups of superelliptic cubics, Mathematics of Computation 74 (2004), no. 249, 389-410. MR2085899 (2005f:11126)
4. Daniel J. Bernstein, Elliptic vs. hyperelliptic, part 1, 2006, Talk given at ECC 2006, http://cr.yp.to/talks/2006.09.20/slides.pdf.
5. Alin Bostan, Pierrick Gaudry, and Eric Schost, Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator, SIAM Journal on Computing 36 (2007), no. 6, 1777-1806. MR2299425 (2008a:11156)
6. Johannes Buchmann, Michael J. Jacobson, Jr., and Edlyn Teske, On some computational problems in finite abelian groups, Mathematics of Computation 66 (1997), 1663-1687. MR1432126 (98a:11185)
7. Johannes Buchmann and Arthur Schmidt, Computing the structure of a finite abelian group, Mathematics of Computation 74 (2005), 2017-2026. MR2164109 (2006c:20108)
8. E. Canfield, P. Erdös, and C. Pomerance, On a problem, of Oppenheim concerning "factorisatio numerorum", Journal of Number Theory 17 (1983), 1-28. MR712964 (85j:11012)
9. David G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation 48 (1987), no. 177, 95-101. MR866101 (88f:11118)
10. Henri Cohen, A course in computational algebraic number theory, Springer, 1996. MR1228206 (94i:11105)
11. Henri Cohen, Gerhard Frey, Roberto Avanzi, Christophe Doche, Tanja Lange, Kim Nguyen, and Frederik Vercauteren, Handbook of elliptic and hyperelliptic curve cryptography, Chapman and Hall, 2006. MR2162716 (2007f:14020)
12. Certicom Corporation, Certicom ECC challenge, 1997, see http://www.certicom.com.
13. K. Dickman, On the frequency of numbers containing prime factors of a certain relative magnitude, Arkiv för Mathematik, Astronomi, och Fysik, 22A 10 (1930), 1-14.
14. Clans Diem, The GHS attack in odd characteristic, Journal of the Ramanujan Mathematical Society 18 (2003), no, 1, 1-32. MR1966526 (2004a:14030)
15. -, An index calculus algorithm for plane curves of small degree, Algorithm Number Theory Symposium-ANTS VII, Lecture Notes in Computer Science, vol. 4076, 2006, pp. 543-557. MR2282948 (2008b:11128)
16. Claus Diem and Jasper Scholten, Cover attacks: A report for the AREHCC project, 2003, http://www.math.uni-leipzig.de/~diem/preprints/cover- attacks.pdf.
17. Noam D. Elkies, Elliptic and modular curves over finite fields and related computational issues, Computational perspectives in number theory: Proceedings of a conference in honor of A.O.L. Atkin (D.A. Buell and J.T. Teitelbaum, eds.), AMS, 1998, pp. 21-76. MR1486831 (99a:11078)
18. Andreas Enge, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time, Mathematics of Computation 71 (2002), no. 238, 729-742. MR1885624 (2003b:68083)
19. Stéphanc Flon and Roger Oyono, Fast arithmetic on Jacobians of Picard curves, Public Key Cryptography-PKC 2004, Lecture Notes in Computer Science, vol. 2947, 2004, pp. 55-68.
20. Stéphane Flon, Roger Oyono, and Christophe Ritzenhaler, Fast addition on non-hyperelliptic genus 3 curves, Tech. Report CACR 2007-19, Center for Applied Cryptographic Research at the University of Waterloo, 2007.
21. Gerhard Frey, Applications of arithmetical geometry to cryptographic applications, 1998 Finite Fields and Applications Conference, Berlin, 2001, pp. 128-161. MR1849086 (2002h:11136)
22. 5 + ax over a prime field, Selected Areas in Cryptography 2003, Lecture Notes in Computer Science, vol. 3006, 2004, pp. 26-41. MR2094719 (2006a:11078)
23. P. Gaudry, F. Hess, and N. Smart, Constructive and destructive facets of Weil descent on elliptic curves., Journal of Cryptology 15 (2002), no. 1, 19-46. MR1880933 (2003b:14032)
24. P. Gaudry, E. Thomé, N. Thériault, and C. Diem, A double large prime variation for small genus hyperelliptic index calculus, Mathematics of Computation 76 (2007), no. 257, 475-492. MR2261032 (2007j:11174)
25. Picrrick Gaudry, Index calculus for abelian varieties and. the elliptic curve discrete logarithm problem, Cryptology ePrint Archive, Report 2004/073, 2004, http://eprint.iacr.org/.
26. -, Fast genus 2 arithmetic based on Theta functions, 2005, to appear in Journal of Mathematical Cryptology, http://www.loria.fr/~gaudry/ publis/arithKsurf.ps.gz.
27. Pierrick Gaudry and Éric Schost, Construction of secure random, curves of genus 2 over prime fields, Advances in Cryptology-EUROCRYPT 2004, Lecture Notes in Computer Science, vol. 3027, Springer-Verlag, 2004, pp. 239-256. MR2153176 (2006d:11152)
28. Pierrick Gaudry and Nicolas Gürel, Counting points in medium characteristic using Kedlaya's algorithm, Experimental Mathematics 12 (2003), 395-402. MR2043990 (2005b:11084).
29. Torbjörn Granlund et al., GNU multiple precision arithmetic library 4.2.1, May 2006, http://swox.com/gmp/.
30. David Harvey, Kedlaya's algorithm in larger characteristic, International Mathematical Research Notices (2007).
31. Kiran Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology, Journal of the Ramanujan Mathematical Society 16 (2001), 332-338. MR1877805 (2002m:14019)
32. -, Computing zeta functions via p-adic cohomology, Algorithmic Number Theory Symposium-ANTS VI, Lecture Notes in Computer Science, vol, 3076, Springer, 2004, pp. 1-17. MR2137340 (2006a:14033)
33. Kamal Khuri-Makdisi, Asymptotically fast group operations on Jacobians of general curves, Mathematics of Computation 76 (2007), 2213-2239, MR2336292
34. Donald E. Knuth, The art of computer programming, volume III: Sorting and searching, second ed., Addison-Wesley, 1998. MR0378456 (51:14624)
35. Neal Koblitz, Algebraic aspects of cryptography, Springer, 1998. MR1610535 (2000a:94012)
36. Tanja Lange, Trace zero subvarieties of genus 2 curves for cryptosystems, J. Ramanujan Mathematical Society 19 (2004), no. 1, 15-33. MR2054607 (2006b:94034)
37. -, Formulae for arithmetic on genus 2 hyperelliptic curves, Applicable Algebra in Engineering, Communication and Computing 15 (2005). no. 5, 295-328. MR2122308 (2005j:14082)
38. Tanja Lange (Ed.), Open problems in implementation and application, Tech. Report D.VAM.6, revision 1.4, ECRYPT, European Network of Excellence in Cryptology, 2006.
39. H. W. Lenstra, Jr., Factoring integers with elliptic curves, Annals of Mathematics 126 (1987), 649-673. MR916721 (89g:11125)
40. Dino Lorenzini, An invitation to arithmetic geometry, Graduate Studies in Mathematics, vol. 9, American Mathematical Society, 1996. MR1376367 (97e:14035)
41. Kazuto Matsuo, Jinhui Chao, and Shigeo Tsujii, An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields, Algorithmic Number Theory Symposium-ANTS V, Lecture Notes in Computer Science, vol. 2369, Springer, 2002, pp. 461-474. MR2041104 (2005a:11089)
42. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, Handbook of applied cryptography, CRC Press, 1997, revised reprint. MR1412797 (99g:94015)
43. Jean Francois Mestre, Algorithme pour compter des points de courbes en petite caractéristique et petit genre, 2002, lecture notes, http://www.institut.math.jussieu.fr/~mestre/rennescrypto.ps.
44. Peter L. Montgomery, Modular multiplication without trial division, Mathematics of Computation 44 (1985), no. 170, 519-521. MR777282 (86e:11121)
45. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, 2000.
46. J. Pila, Frobenius maps of abelian varieties and finding roots of unity in finite fields, Mathematics of Computation 55 (1990), no. 102, 745-763. MR1035941 (91a:11071)
47. John M. Pollard, Theorems of factorization and primality testing, Proceedings of the Cambridge Philosophical Society 76 (1974), 521-528. MR0354514 (50:6992)
48. -, Monte Carlo methods for index computations mod p, Mathematics of Computation 32 (1978), 918-924. MR0491431 (58:10684)
49. Takakazu Satoh, The canonical lift of an ordinary elliptic curve over a finite field and its point counting, Journal of the Ramanujan Mathematical Society 15 (2000), no. 4, 247-270. MR1801221 (2001j:11049)
50. C. P. Schnorr and H. W. Lenstra, Jr., A Monte Carlo factoring algorithm with linear storage, Mathematics of Computation 43 (1984), 289-311. MR744939 (85d:11106)
51. René Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Mathematics of Computation 44 (1985), 483-294. MR777280 (86e:11122)
52. -, Counting points on elliptic curves over finite fields, Journal de Théorie des Nombres de Bordeaux 7 (1995), 219-254. MR1413578 (97i:11070)
53. Donald Shanks, Class number, a theory of factorization and genera, Analytic Number Theory, Proceedings of Symposia on Pure Mathematics, vol. 20, American Mathematical Society, 1971, pp. 415-440. MR0316385 (47:4932)
54. Benjamin Smith, Isogenies and the discrete logarithm problem on Jacobians of genus 3 hyperelliptic curves, Cryptology ePrint Archive, Report 2007/428, 2007, http://eprint.iacr.org/.
55. Richard Stallman et al., GNU compiler collection 4.1.2, February 2007, http://gcc.gnu.org/index.html.
56. Andreas Stein and Edlyn Teske, Explicit bounds and heuristics on class numbers in hyperelliptic function fields, Mathematics of Computation 71 (2001), no. 238, 837-861. MR1885633 (2002k:11210)
57. Andrew V. Sutherland, Order computations in generic groups, Ph.D. thesis, Massachusetts Institute of Technology, 2007, http://groups.csail.mit. edu/cis/theses/sutherland-phd.pdf.
58. Edlyn Teske, A space efficient algorithm for group structure computation, Mathematics of Computation 67 (1998), 1637-1663. MR1474658 (99a:11146)
59. -, The Pohlig-Hellman method generalized for group structure computation, Journal of Symbolic Computation 27 (1999), 521-534. MR1701092 (2000f:20090)
60. N. Thériault, Index calculus attack for hyperelliptic curves of small genus, Advances in Cryptology - ASIACRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, 2003, pp. 75-92. MR2093253 (2006d:94068)
61. -, Weil descent attack for Kummer extensions, Journal of the Ramanujan Mathematical Society 18 (2003), no. 3, 281-312. MR2007146 (2004i:14025)
62. Frederik Vercauteren, Computing zeta functions of curves over finite fields, Ph.D. thesis, Katholieke Universiteit Leuven, 2003.
63. André Weil, Numbers of solutions of equations in finite fields, Bulletin of the American Mathematical Society 55 (1949), 497-508. MR0029393 (10:592e)
64. Annegret Weng, Hyperelliptic CM-curves of genus 3, Journal of the Ramanujan Mathematical Society 16 (2001), 339-372. MR1877806 (2002k:11099)
65. -, Constructing hyperelliptic curves of genus 2 suitable for cryptography, Mathematics of Computation 72 (2003), no. 241, 435-458. MR1933830 (2003i:14029)
66. Thomas Wollinger, Software and hardware implementation of hyperelliptic curve cryptosystems, Ph.D. thesis, Ruhr-University of Bochum, 2004.