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

Designs, Codes, and Cryptography

Volumn 30, Issue 3, 2003, Pages 281-299

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

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

^b UNIVERSITY OF CALGARY   (Canada)

^c TRIER UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

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

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; SECURITY OF DATA; THEOREM PROVING;

DISCRETE LOGARITHM; IDENTITY BASED CRYPTOGRAPHY; NON-MAXIMAL IMAGINARY QUADRATIC ORDERS; NONINTERACTIVE CRYPTOGRAPHY; PUBLIC KEY CRYPTOSYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 17644440160     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025746127771     Document Type: Article

References (35)

1. I. Biehl and J. Buchmann, An analysis of the reduction algorithm for binary quadratic forms, Voronoi's Impact on Modern Science (Kyiv, Ukriaine) (P. Engel and H. Syta, eds.), Vol. 1, Institute of Mathematics of National Academy of Sciences (1999).
2. D. Boneh and M. Franklin, Identity based encryption from the Weil Pairing, Advances in Cryptology - CRYPTO 2001, Lecture Notes in Computer Science, Vol. 2139 (2001) pp. 213-229.
3. Z. I. Borevich and I. R. Shafarevich, Number theory, Academic Press, New York (1966).
4. H. Cohen, A course in computational algebraic number theory, Springer-Verlag, Berlin (1993).
5. H. Cohen, F. Diaz, Y. Diaz and M. Olivier, Computing ray class groups, conductors, and discriminants, Math. Comp., Vol. 67, No. 222 (1998) pp. 773-795.
6. H. Cohen and H. W. Lenstra, Jr., Heuristics on class groups of number fields, Number Theory, Lecture Notes in Math., Vol. 1068, Springer-Verlag, New York (1983) pp. 33-62.
7. 2, John Wiley & Sons, New York (1989).
8. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek and V. Sunderam, PVM: Parallel Virtual Machine - a user's guide and tutorial for networked parallel computing, MIT Press, Cambridge, Mass. (1994).
9. D. Gordon, Discrete logarithms using the number field sieve, Siam J. Discrete Math., Vol. 6 (1993) pp. 124-138.
10. D. Hühnlein, Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders, Selected Areas in Cryptography - SAC'99, Lecture Notes in Computer Science, Vol. 1758 (1999) pp. 150-167.
11. D. Hühnlein, Faster generation of NICE-Schnorr signatures, Topics in Cryptology-CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, Lecture Notes in Computer Science, Vol. 2020 (2001) pp. 1-12.
12. D. Hühnlein, Quadratic orders for NESSIE - overview and parameter sizes of three public key families, Technical Report No. TI-3/00, TU-Darmstadt, via http://www.informatik.tu-darmstadt.de/TI/Welcome.html, 2000.
13. D. Hühnlein, M. J. Jacobson, Jr., S. Paulus and T. Takagi, A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption, Advances in Cryptology-EUROCRYPT '98, Lecture Notes in Computer Science, Vol. 1403 (1998) pp. 294-307.
14. D. Hühnlein and J. Merkle, An efficient NICE-Schnorr-type signature scheme, Proceedings of PKC 2000, Melbourne, Lecture Notes in Computer Science, Vol. 1751 (2000).
15. D. Hühnlein and T. Takagi, Reducing logarithms in totally non-maximal imaginary quadratic orders to logarithms in finite fields, Advances in Cryptology - ASIACRYPT '99, Lecture Notes in Computer Science (1999).
16. M. J. Jacobson, Jr., Subexponential class group computation in quadratic orders, Ph.D. thesis, Technische Universität Darmstadt, Germany (1999).
17. M. J. Jacobson, Jr., Computing discrete logarithms in quadratic orders, Journal of Cryptology, Vol. 13 (2000) pp. 473-492.
18. M. J. Jacobson, Jr. and H. C. Williams, The size of the fundamental solutions of consecutive Pell equations, Exp. Math., Vol. 9, No. 4 (2000) pp. 631-640.
19. D. Kügler, Eine Aufwandsanalyze für identitätsbasierte Kryptosysteme, Master's thesis, Technische Universität Darmstadt, Darmstadt, Germany, 1998, (in German), via http://www.informatik.tudarmstadt.de/TI/Veroeffentlichung.
20. S. Lang, Algebraic number theory, Second Edition, Springer, Berlin, 1991, ISBN 3-540-94225-4.
21. A. K. Lenstra and E. Verheul, Selecting cryptographic key sizes, Proceedings of Public Key Cryptography 2000, Lecture Notes in Computer Science, Vol. 1751 (2000) pp. 446-465.
22. The LiDIA Group, LiDIA: a C++ library for computational number theory, Software, Technische Universität Darmstadt, Germany, 1997, See http://www.informatik.tu-darmstadt.de/TI/LiDIA.
23. R. F. Lukes, C. D. Patterson and H. C. Williams, Numerical sieving devices: Their history and some applications, Nieuw Archief voor Wiskunde, Vol. 13, No. 4 (1995) pp. 113-139.
24. M. Mauer and D. Kügler, A note on the weakness of the Maurer-Yacobi squaring method, Tech. report, Department of Computer Science, Technical University of Darmstadt, Darmstadt, Germany, 1999, To appear.
25. U. Maurer and Y. Yacobi, Non-interactive public-key cryptography, Advances in Cryptology-EUROCRYPT'91, Lecture Notes in Computer Science, Vol. 547 (1991) pp. 498-507.
26. U. Maurer and Y. Yacobi, A remark on a non-interactive public-key distribution system, Advances in Cryptology-EUROCRYPT'92, Lecture Notes in Computer Science, Vol. 658 (1993) pp. 458-460.
27. U. Maurer and Y. Yacobi, A non-interactive public-key distribution system, Design Codes and Cryptography, Vol. 9 (1996) pp. 305-316.
28. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of applied cryptography, Series on discrete mathematics and its applications, CRC Press, Boca Raton, 1996, ISBN 0-8493-8523-7.
29. J. Neukirch, Algebraische zahlentheorie, Springer, Berlin (1992).
30. R. Rivest, The MD5 message-digest algorithm, 1992, RFC1321, Internet Activities Board, Internet Engineering Task Force.
31. O. Schirokauer, Discrete logarithms and local units, Theory and applications of numbers without large prime factors (R. C. Vaughan, ed.), Philos. Trans. Roy. Soc. London Ser. A, Vol. 345, The Royal Society, London, 1993, pp. 409-423.
32. O. Schirokauer, Using number fields to compute logarithms in finite fields, Math. Comp., Vol. 69 (2000) pp. 1267-1283.
33. A. Shamir, Identity based cryptosystems and signature schemes, Advances in Cryptology-CRYPTO '84, Lecture Notes in Computer Science, Vol. 196 (1985) pp. 47-53.
34. D. Weber, Computing discrete logarithms with the number field sieve, Algorithmic Number Theory-ANTS-II (Université Bordeaux I, Talence, France), Lecture Notes in Computer Science, Vol. 1122, Springer-Verlag, Berlin (1996).
35. D. Weber and T. Denny, The solution of McCurley's discrete log challenge, Advances in Cryptology-CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462 (1998) pp. 56-60.