On class group computations using the number field sieve

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2894, Issue , 2003, Pages 311-325

  Bauer, Mark L ^a   Hamdy, Safuat ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Class groups; Hyperelliptic curve discrete logarithm; Imaginary quadratic function fields; Imaginary quadratic number fields; Number field sieve

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATION THEORY; GEOMETRY; SECURITY OF DATA; SIEVES;

CLASS GROUP; DISCRETE LOGARITHMS; NUMBER FIELD SIEVE; QUADRATIC FUNCTION; QUADRATIC NUMBER;

DATA COMMUNICATION SYSTEMS;

EID: 0344196670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40061-5_19     Document Type: Article

References (15)

1. ADLEMAN, L. M., DEMARRAIS, J., AND HUANG, M.-D. A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF(q). Theoretical Computer Science 226, 1-2 (1999), 7-18.
2. BUHLER, J. P., LENSTRA, JR., H. W., AND POMERANCE, C. Factoring integers with the number field sieve. In The development of the number field sieve, A. K. Lenstra and H. W. Lenstra, Eds., no. 1554 in LNM. Springer-Verlag, 1993, pp. 50-94.
3. COHEN, H. A Course in Computational Algebraic Number Theory, vol. 138 of GTM. Springer-Verlag, 1995.
4. CRANDALL, R., AND POMERANCE, C. Prime Numbers: A Computational Perspective. Springer-Verlag, 2000.
5. DAMGÅRD, I., AND FUJISAKI, E. A statistically-hiding integer commitment scheme based on groups with hidden order. In Advances in Cryptology - ASIACRYPT 2002 (2002), Y. Zheng, Ed., vol. 2501 of LNCS, Springer-Verlag, pp. 125-142.
6. ENGE, A., AND GAUDRY, P. A. A general framework for subexponential discrete logarithm algorithms. Acta Arithmetica 102, 1 (2002), 83-103.
7. GORDON, D. M. Discrete logarithms in gf(p) using the number field sieve. SIAM Journal of Discrete Mathematics 6, 1 (1993), 124-138.
8. HAMDY, S. IQ cryptography: A secure and efficient alternative. Journal of Cryptology (2003). Submitted.
9. JACOBSON, JR., M. J. Applying sieving to the computation of quadratic class groups. Mathematics of Computation 68, 226 (1999), 859-867.
10. JACOBSON, JR., M. J. Subexponential Class Group Computation in Quadratic Orders. PhD thesis, Technische Universität Darmstadt, Fachbereich Informatik, Darmstadt, Germany, 1999.
11. KOBLITZ, N. Algebraic Aspects of Cryptography, vol. 3 of Algorithms and Computation in Mathematics. Springer-Verlag, 1998.
12. SCHIROKAUER, O. Discrete logarithms and local units. Philosophical Transactions of the Royal Society of London, Series A. 345, 1676 (1993), 409-423.
13. SCHIROKAUER, O. Using number fields to compute logarithms in finite fields. Mathematics of Computation 69, 231 (2000), 1267-1283.
14. SCHIROKAUER, O., WEBER, D., AND DENNY, T. Discrete logarithms: The effectiveness of the index calculus method. In Algorithmic Number Theory, ANTS-II (1996), H. Cohen, Ed., vol. 1122 of LNCS, Springer-Verlag, pp. 337-361.
15. WEBER, D. Computing discrete logarithms with the general number field sieve. In Algorithmic Number Theory, ANTS-II (1996), H. Cohen, Ed., vol. 1122 of LNCS, Springer-Verlag, pp. 391-403.