{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:55:26Z","timestamp":1753883726019},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666660"},{"type":"electronic","value":"9783540480006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48000-6_18","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T02:51:39Z","timestamp":1287024699000},"page":"219-231","source":"Crossref","is-referenced-by-count":11,"title":["Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields"],"prefix":"10.1007","author":[{"given":"Detlef","family":"H\u00fchnlein","sequence":"first","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Bach, E., Shallit, J.: Algorithmic number theory. Efficient Algorithms, Foundations of computing, vol.\u00a01. MIT press, Cambridge (1996) ISBN 0-262-02405-5"},{"key":"18_CR2","unstructured":"Biehl, I., Buchmann, J.: An analysis of the reduction algorithms for binary quadratic forms. In: Voronoi\u2019s Impact on Modern Science. Institute of Mathematics of National Academy of Sciences, vol.\u00a01, Kyiv, Ukraine (1998)"},{"key":"18_CR3","unstructured":"Biehl, I., Paulus, S., Takagi, T.: An efficient undeniable signature scheme based on non-maximal imaginary quadratic orders. In: Proceedings of Mathematics of Public Key Cryptography, Toronto (1999)"},{"key":"18_CR4","unstructured":"Brent, R.: ECM champs, ftp.comlab.ox.ac.uk\/pub\/Documents\/techpapers\/Richard.Brent\/champs.ecm"},{"key":"18_CR5","series-title":"LNCS","first-page":"134","volume-title":"Advances in Cryptology - CRYPTO 1990","author":"J. Buchmann","year":"1991","unstructured":"Buchmann, J., D\u00fcllmann, S.: On the computation of discrete logarithms in class groups. In: Advances in Cryptology - CRYPTO 1990. LNCS, vol.\u00a0773, pp. 134\u2013139. Springer, Heidelberg (1991)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/3-540-46885-4_57","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"J. Buchmann","year":"1990","unstructured":"Buchmann, J., D\u00fcllmann, S., Williams, H.C.: On the complexity and efficiency of a new key exchange system. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 597\u2013616. Springer, Heidelberg (1990)"},{"key":"18_CR7","volume-title":"Number Theory","author":"Z.I. Borevich","year":"1966","unstructured":"Borevich, Z.I., Shafarevich, I.R.: Number Theory. Academic Press, New York (1966)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"J. Buchmann","year":"1988","unstructured":"Buchmann, J., Williams, H.C.: A key-exchange system based on imaginary quadratic fields. Journal of Cryptology\u00a01, 107\u2013118 (1988)","journal-title":"Journal of Cryptology"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/BFb0034863","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"J. Cowie","year":"1996","unstructured":"Cowie, J., Dodson, B., Elkenbracht-Huizing, M., Lenstra, A.K., Montgomery, P.L., Zayer, J.: A worldwide number field sieve factoring record: on to 512 bits. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 382\u2013394. Springer, Heidelberg (1996)"},{"key":"18_CR10","series-title":"Graduate Texts in Mathematics","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":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer, Berlin (1993)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith, D., Odlyzko, A.M., Schroeppel, R.: Discrete logarithms in GF(p). Algorithmica\u00a01, 1\u201315 (1986)","journal-title":"Algorithmica"},{"key":"18_CR12","unstructured":"Cox, D.A.: Primes of the form x2 + ny2. John Wiley & Sons, New York (1989)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 472\u2013492 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR14","unstructured":"D\u00fcllmann, S.: Ein Algorithmus zur Bestimmung der Klassenzahl positiv definiter bin\u00e4rer quadratischer Formen, PHD-thesis, University of Saarbr\u00fccken (1991)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D.M. Gordon","year":"1993","unstructured":"Gordon, D.M.: Discrete logarithms in GF(p) using the number field sieve. SIAM Journal on Discrete Mathematics\u00a06, 124\u2013138 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"J.L. Hafner","year":"1989","unstructured":"Hafner, J.L., McCurley, K.S.: A rigorous subexponential algorithm for computation of class groups. Journal of the American Mathematical Society\u00a02, 837\u2013850 (1989)","journal-title":"Journal of the American Mathematical Society"},{"key":"18_CR17","volume-title":"Introduction to Number Theory","author":"L.K. Hua","year":"1982","unstructured":"Hua, L.K.: Introduction to Number Theory. Springer, New York (1982)"},{"key":"18_CR18","unstructured":"Hartmann, M., Paulus, S., Takagi, T.: NICE - New Ideal Coset Encryption. To appear in Workshop on Cryptographic Hardware and Embedded Systems"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/BFb0054134","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. H\u00fchnlein","year":"1998","unstructured":"H\u00fchnlein, D., Jacobson, M.J., Paulus, S., Takagi, T.: A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 294\u2013307. Springer, Heidelberg (1998)"},{"key":"18_CR20","unstructured":"H\u00fchnlein, D., Meyer, A., Takagi, T.: Rabin and RSA analogues based on nonmaximal imaginary quadratic orders. In: Proceedings of ICICS 1998, pp. 221\u2013240 (1998) ISBN 89-85305- 14-X"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"H\u00fchnlein, D.: Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders. T.R. TI-6, Technische Universt\u00e4t Darmstadt (1999), available at http:\/\/www.informatik.tu-darmstadt.de\/TI\/Veroeffentlichung\/TR\/Welcome.html","DOI":"10.1007\/3-540-46513-8_11"},{"key":"18_CR22","unstructured":"Jacobson Jr., M.J.: Subexponential Class Group Computation in Quadratic Orders, PhD thesis, Technische Universt\u00e4t Darmstadt (1999) (to appear)"},{"key":"18_CR23","first-page":"123","volume":"56","author":"H.W. Lenstra","year":"1982","unstructured":"Lenstra, H.W.: On the computation of regulators and class numbers of quadratic fields. London Math. Soc. Lecture Notes\u00a056, 123\u2013150 (1982)","journal-title":"London Math. Soc. Lecture Notes"},{"key":"18_CR24","series-title":"Lecture Notes in Mathematics","volume-title":"The development of the number field sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): The development of the number field sieve. Lecture Notes in Mathematics. Springer, Heidelberg (1993)"},{"key":"18_CR25","unstructured":"National Institute of Standards and Technology (NIST): Digital Signature Standard (DSS). In: Federal Information Processing Standards Publication 186, FIPS- 186 May 19, (1994)"},{"key":"18_CR26","unstructured":"Paulus, S., Takagi, T.: A new public-key cryptosystem over the quadratic order with quadratic decryption time. To appear in Journal of Cryptology"},{"key":"18_CR27","unstructured":"te Riele, H.J.J.: Factorization of RSA-140wit h the Number Field Sieve, posting in sci.crypt.research (February 1999)"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key-cryptosystems. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1090\/S0025-5718-1987-0866119-8","volume":"48","author":"R.D. Silverman","year":"1987","unstructured":"Silverman, R.D.: The multiple polynomial quadratic sieve. Math. Comp.\u00a048, 229\u2013329 (1987)","journal-title":"Math. Comp."},{"key":"18_CR30","first-page":"235","volume":"155","author":"R.J. Schoof","year":"1983","unstructured":"Schoof, R.J.: Quadratic Fields and Factorization. Computational Methods in Number Theory. Math. Centrum Tracts Part II. Amsterdam\u00a0155, 235\u2013286 (1983)","journal-title":"Computational Methods in Number Theory. Math. Centrum Tracts Part II. Amsterdam"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BFb0054125","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Weber","year":"1998","unstructured":"Weber, D.: Computing discrete logarithms with quadratic number rings. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 171\u2013183. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48000-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:55:38Z","timestamp":1559724938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48000-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666660","9783540480006"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48000-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}