{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:39Z","timestamp":1772283579474,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540423003","type":"print"},{"value":"9783540477198","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47719-5_9","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T05:15:16Z","timestamp":1180761316000},"page":"84-103","source":"Crossref","is-referenced-by-count":2,"title":["First Implementation of Cryptographic Protocols Based on Algebraic Number Fields"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Neis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Pfahler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.2307\/2008811","volume":"55","author":"E. Bach","year":"1990","unstructured":"E. Bach. Explicit bounds for primality testing and related problems. Math. Comp., 55:355\u2013380, 1990.","journal-title":"Math. Comp."},{"key":"9_CR2","volume-title":"Number theory","author":"Z.I. Borevic","year":"1966","unstructured":"Z.I. Borevic and I.R. Safarevic. Number theory. Academic Press, New York, 1966."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0022-314X(85)90039-3","volume":"20","author":"J. Buchmann","year":"1985","unstructured":"J. Buchmann. A generalization of Voronoi\u2019s unit algorithm I and II. Journal of Number Theory, 20:177\u2013209, 1985.","journal-title":"Journal of Number Theory"},{"issue":"177","key":"9_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1090\/S0025-5718-1987-0866097-1","volume":"48","author":"J. Buchmann","year":"1987","unstructured":"J. Buchmann. The computation of the fundamental unit of totally complex quartic orders. Mathematics of Computation, 48(177):39\u201354, January 1987.","journal-title":"Mathematics of Computation"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0022-314X(87)90093-X","volume":"26","author":"J. Buchmann","year":"1987","unstructured":"J. Buchmann. On the period length of the generalized Lagrange algorithm. Journal of Number Theory, 26:31\u201337, 1987.","journal-title":"Journal of Number Theory"},{"key":"9_CR6","unstructured":"J. Buchmann, I. Biehl, S. Hamdy, and A. Meyer. Cryptographic protocols based on the intractability of extracting roots and computing discrete logarithms. Technical report No. TI-16\/99, Darmstadt University of Technology, 1999."},{"key":"9_CR7","unstructured":"J. Buchmann, I. Biehl, S. Hamdy, and A. Meyer. A signature scheme based on the intractability of computing roots. Design, Codes and Cryptography, to appear, 2001."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1090\/S0025-5718-97-00880-6","volume":"66","author":"J. Buchmann","year":"1997","unstructured":"J. Buchmann, M.J. Jacobson, Jr., and E. Teske. On some computational problems in finite abelian groups. Mathematics of Computation, 66:1663\u20131687, 1997.","journal-title":"Mathematics of Computation"},{"key":"9_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BFb0052250","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 97","author":"J. Buchmann","year":"1997","unstructured":"J. Buchmann and S. Paulus. A one way function based on module arithmetic in number fields. In Advances in Cryptology \u2014 CRYPTO\u2019 97, number 1294 in LNCS, pages 385\u2013394. Springer-Verlag, 1997."},{"key":"9_CR10","volume-title":"A course in computational algebraic number theory","author":"H. Cohen","year":"1995","unstructured":"H. Cohen. A course in computational algebraic number theory. Springer, Heidelberg, 1995."},{"key":"9_CR11","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. In Number Theory, Lecture notes in Math., volume 1068, pages 33\u201362. Springer-Verlag, New York, 1983."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.2307\/2007878","volume":"48","author":"H. Cohen","year":"1987","unstructured":"H. Cohen and J. Martinet. Class groups of number fields: numerical heuristics. Math. Comp., (48):123\u2013137, 1987.","journal-title":"Math. Comp."},{"key":"9_CR13","first-page":"39","volume":"404","author":"H. Cohen","year":"1990","unstructured":"H. Cohen and J. Martinet. Etude heuristique des groupes de classes des corps de nombres. J. Reine Angew. Math., (404):39\u201376, 1990.","journal-title":"J. Reine Angew. Math."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"D. Coppersmith, A.M. Odlyzko, and R. Schroeppel. Discrete logarithms in GF(p). Algorithmica, 1:1\u201315, 1986.","journal-title":"Algorithmica"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"865","DOI":"10.2307\/2153546","volume":"62","author":"G. Frey","year":"1994","unstructured":"G. Frey and H.-G. R\u00fcck. A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. Mathematics of Computation, 62:865\u2013874, 1994.","journal-title":"Mathematics of Computation"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/1990896","volume":"2","author":"J. L. Hafner","year":"1989","unstructured":"J. L. Hafner and K. S. McCurley. A rigorous subexponential algorithm for computation of class groups. J. Amer. Math. Soc., 2:839\u2013850, 1989.","journal-title":"J. Amer. Math. Soc."},{"key":"9_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-44448-3_18","volume-title":"Proc. of AISACRYPT 2000","author":"S. Hamdy","year":"2000","unstructured":"S. Hamdy and B. M\u00f6ller. Security of cryptosystems based on class groups of imaginary quadratic orders. In Proc. of AISACRYPT 2000, volume 1976 of Lecture Notes in Computer Science, pages 234\u2013247. Springer, 2000."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/03081088608817705","volume":"19","author":"J.A. Howell","year":"1986","unstructured":"J.A. Howell. Spans in the module (\u2124m)s. Lin. Mult. Alg., 19:67\u201377, 1986.","journal-title":"Lin. Mult. Alg."},{"key":"9_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0853-2","volume-title":"Algebraic number theory","author":"S. Lang","year":"1994","unstructured":"S. Lang. Algebraic number theory. Springer, New York, 1994."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra and H.W. Lenstra Jr. Algorithms in number theory. In J. van Leeuwen, editor, Handbook of theoretical computer science. Volume A. Algorithms and Complexity, chapter 12, pages 673\u2013715. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50017-5"},{"key":"9_CR21","first-page":"3","volume":"3","author":"A.K. Lenstra","year":"1999","unstructured":"A.K. Lenstra and E.R. Verheul. Selecting cryptographic key sizes in commercial applications. CCE Quarterley Journal, 3:3\u201310, 1999. http:\/\/www.cryptosavvy.com .","journal-title":"CCE Quarterley Journal"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2152702","volume":"5","author":"H.W. Lenstra Jr.","year":"1992","unstructured":"H.W. Lenstra Jr. and C. Pomerance. A rigorous time bound for factoring integers. J. Amer. Math. Soc., 5:483\u2013516, 1992.","journal-title":"J. Amer. Math. Soc."},{"key":"9_CR23","unstructured":"LiDIA Group. LiDIA-A library for computational number theory, 1994-2001. http:\/\/www.informatik.tu-darmstadt.de\/TI\/LiDIA ."},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jnth.1994.1087","volume":"49","author":"S. Louboutin","year":"1994","unstructured":"S. Louboutin. The exponent 2-class-group problem for non-galois-over Q quartic fields that are quadratic extensions of imaginary quadratic fields. J. Number Theory, 49:133\u2013141, 1994.","journal-title":"J. Number Theory"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S0027763000005249","volume":"138","author":"S. Louboutin","year":"1995","unstructured":"S. Louboutin. Class-number problems for cubic number fields. Nagoya Math. J., 138:199\u2013208, 1995.","journal-title":"Nagoya Math. J."},{"key":"9_CR26","unstructured":"K. McCurley. Cryptographic key distribution and computation in class groups. In R.A. Mollin, editor, Number Theory and Applications, pages 459\u2013479. Kluwer Academic Publishers, 1989."},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. In Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, pages 80\u201389, 1991.","DOI":"10.1145\/103418.103434"},{"key":"9_CR28","unstructured":"A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997."},{"key":"9_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054870","volume-title":"Proc. of Algorithmic Number Theory Symposium III (ANTS III)","author":"S. Neis","year":"1998","unstructured":"S. Neis. Reducing ideal arithmetic to linear algebra problems. In Proc. of Algorithmic Number Theory Symposium III (ANTS III), volume 1423 of Lecture Notes in Computer Science. Springer, 1998."},{"key":"9_CR30","series-title":"PhD thesis","volume-title":"Berechnung von Klassengruppen","author":"S. Neis","year":"2001","unstructured":"S. Neis. Berechnung von Klassengruppen. PhD thesis, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany, 2001. In work."},{"key":"9_CR31","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511661952","volume-title":"Algorithmic algebraic number theory","author":"M. Pohst","year":"1989","unstructured":"M. Pohst and H. Zassenhaus. Algorithmic algebraic number theory. Cambridge University Press, Cambridge, 1989."},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"J.M. Pollard. A Monte Carlo method for factorization. BIT, 15:331\u2013334, 1975.","journal-title":"BIT"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"J.M. Pollard. Monte Carlo methods for index computation (mod p). Math. Comp., 32:918\u2013924, 1978.","journal-title":"Math. Comp."},{"key":"9_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"FCT\u2019 91","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr and M. Euchner. Lattice basis reduction: improved practical algorithms and solving subset sum problems. In FCT\u2019 91, volume 529 of Lecture Notes in Computer Science, pages 68\u201385. Springer, 1991."},{"key":"9_CR35","unstructured":"R.J. Schoof. Quadratic fields and factorization. In H.W. Lenstra Jr. and R. Tijdeman, editors, Computational methods in number theory, pages 235\u2013286. Mathematisch Centrum, 1982."},{"key":"9_CR36","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s001459900052","volume":"12\/3","author":"N.P. Smart","year":"1999","unstructured":"N.P. Smart. The discrete logarithm problem on elliptic curves of trace one. Journal of Cryptology, 12\/3:193\u2013196, 1999.","journal-title":"Journal of Cryptology"},{"key":"9_CR37","unstructured":"N.P. Smart. How secure are elliptic curves over composite extension fields? Technical report CSTR-00-017, Dept. of Computer Science, University of Bristol, 2000."},{"key":"9_CR38","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01405166","volume":"23","author":"H.M. Stark","year":"1974","unstructured":"H.M. Stark. Some effiective cases of the Brauer-Siegel Theorem. Inventiones math., 23:135\u2013152, 1974.","journal-title":"Inventiones math."},{"key":"9_CR39","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0022-314X(75)90019-0","volume":"7","author":"H.J. Stender","year":"1975","unstructured":"H.J. Stender. Eine Formel f\u00fcr Grundeinheiten in reinen algebraischen Zahlk\u00f6rpern dritten, vierten und sechsten Grades. Journal of Number Theory, 7:235\u2013250, 1975.","journal-title":"Journal of Number Theory"},{"key":"9_CR40","series-title":"PhD thesis","volume-title":"Berechnung von Hermite-Normalformen","author":"P. Theobald","year":"2000","unstructured":"P. Theobald. Berechnung von Hermite-Normalformen. PhD thesis, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany, 2000."},{"key":"9_CR41","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Algorithmic Number Theory Symposium II (ANTS II)","author":"D. Weber","year":"1996","unstructured":"D. Weber. Computing discrete logarithms with the general number field sieve. In Proc. of Algorithmic Number Theory Symposium II (ANTS II), volume 1122 of Lecture Notes in Computer Science. Springer, 1996."},{"key":"9_CR42","doi-asserted-by":"crossref","first-page":"245","DOI":"10.5486\/PMD.1990.37.3-4.11","volume":"37","author":"H.C. Williams","year":"1990","unstructured":"H.C. Williams. The period length of Voronoi\u2019s algorithm for certain cubic orders. Pub. Math. Debrecen, 37:245\u2013265, 1990.","journal-title":"Pub. Math. Debrecen"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47719-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T04:18:05Z","timestamp":1683865085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47719-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423003","9783540477198"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/3-540-47719-5_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}