{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:10Z","timestamp":1759063570753,"version":"3.41.2"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1023\/a:1025746127771","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T14:33:40Z","timestamp":1067006020000},"page":"281-299","source":"Crossref","is-referenced-by-count":8,"title":["Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders"],"prefix":"10.1007","volume":"30","author":[{"given":"Detlef","family":"H\u00fchnlein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5144558_CR1","unstructured":"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)."},{"key":"5144558_CR2","doi-asserted-by":"crossref","unstructured":"D. Boneh and M. Franklin, Identity based encryption from the Weil Pairing, Advances in Cryptology \u2013 CRYPTO 2001, Lecture Notes in Computer Science, Vol. 2139 (2001) pp. 213\u2013229.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"5144558_CR3","volume-title":"Number theory","author":"Z. I. Borevich","year":"1966","unstructured":"Z. I. Borevich and I. R. Shafarevich, Number theory, Academic Press, New York (1966)."},{"key":"5144558_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A course in computational algebraic number theory","author":"H. Cohen","year":"1993","unstructured":"H. Cohen, A course in computational algebraic number theory, Springer-Verlag, Berlin (1993)."},{"issue":"222","key":"5144558_CR5","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-98-00912-0","volume":"67","author":"H. Cohen","year":"1998","unstructured":"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\u2013795.","journal-title":"Math. Comp."},{"key":"5144558_CR6","series-title":"Lecture Notes in Math.","first-page":"33","volume-title":"Number Theory","author":"H. Cohen","year":"1983","unstructured":"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\u201362."},{"key":"5144558_CR7","volume-title":"Primes of the form x 2 + ny 2","author":"D. A. Cox","year":"1989","unstructured":"D. A. Cox, Primes of the form x\n2 + ny\n2, John Wiley & Sons, New York (1989)."},{"key":"5144558_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine \u2013 a user's guide and tutorial for networked parallel computing","author":"A. Geist","year":"1994","unstructured":"A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek and V. Sunderam, PVM: Parallel Virtual Machine \u2013 a user's guide and tutorial for networked parallel computing, MIT Press, Cambridge, Mass. (1994)."},{"key":"5144558_CR9","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D. Gordon","year":"1993","unstructured":"D. Gordon, Discrete logarithms using the number field sieve, Siam J. Discrete Math., Vol. 6 (1993) pp. 124\u2013138.","journal-title":"Siam J. Discrete Math."},{"key":"5144558_CR10","unstructured":"D. H\u00fchnlein, Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders, Selected Areas in Cryptography \u2013 SAC'99, Lecture Notes in Computer Science, Vol. 1758 (1999) pp. 150\u2013167."},{"key":"5144558_CR11","doi-asserted-by":"crossref","unstructured":"D. H\u00fchnlein, Faster generation of NICE-Schnorr signatures, Topics in Cryptology\u2014CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, Lecture Notes in Computer Science, Vol. 2020 (2001) pp. 1\u201312.","DOI":"10.1007\/3-540-45353-9_1"},{"key":"5144558_CR12","unstructured":"D. H\u00fchnlein, Quadratic orders for NESSIE \u2013 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."},{"key":"5144558_CR13","doi-asserted-by":"crossref","unstructured":"D. H\u00fchnlein, M. J. Jacobson, Jr., S. Paulus and T. Takagi, A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption, Advances in Cryptology\u2014EUROCRYPT '98, Lecture Notes in Computer Science, Vol. 1403 (1998) pp. 294\u2013307.","DOI":"10.1007\/BFb0054134"},{"key":"5144558_CR14","doi-asserted-by":"crossref","unstructured":"D. H\u00fchnlein and J. Merkle, An efficient NICE-Schnorr-type signature scheme, Proceedings of PKC 2000, Melbourne, Lecture Notes in Computer Science, Vol. 1751 (2000).","DOI":"10.1007\/978-3-540-46588-1_2"},{"key":"5144558_CR15","doi-asserted-by":"crossref","unstructured":"D. H\u00fchnlein and T. Takagi, Reducing logarithms in totally non-maximal imaginary quadratic orders to logarithms in finite fields, Advances in Cryptology \u2013 ASIACRYPT '99, Lecture Notes in Computer Science (1999).","DOI":"10.1007\/978-3-540-48000-6_18"},{"key":"5144558_CR16","volume-title":"Subexponential class group computation in quadratic orders","author":"M. J. Jacobson Jr.","year":"1999","unstructured":"M. J. Jacobson, Jr., Subexponential class group computation in quadratic orders, Ph.D. thesis, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany (1999)."},{"key":"5144558_CR17","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s001450010013","volume":"13","author":"M. J. Jacobson Jr.","year":"2000","unstructured":"M. J. Jacobson, Jr., Computing discrete logarithms in quadratic orders, Journal of Cryptology, Vol. 13 (2000) pp. 473\u2013492.","journal-title":"Journal of Cryptology"},{"issue":"4","key":"5144558_CR18","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/10586458.2000.10504666","volume":"9","author":"M. J. Jacobson Jr.","year":"2000","unstructured":"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\u2013640.","journal-title":"Exp. Math."},{"key":"5144558_CR19","volume-title":"Eine Aufwandsanalyze f\u00fcr identit\u00e4tsbasierte Kryptosysteme","author":"D. K\u00fcgler","year":"1998","unstructured":"D. K\u00fcgler, Eine Aufwandsanalyze f\u00fcr identit\u00e4tsbasierte Kryptosysteme, Master's thesis, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany, 1998, (in German), via http:\/\/www.informatik.tudarmstadt. de\/TI\/Veroeffentlichung."},{"key":"5144558_CR20","volume-title":"Algebraic number theory","author":"S. Lang","year":"1991","unstructured":"S. Lang, Algebraic number theory, Second Edition, Springer, Berlin, 1991, ISBN 3-540-94225-4.","edition":"Second Edition"},{"key":"5144558_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013465.","DOI":"10.1007\/978-3-540-46588-1_30"},{"key":"5144558_CR22","volume-title":"a C++ library for computational number theory","author":"The LiDIA Group, LiDIA","year":"1997","unstructured":"The LiDIA Group, LiDIA: a C++ library for computational number theory, Software, Technische Universit\u00e4t Darmstadt, Germany, 1997, See http:\/\/www.informatik.tu-darmstadt.de\/TI\/LiDIA."},{"issue":"4","key":"5144558_CR23","first-page":"113","volume":"13","author":"R. F. Lukes","year":"1995","unstructured":"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\u2013139.","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"5144558_CR24","volume-title":"A note on the weakness of the Maurer-Yacobi squaring method","author":"M. Maurer","year":"1999","unstructured":"M. Maurer and D. K\u00fcgler, 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."},{"key":"5144558_CR25","doi-asserted-by":"crossref","unstructured":"U. Maurer and Y. Yacobi, Non-interactive public-key cryptography, Advances in Cryptology\u2014 EUROCRYPT '91, Lecture Notes in Computer Science, Vol. 547 (1991) pp. 498\u2013507.","DOI":"10.1007\/3-540-46416-6_43"},{"key":"5144558_CR26","doi-asserted-by":"crossref","unstructured":"U. Maurer and Y. Yacobi, A remark on a non-interactive public-key distribution system, Advances in Cryptology\u2014EUROCRYPT '92, Lecture Notes in Computer Science, Vol. 658 (1993) pp. 458\u2013460.","DOI":"10.1007\/3-540-47555-9_39"},{"key":"5144558_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1027332606155","volume":"9","author":"U. Maurer","year":"1996","unstructured":"U. Maurer and Y. Yacobi, A non-interactive public-key distribution system, Design Codes and Cryptography, Vol. 9 (1996) pp. 305\u2013316.","journal-title":"Design Codes and Cryptography"},{"key":"5144558_CR28","volume-title":"Handbook of applied cryptography","author":"A. Menezes","year":"1996","unstructured":"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."},{"key":"5144558_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-37663-7","volume-title":"Algebraische zahlentheorie","author":"J. Neukirch","year":"1992","unstructured":"J. Neukirch, Algebraische zahlentheorie, Springer, Berlin (1992)."},{"key":"5144558_CR30","doi-asserted-by":"crossref","unstructured":"R. Rivest, The MD5 message-digest algorithm, 1992, RFC1321, Internet Activities Board, Internet Engineering Task Force.","DOI":"10.17487\/rfc1321"},{"key":"5144558_CR31","series-title":"Philos. Trans. Roy. Soc. London Ser. A","first-page":"409","volume-title":"Theory and applications of numbers without large prime factors","author":"O. Schirokauer","year":"1993","unstructured":"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\u2013423."},{"key":"5144558_CR32","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1090\/S0025-5718-99-01137-0","volume":"69","author":"O. Schirokauer","year":"2000","unstructured":"O. Schirokauer, Using number fields to compute logarithms in finite fields, Math. Comp., Vol. 69 (2000) pp. 1267\u20131283.","journal-title":"Math. Comp."},{"key":"5144558_CR33","doi-asserted-by":"crossref","unstructured":"A. Shamir, Identity based cryptosystems and signature schemes, Advances in Cryptology\u2014CRYPTO '84, Lecture Notes in Computer Science, Vol. 196 (1985) pp. 47\u201353.","DOI":"10.1007\/3-540-39568-7_5"},{"key":"5144558_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Number Theory\u2014 ANTS-II","author":"D. Weber","year":"1996","unstructured":"D. Weber, Computing discrete logarithms with the number field sieve, Algorithmic Number Theory\u2014 ANTS-II (Universit\u00e9Bordeaux I, Talence, France), Lecture Notes in Computer Science, Vol. 1122, Springer\u2013Verlag, Berlin (1996)."},{"key":"5144558_CR35","doi-asserted-by":"crossref","unstructured":"D. Weber and T. Denny, The solution of McCurley's discrete log challenge, Advances in Cryptology\u2014CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462 (1998) pp. 56\u201360.","DOI":"10.1007\/BFb0055747"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025746127771.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025746127771\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025746127771.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:48:57Z","timestamp":1753760937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025746127771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["5144558"],"URL":"https:\/\/doi.org\/10.1023\/a:1025746127771","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}