{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:24Z","timestamp":1772283684758,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540632320","type":"print"},{"value":"9783540692379","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0027920","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:46:12Z","timestamp":1132641972000},"page":"126-138","source":"Crossref","is-referenced-by-count":17,"title":["Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields"],"prefix":"10.1007","author":[{"given":"Arjen K.","family":"Lenstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-48329-2_13","volume":"773","author":"M. Adleman","year":"1994","unstructured":"M. Adleman, J. DeMarrais, A subexponential algorithm for discrete logarithms over all finite fields, Proceedings Crypto'93, Lecture Notes in Comp. Sci. 773. 147\u2013158 (1994).","journal-title":"Proceedings Crypto'93, Lecture Notes in Comp. Sci."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00196789","volume":"3","author":"G. Agnew","year":"1991","unstructured":"G. Agnew, R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, An implementation for a fast public-key cryptosystem, Journal of Cryptology, 3, 63\u201379 (1991).","journal-title":"Journal of Cryptology"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, 31, 469\u2013472 (1985).","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00125200","volume":"2","author":"S. Gao","year":"1992","unstructured":"S. Gao, H.W. Lenstra, Jr., Optimal normal bases, Designs, Codes and Cryptography, 2, 315\u2013323 (1992).","journal-title":"Designs, Codes and Cryptography"},{"key":"12_CR5","volume-title":"Seminumerical algorithms","author":"D.E. Knuth","year":"1981","unstructured":"D.E. Knuth, The art of computer programming, volume 2, Seminumerical algorithms, second edition, Addison-Wesley, Reading, Massachusetts, 1981.","edition":"second edition"},{"key":"12_CR6","unstructured":"D.W. Kravitz, Digital signature algorithm, U.S. Patent # 5,231,668, 27 Jul 1993."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., Algorithms in number theory, J. van Leeuwen, editor, Handbook of Theoretical Computer Science, 674\u2013715, Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50017-5"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"P.L. Montgomery, Modular multiplication without trial division, Math. Comp., 44, 519\u2013521 (1985).","journal-title":"Math. Comp."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R.C. Mullin","year":"1988\/89","unstructured":"R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, R.M. Wilson, Optimal normal bases in GF(p n), Discrete Appl. Math., 22, 149\u2013161 (1988\/89).","journal-title":"Discrete Appl. Math."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"H. Riesel, Prime numbers and computer methods for factorization, Birkh\u00e4user, 1985.","DOI":"10.1007\/978-1-4757-1089-2"},{"key":"12_CR11","unstructured":"O. Schirokauer, Using number fields to compute logarithms in finite fields, to appear."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"O. Schirokauer, D. Weber, T. Denny, Discrete logarithms: the effectiveness of the index calculus method, H. Cohen, editor, Preproceedings ANTS II, Algorithmic number theory symposium, 327\u2013351, Universit\u00e9 de Bordeaux I, 1996.","DOI":"10.1007\/3-540-61581-4_66"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, 4, 161\u2013174 (1991).","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:47:17Z","timestamp":1586573237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632320","9783540692379"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0027920","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}