On real quadratic number fields suitable for cryptography

Experimental Mathematics

Volumn 14, Issue 2, 2005, Pages 189-197

  Schielzeth, Daniel ^a   Pohst, Michael E ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Application in cryptography; Real quadratic fields

Indexed keywords

EID: 27844500069     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2005.10128914     Document Type: Article

References (19)

1. Ingrid Biehl and Johannes Buchmann. “An Analysis of the Reduction Algorithms for Binary Quadratic Forms.” Technical Report TI-26/97, Technische Universität Darmstadt, Fachbereich Informatik. Available from World Wide Web (http://www.informatik.tu-darmstadt.de/ TI/Veroeffentlichung/TR/), 1997.
2. Dan Boneh. “The Decision Diffie Hellman Problem.” In Algorithmic Number Theory, Portland, 1998, Lecture Notes in Computer Science, 1423, edited by J. P. Buhler, pp. 48–63. Berlin: Springer-Verlag, 1998.
3. Dan Boneh, Antoine Joux, and Phong Q. Nguyen. “Why Textbook ElGamal and RSA Encryption Are Insecure.” In Proc. Asiacrypt ’00, Lecture Notes in Computer Science, 1976, pp. 30–44. Berlin: Springer-Verlag, 2000.
4. Johannes Buchmann and Safuat Hamdy. “A Survey on IQ Cryptography.” Technical Report TI-4/01, Technische Universität Darmstadt, Fachbereich Informatik. Available from World Wide Web (http://www.informatik.tu-darmstadt.de/ TI/Veroeffentlichung/TR/), 2001.
5. Johannes Buchmann, Christoph Thiel, and Hugh C. Williams. “Short Representation of Quadratic Integers.” In Computational Algebra and Number Theory, Sydney 1992, Mathematics and its Applications, 325, edited by Wieb Bosma and Alf J. van der Poorten, pp. 159–185. Norwood, MA: Kluwer Academic Publishers, 1995.
6. Henri Cohen. A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, 138. New York: Springer-Verlag, 1995.
7. Henri Cohen and J. Martinet. “Class Groups of Number Fields: Numerical Heuristics.” Mathematics of Computation 48:177 (1987), 123-137.
8. Taher ElGamal. “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms.” IEEE Transactions on Information Theory 31:4 (1985), 469–472.
9. Safuat Hamdy. “ Über die Sicherheit und Effizienz kryptographischer Verfahren mit Klassengruppen imaginär-quadratischer Zahlkörper.” PhD diss., Technische Universität Darmstadt, Fachbereich Informatik, Darmstadt. Available from World Wide Web (http://www.informatik.tu-darmstadt.de/ TI/Veroeffentlichung/TR/), 2002.
10. Safuat Hamdy and Bodo Möller. “Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders.” Technical Report TI-4/00, Technische Universität Darmstadt, Fachbereich Informatik. Available from World Wide Web (http://www.informatik.tu-darmstadt.deTI/ Veroeffentlichung/TR/), 2000.
11. H. Hasse. Zahlentheorie, Second edition. Berlin: Akademie–Verlag, 1963.
12. Detlef Hühnlein. “Quadratic Orders for NESSIE – Overview and Parameter Sizes of Three Public Key Families.” Technical Report TI-3/00, Technische Universität Darmstadt, Fachbereich Informatik. Available from World Wide Web (http://www.informatik.tu-darmstadt.de/TI/ Veroeffentlichung/TR/), 2000.
13. E. L. Ince. “Cycles of Reduced Ideals in Quadratic Fields.” British Assoc. Advanc. Sci. Math. Tables 4 (1934), pp. XVI + 80 p.
14. Michael J. Jacobson Jr. “Subexponential Class Group Computation in Quadratic Orders.” PhD diss., Technische Universität Darmstadt, Fachbereich Informatik, Darmstadt, 1999.
15. H. Lang. “ Über eine Gattung elementararithmetischer Klasseninvarianten reell-quadratischer Zahlkörper.” Journal f¨ur die reine und angewandte Mathematik 233 (1968), 123–175.
16. Serge Lang. Algebraic Number Theory, Graduate Texts in Mathematics, 110, Second edition. New York: Springer-Verlag, 1991.
17. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. Boca Raton, FL: CRC Press, 1997.
18. Daniel Schielzeth. “Realisierung der ElGamal-Verschlüsselung in quadratischen Zahlkörpern.” Master’s thesis, Technische Universität Berlin. Available from World Wide Web (http: //www.math.tu-berlin.de/∼kant/publications.html), 2003.
19. Ulrich Vollmer. “Asymptotically Fast Discrete Logarithms in Quadratic Number Fields.” Technical Report TI-6/00, Technische Universität Darmstadt, Fachbereich Informatik. Available from World Wide Web (http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/TR/), 2000.