{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T11:02:39Z","timestamp":1776769359380,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602217","type":"print"},{"value":"9783540447504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-44750-4_4","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:39:53Z","timestamp":1187253593000},"page":"43-56","source":"Crossref","is-referenced-by-count":113,"title":["Fast Key Exchange with Elliptic Curve Systems"],"prefix":"10.1007","author":[{"given":"Richard","family":"Schroeppel","sequence":"first","affiliation":[]},{"given":"Hilarie","family":"Orman","sequence":"additional","affiliation":[]},{"given":"Sean","family":"O\u2019Malley","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Spatscheck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02620228","volume":"6","author":"G. Agnew","year":"1993","unstructured":"G. Agnew, T. Beth, R. Mullin and S. Vanstone, \u201cArithmetic Operations in GF(2m)\u201d, Journal of Cryptology, 6 (1993), 3\u201313.","journal-title":"Journal of Cryptology"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"G. Agnew","year":"1993","unstructured":"G. Agnew, R. Mullin and S. Vanstone, \u201cAn Implementation of Elliptic Curve Cryptosystems over $$ F_{2^{155} } $$ \u201d, IEEE Journal on Selected Areas in Communications, 11 (1993), 804\u2013813.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00196789","volume":"3","author":"G. Agnew","year":"1991","unstructured":"G. Agnew, R. Mullin, I. Onyszchuk and S. Vanstone, \u201cAn Implementation for a Fast Public-Key Cryptosystem\u201d, Journal of Cryptology, 3 (1991), 63\u201379.","journal-title":"Journal of Cryptology"},{"key":"4_CR4","unstructured":"Elwyn Berlekamp, Algebraic Coding Theory, McGraw-Hill, 1968, p.41."},{"key":"4_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-46416-6_27","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 91","author":"T. Beth","year":"1991","unstructured":"T. Beth and F. Schaefer, \u201cNon Supersingular Elliptic Curves for Public Key Cryptosystems\u201d, Advances in Cryptology \u2014 EUROCRYPT\u2019 91, Lecture Notes in Computer Science, 547 (1991), Springer-Verlag, 316\u2013327."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"A. D. Booth","year":"1951","unstructured":"A. D. Booth, \u201cA Signed Binary Multiplication Technique\u201d, Q. J. Mech. Appl. Math.4 (1951), 236\u2013240.","journal-title":"Q. J. Mech. Appl. Math."},{"key":"4_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/0-387-34805-0_37","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89","author":"J. Bos","year":"1990","unstructured":"J. Bos and M. Coster, \u201cAddition Chain Heuristics\u201d, Advances in Cryptology \u2014 CRYPTO\u2019 89, Lecture Notes in Computer Science, 435 (1990), Springer-Verlag, 400\u2013407."},{"key":"4_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"E. Brickell","year":"1993","unstructured":"E. Brickell, D. Gordon, K. McCurley, and D. Wilson, \u201cFast Exponentiation with Precomputation (Extended Abstract)\u201d, Advances in Cryptology \u2014 EUROCRYPT\u2019 92, Lecture Notes in Computer Science, 658 (1993), Springer-Verlag, 200\u2013207."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"D. Coppersmith, A. Odlyzko, and R. Schroeppel, \u201cDiscrete Logarithms in GF[p]\u201d, Algorithmica, 1 (1986), 1\u201315.","journal-title":"Algorithmica"},{"key":"4_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-58691-1_42","volume-title":"Algorithmic Number Theory: First International Symposium","author":"J.-M. Couveignes","year":"1994","unstructured":"Jean-Marc Couveignes and Fran\u00e7ois MorainAlgorithmic Number Theory: First International Symposium, Lecture Notes in Computer Science, 877 (1994), Springer-Verlag, 43\u201358."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Whitfield Diffie and M. E. Hellman, \u201cNew Directions in Cryptography\u201d, IEEE Transactions on Information Theory, IT-22, n. 6, Nov. 1976, pp 644\u2013654","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, \u201cA Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms\u201d, IEEE Trans. on Information Theory, 31 (1985), 469\u2013472.","journal-title":"IEEE Trans. on Information Theory"},{"key":"4_CR13","unstructured":"Torbjorn Granlund, GMP, the GNU bignum package, version 1.3.2a, July 1994. ftp:\/\/prep.ai.mit.edu\/pub\/gnu\/gmp-1.3.2.tar.gz"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-47555-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"G. Harper","year":"1993","unstructured":"Greg Harper, Alfred Menezes, and Scott Vanstone \u201cPublic-Key Cryptosystems with Very Small Key Lengths\u201d, Advances in Cryptology \u2014 EUROCRYPT\u2019 92, Lecture Notes in Computer Science, 658 (1993), Springer-Verlag, 163\u2013173."},{"key":"4_CR15","unstructured":"The Internet Engineering Task Force Working Group on Security for IPv4; drafts on key management available via FTP from the archives at ds.internic.net; http:\/\/internet-drafts\/draft-karn-photuris-00.txt"},{"key":"4_CR16","first-page":"31","volume":"44","author":"T. Itoh","year":"1986","unstructured":"T. Itoh, O. Teechi, and S. Tsujii, \u201cA Fast Algorithm for Computing Multiplicative Inverses in GF(2t) Using Normal Bases\u201d (in Japanese), J. Society for Electronic Communications (Japan), 44 (1986), 31\u201336.","journal-title":"J. Society for Electronic Communications (Japan)"},{"key":"4_CR17","first-page":"293","volume":"145","author":"A. Karatsuba","year":"1962","unstructured":"A. Karatsuba, Doklady Akademiia Nauk SSSR145 (1962), 293\u2013294.","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"4_CR18","unstructured":"Donald E. Knuth, Seminumerical Algorithms, The Art of Computer Programming, 2 Addison Wesley 1969"},{"issue":"177","key":"4_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Neal Koblitz, \u201cElliptic Curve Cryptosystems\u201d, Mathematics of Computation, 48 n. 177 (1987), 203\u2013209.","journal-title":"Mathematics of Computation"},{"key":"4_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-38424-3_11","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 90 Proceedings","author":"N. Koblitz","year":"1991","unstructured":"Neal Koblitz, \u201cConstructing Elliptic Curve Cryptosystems in Characteristic 2\u201d, Advances in Cryptology \u2014 CRYPTO\u2019 90 Proceedings, Lecture Notes in Computer Science, 537 (1991), Springer-Verlag, 156\u2013167."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF00123958","volume":"1","author":"B. Macchia La","year":"1991","unstructured":"B. La Macchia and A. Odlyzko, \u201cComputation of Discrete Logarithms in Prime Fields\u201d, Designs, Codes and Cryptography, 1 (1991), p. 47\u201362.","journal-title":"Designs, Codes and Cryptography"},{"key":"4_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-58691-1_64","volume-title":"Algorithmic Number Theory: First International Symposium","author":"G. Lay","year":"1994","unstructured":"G. Lay and H. Zimmer, \u201cConstructing Elliptic Curves with Given Group Order over Large Finite Fields\u201d, Algorithmic Number Theory: First International Symposium, Lecture Notes in Computer Science, 877 (1994), Springer-Verlag, 250\u2013263."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Alfred J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"4_CR24","unstructured":"Alfred J. Menezes, Minghua Qu, and Scott A. Vanstone, \u201cStandard for RSA, Diffie-Hellman and Related Public Key Cryptography\u201d, Working Draft of IEEE P1363 Standard, April 24, 1995."},{"key":"4_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 85 Proceedings","author":"V. S. Miller","year":"1986","unstructured":"Victor S. Miller, \u201cUse of Elliptic Curves in Cryptography\u201d, Advances in Cryptology \u2014 CRYPTO\u2019 85 Proceedings, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417\u2013426."},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P. L. Montgomery","year":"1985","unstructured":"Peter L. Montgomery, \u201cModular Multiplication without Trial Division\u201d, Mathematics of Computation, 44 (1985), 519\u2013521.","journal-title":"Mathematics of Computation"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"P. van Ooorschot and M. Wiener, \u201cParallel Collision Search with Application to Hash Functions and Discrete Logarithms\u201d, 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, November 4, 1994.","DOI":"10.1145\/191177.191231"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. Pollard","year":"1978","unstructured":"J. Pollard, \u201cMonte Carlo Methods for Index Computation mod p\u201d, Mathematics of Computation, 32 (1978), 918\u2013924.","journal-title":"Mathematics of Computation"},{"key":"4_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-47555-9_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"J. Sauerbrey","year":"1993","unstructured":"J\u00f6rg Sauerbrey and Andreas Dietel \u201cResource Requirements for the Application of Addition Chains in Modulo Exponentiation\u201d, Advances in Cryptology \u2014 EUROCRYPT\u2019 92, Lecture Notes in Computer Science, 658 (1993), Springer-Verlag, 174\u2013182."},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R. Schoof","year":"1985","unstructured":"R. Schoof, \u201cElliptic Curves Over Finite Fields and the Computation of Square Roots mod p\u201d, Mathematics of Computation, 44 (1985), 483\u2013494.","journal-title":"Mathematics of Computation"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Rich Schroeppel, Hilarie Orman, Sean O\u2019Malley, and Oliver Spatscheck, \u201cFast Key Exchange with Elliptic Curve Systems\u201d, Univ. of Ariz. Comp. Sci. Tech. Report 95-03 (1995).","DOI":"10.1007\/3-540-44750-4_4"},{"key":"4_CR32","unstructured":"J. H. Silverman, The Arithmetic of Elliptic Curves, Springer Graduate Texts in Mathematics 106 (1992)."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPT0\u2019 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44750-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:18:32Z","timestamp":1556770712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44750-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602217","9783540447504"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-44750-4_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}