Towards practical non-interactive public key cryptosystems using non-maximal imaginary quadratic orders

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

Volumn 2012, Issue , 2001, Pages 275-287

  Hühnlein, Detlef ^a   Jacobson, Michael J ^b   Weber, Damian ^c  

^a Westfälische Hochschule und secunet Security Networks AG   (Germany)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Markische F Iserlohn/Hagen   (Germany)

Author keywords

Discrete logarithm; Identity based cryptosystem; Non interactive cryptography; Non maximal imaginary quadratic order

Indexed keywords

EMBEDDINGS; FACTORIZATION; PUBLIC KEY CRYPTOGRAPHY;

DISCRETE LOGARITHMS; HIGH PROBABILITY; IDENTITY-BASED CRYPTOSYSTEM; NON-MAXIMAL IMAGINARY QUADRATIC ORDER; POLYNOMIAL COMPLEXITY; PRIME FACTORIZATION; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEY DISTRIBUTION;

CODES (SYMBOLS);

EID: 84949219772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44983-3_20     Document Type: Conference Paper

References (24)

1. Z. I. Borevich and I. R. Shafarevich. Number Theory. Academic Press, New York, 1966
2. H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin, 1993
3. H. Cohen, F. Diaz y A Diaz, and M. Olivier. Computing ray class groups, conductors, and discriminants. Math. Comp., 67(222):773–795, 1998
4. H. Cohen and H. W. Lenstra Jr. Heuristics on class groups of number fields. In Number Theory, Lecture notes in Math., volume 1068, pages 33–62. Springer-Verlag, New York, 1983
5. D. A. Cox. Primes of the form x2 + ny2. John Wiley & Sons, New York, 1989
6. D. Hühnlein. Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders. In Selected Areas in Cryptography -SAC’99, volume 1758 of LNCS, pages 150–167, 1999
7. D. Hühnlein. Quadratic orders for NESSIE-Overview and parameter sizes of three public key families. Technical report TI 03/00, TU-Darmstadt, 2000
8. D. Hühnlein. Faster generation of NICE-Schnorr signatures. in preparation, 2000
9. D. Hühnlein, M. J. Jacobson Jr., S. Paulus, and T. Takagi. A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption. In Advances in Cryptology -EUROCRYPT ’98, volume 1403 of LNCS, pages 294–307, 1998
10. D. Hühnlein, M. J. Jacobson, and D. Weber. Towards practical non-interactive public key cryptosystems using non-maximal imaginary quadratic orders. CORR technical report, www.cacr.math.uwaterloo.ca, to appear
11. D. Hühnlein and J. Merkle. An efficient NICE-Schnorr-type signature scheme. In Proceedings of Public Key Cryptography 2000, Springer, volume 1751 of LNCS, pages 14–27, 2000
12. D. Hühnlein and T. Takagi. Reducing logarithms in totally non-maximal imaginary quadratic orders to logarithms in finite fields. In Advances in Cryptology -ASIACRYPT ’99, volume 1716 of LNCS, pages 219–231, 1999
13. M. J. Jacobson Jr. Computing discrete logarithms in quadratic orders. To appear Journal of Cryptology, 1999
14. M. J. Jacobson Jr. Subexponential Class Group Computation in Quadratic Orders. PhD thesis, Technische Universität Darmstadt, Darmstadt, Germany, 1999
15. S. Lang. Algebraic number theory. Springer, Berlin, 2nd edition, 1991. ISBN 3-540-94225-4
16. A. K. Lenstra, E. Verheul. Selecting Cryptographic Key Sizes. In Proceedings of Public Key Cryptography 2000, Springer, volume 1751 of LNCS, pages 446–465, 2000
17. C. H. Lim and P. J. Lee. Modified Maurer-Yacobi’s scheme and its applications. In Proceedings of Auscrypt’92, LNCS, pages 308–323, 1992
18. M. Maurer and D. Kügler. A note on the weakness of the Maurer-Yacobi squaring method. Technical report, TI 15/99, TU Darmstadt, 1999
19. U. Maurer and Y. Yacobi. Non-interactive public-key cryptography. In Advances in Cryptology -EUROCRYPT’91, volume 547 of LNCS, pages 498–507, 1991
20. U. Maurer and Y. Yacobi. A remark on a non-interactive public-key distribution system. In Advances in Cryptology -EUROCRYPT’92, volume 658 of LNCS, pages 458–460, 1993
21. U. Maurer and Y. Yacobi. A non-interactive public-key distribution system. Design Codes and Cryptography, 9:305–316, 1996
22. R. Rivest. The MD5 message-digest algorithm, 1992. RFC1321, Internet Activities Board, Internet Engineering Task Force
23. A. Shamir. Identity based cryptosystems and signature schemes. In Advances in Cryptology -CRYPTO ’84, volume 196 of LNCS, pages 47–53, 1985
24. D. Weber and T. Denny. The solution of McCurley’s discrete log challenge. In Advances in Cryptology -CRYPTO ’98, volume 1462 of LNCS, pages 56–60, 1998