{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T10:09:01Z","timestamp":1776766141169,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540564133","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_14","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:23:49Z","timestamp":1186615429000},"page":"163-173","source":"Crossref","is-referenced-by-count":42,"title":["Public-Key Cryptosystems with Very Small Key Lengths"],"prefix":"10.1007","author":[{"given":"Greg","family":"Harper","sequence":"first","affiliation":[]},{"given":"Alfred","family":"Menezes","sequence":"additional","affiliation":[]},{"given":"Scott","family":"Vanstone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"G. Agnew, R. Mullin and S. Vanstone, \u201cAn implementation of elliptic cryptosystems over $$ F_{2^{155} } $$ \u201d, preprint, 1992.","DOI":"10.1109\/49.223883"},{"key":"14_CR2","volume-title":"Algebraic Coding Theory","author":"E. Berlekamp","year":"1968","unstructured":"E. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R. Brent","year":"1980","unstructured":"R. Brent, \u201cAn improved Monte Carlo factoring algorithm\u201d, BIT, 20 (1980), 176\u2013184.","journal-title":"BIT"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"R. Brent, \u201cParallel algorithms for integer factorisation\u201d, in Number Theory and Cryptography, Cambridge University Press, 1990, 26\u201337.","DOI":"10.1017\/CBO9781107325838.004"},{"key":"14_CR5","unstructured":"E. Brickell, D. Gordon, K. McCurley and D. Wilson, \u201cFast exponentiation with precomputation\u201d, preprint, 1992."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B. Chor","year":"1988","unstructured":"B. Chor and R. Rivest, \u201cA knapsack-type public key cryptosystem based on arithmetic in finite fields\u201d, IEEE Transactions on Information Theory, 34 (1988), 901\u2013909.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNew directions in cryptography\u201d, IEEE Transactions on Information Theory, 22 (1976), 644\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR8","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 Transactions on Information Theory, 31 (1985), 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR9","unstructured":"D. Gordon and K. McCurley, \u201cComputation of discrete logarithms in GF(2n)\u201d, presentation at Crypto\u2019 91, Santa Barbara, 1991."},{"key":"14_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0310-7","volume-title":"A Course in Number Theory and Cryptography","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1987."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, \u201cElliptic curve cryptosystem\u201d, Mathematics of Computation, 48 (1987), 203\u2013209.","journal-title":"Mathematics of Computation"},{"key":"14_CR12","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: Proceedings of Crypto\u2019 90","author":"N. Koblitz","year":"1991","unstructured":"N. Koblitz, \u201cConstructing elliptic curve cryptosystems in characteristic 2\u201d, Advances in Cryptology: Proceedings of Crypto\u2019 90, Lecture Notes in Computer Science, 537 (1991), Springer-Verlag, 156\u2013167."},{"key":"14_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 91","author":"N. Koblitz","year":"1992","unstructured":"N. Koblitz, \u201cCM-Curves with good cryptographic properties\u201d, Advances in Cryptology: Proceedings of Crypto\u2019 91, Lecture Notes in Computer Science, 576 (1992), Springer-Verlag, 279\u2013287."},{"key":"14_CR14","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), 47\u201362.","journal-title":"Designs, Codes and Cryptography"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"A. Menezes, T. Okamoto and S. Vanstone, \u201cReducing elliptic curve logarithms to logarithms in a finite field\u201d, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 80\u201389, 1991.","DOI":"10.1145\/103418.103434"},{"key":"14_CR16","unstructured":"A. Menezes and S. Vanstone, \u201cElliptic curve cryptosystems and their implementation\u201d, submitted to Journal of Cryptology, 1991."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"A. Menezes, S. Vanstone and R. Zuccherato, \u201cCounting points on elliptic curves over $$ F_{2^m } $$ \u201d, to appear in Mathematics of Computation, 1992.","DOI":"10.2307\/2153177"},{"key":"14_CR18","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: Proceedings of Crypto\u2019 85","author":"V. Miller","year":"1986","unstructured":"V. Miller, \u201cUses of elliptic curves in cryptography\u201d, Advances in Cryptology: Proceedings of Crypto\u2019 85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417\u2013426."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R. Mullin","year":"1988","unstructured":"R. Mullin, I. Onyszchuk, S. Vanstone and R. Wilson, \u201cOptimal normal bases in GF(p n)\u201d, Discrete Applied Mathematics, 22 (1988\/89), 149\u2013161.","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Advances in Cryptology \u2014 Proceedings of Eurocrypt\u2019 84","author":"A. Odlyzko","year":"1985","unstructured":"A. Odlyzko, \u201cDiscrete logarithms in finite fields and their cryptographic significance\u201d, Advances in Cryptology \u2014 Proceedings of Eurocrypt\u2019 84, Lecture Notes in Computer Science, 209 (1985), Springer-Verlag, 224\u2013314."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"S. Pohlig and M. Hellman, \u201cAn improved algorithm for computing logarithms over GF (p) and its cryptographic significance\u201d, IEEE Transactions on Information Theory, 24 (1978), 106\u2013110.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR22","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":"14_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems\u201d, Communications of the ACM, 21 (1978), 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"14_CR24","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":"14_CR25","unstructured":"P. van Oorschot, \u201cA comparison of practical public key cryptosystems\u201d, in Contemporary Cryptology, IEEE Press, 1992, 289\u2013322."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:53Z","timestamp":1605647633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_14","relation":{},"subject":[]}}