{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:58Z","timestamp":1725488458621},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594093"},{"type":"electronic","value":"9783540492641"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-49264-x_33","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T06:52:09Z","timestamp":1186469529000},"page":"404-409","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Are Crypto-Accelerators Really Inevitable?"],"prefix":"10.1007","author":[{"given":"David","family":"Naccache","sequence":"first","affiliation":[]},{"given":"David","family":"M\u2019ra\u00efhi","sequence":"additional","affiliation":[]},{"given":"William","family":"Wolfowicz","sequence":"additional","affiliation":[]},{"given":"Adina","family":"di Porto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"issue":"1\u20132","key":"33_CR1","first-page":"15","volume":"33","author":"O. Brugia","year":"1984","unstructured":"O. Brugia, A. di Porto & P. Filiponi, Un metodo per migliorare l\u2019efficienza degli algoritmi di generazione delle chiavi crittografiche basati sull\u2019impiego di grandi numeri primi, Note Recesioni e Notizie, Ministero Poste e Telecommunicazioni, vol. 33, no. 1\u20132, 1984, pp. 15\u201322.","journal-title":"Note Recesioni e Notizie, Ministero Poste e Telecommunicazioni"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat & A. Shamir, Zero-knowledge proofs of identity, Proc. 19th. ACM Symp. Theory of Computing, 210\u2013217, (1987) and J. Cryptology, 1 (1988), 77\u201395.","DOI":"10.1007\/BF02351717"},{"key":"33_CR3","series-title":"Lect Notes Comput Sci","first-page":"181","volume-title":"Proc. of Crypto'86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat & A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Proc. of Crypto'86, Lecture notes in computer science 263, 181\u2013187."},{"key":"33_CR4","unstructured":"M. Fischer, S. Micali & C. Rackoff, A secure protocol for oblivious transfer, presented at Eurocrypt'84 but missing in the proceedings."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"P. Montgomery, Modular multiplication without trial division, Mathematics of computation, vol. 44, 1985, pp. 519\u2013521.","journal-title":"Mathematics of computation"},{"key":"33_CR6","unstructured":"D. Naccache, Method, sender apparatus and receiver apparatus for modulo operation, European patent application no. 91402958.2, November 5, 1991."},{"key":"33_CR7","unstructured":"D. Naccache, D. M\u2019ra\u00efhi, S. Vaudenay & D. Raphaeli, Can DSA be Improved ?, Proceedings of Eurocrypt'94, to appear."},{"key":"33_CR8","unstructured":"A. Shamir, How to implement public-key schemes with 16,000 bit moduli on a smart-card with 36 bytes of RAM, presented at the rump session of Eurocrypt'94 (05-10-1994 at 20h11)."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201995"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49264-X_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:04:02Z","timestamp":1558274642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49264-X_33"}},"subtitle":["20 bit zero-knowledge in less than a second on simple 8-bit microcontrollers"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594093","9783540492641"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-49264-x_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"13 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}