{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T19:20:16Z","timestamp":1791314416765,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540618720","type":"print"},{"value":"9783540707073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0034835","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:32:03Z","timestamp":1134286323000},"page":"57-64","source":"Crossref","is-referenced-by-count":2,"title":["Generating standard DSA signatures without long inversion"],"prefix":"10.1007","author":[{"given":"Arjen K.","family":"Lenstra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-46416-6_6","volume":"547","author":"P. Rooij de","year":"1991","unstructured":"P. de Rooij, On the security of the Schnorr scheme using preprocessing, Advances in Cryptology, Eurocrypt'91, Lecture Notes in Comput. Sci. 547 (1991) 71\u201380.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/3-540-48285-7_37","volume":"765","author":"P. Rooij de","year":"1994","unstructured":"P. de Rooij, On Schnorr's preprocessing for digital signature schemes, Advances in Cryptology, Eurocrypt'93, Lecture Notes in Comput. Sci. 765 (1994) 435\u2013439.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"6_CR3","first-page":"1102","volume":"58","author":"O. Goldreich","year":"1993","unstructured":"O. Goldreich, L. A. Levin, Hard core bits for any one way function, 22nd Annual ACM symposium on theory of computing (1990); J. Symbolic Logic 58 (1993) 1102\u20131103.","journal-title":"J. Symbolic Logic"},{"key":"6_CR4","unstructured":"B. Kaliski, Timing attacks on Cryptosystems, RSA Laboratories\u2019 Bulletin, Number 2, January 1996."},{"key":"6_CR5","volume-title":"volume 2, 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":"6_CR6","unstructured":"A. K. Lenstra, LIP, Long integer package, available by anonymous ftp from ftp.ox.ac.uk:\/pub\/math\/freelip\/freelip_1.0.tar.gz."},{"key":"6_CR7","unstructured":"J. Markoff, Secure digital transactions just got a little less secure, New York Times, December 11, 1995."},{"key":"6_CR8","unstructured":"G. Marsaglia, Diehard randomness tests package, available by e-mail from the author (geo@stat.fsu.edu)."},{"key":"6_CR9","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 (1985) 519\u2013521.","journal-title":"Math. Comp."},{"key":"6_CR10","unstructured":"D. Naccache, D. M'Ra\u00efhi, D. Raphaeli, S. Vaudenay, Can D.S.A. be improved \u2014 complexity trade-offs with the digital signature standard, Preproceedings Eurocrypt'94 (1994) 85\u2013101."},{"key":"6_CR11","first-page":"42980","volume":"56","author":"NIST","year":"1991","unstructured":"NIST, A proposed federal information processing standard for digital signature standard (DSS), Federal Register 56 (1991) 42980\u201342982.","journal-title":"Federal Register"},{"key":"6_CR12","unstructured":"S. Rajagopalan, R. Venkatesan, work in progress."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume":"435","author":"C. P. Schnorr","year":"1990","unstructured":"C. P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology, Crypto'89, Lecture Notes in Comput. Sci. 435 (1990) 239\u2013251.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"6_CR14","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 (1991) 161\u2013174.","journal-title":"Journal of Cryptology"},{"key":"6_CR15","unstructured":"U. Vazirani, Randomness, adversaries and computations, Ph.D. thesis, UC Berkeley, 1986."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"S.-M. Yen, C. Laih, A. K. Lenstra, A note on multi-exponentiation, IEE Proceedings, Computers and digital techniques 141 (1994).","DOI":"10.1049\/ip-cdt:19941271"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0034835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:51:42Z","timestamp":1586613102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0034835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618720","9783540707073"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0034835","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}