{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:48:21Z","timestamp":1743061701596,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666462"},{"type":"electronic","value":"9783540480594"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","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":[[1999]]},"DOI":"10.1007\/3-540-48059-5_21","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T18:18:49Z","timestamp":1195237129000},"page":"246-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor"],"prefix":"10.1007","author":[{"given":"Emeka","family":"Mosanya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"Teuscher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9ctor Fabio","family":"Restrepo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Galley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Sanchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"key":"21_CR1","first-page":"510","volume-title":"IEEE Computer Society Press","author":"H. Bonnenberg","year":"1991","unstructured":"H Bonnenberg, A. Curiger, N. Felber, H. Kaeslin, and X. Lai. VLSI implementation of a new block cipher. In Proceeding of the International Conference on Computer Design: VLSI in Computer and Processors, pages 510\u2013513, Washington, 1991. IEEE, IEEE Computer Society Press."},{"unstructured":"E. Caspi and N. Weaver. IDEA as a benchmark for recon gurable computing. Technical report, BRASS Research Group, University of Berkeley, December 1996. Report available form \nhttp:\/\/www.cs.berkeley.edu\/projects\/brass\/projects.html\n\n.","key":"21_CR2"},{"issue":"7","key":"21_CR3","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1109\/4.92018","volume":"26","author":"A. Curiger","year":"1991","unstructured":"A. Curiger, H. Bonnenberg, and H. Kaeslin. Regular VLSI-architectures for multiplication modulo (2n + 1). IEEE Journal of Solid-State Circuits, 26(7):990\u2013994, Jul y 1991.","journal-title":"IEEE Journal of Solid-State Circuits"},{"key":"21_CR4","first-page":"15.5.1","volume-title":"Proceedings of the IEEE CICC\u201993","author":"A. Curiger","year":"1993","unstructured":"A. Curiger, H. Bonnenberg, R. Zimmermann, N. Felber, H. Kaeslin, and W. Fichtner. VINCI: VLSI implementation of the new block cipher IDEA. In Proceedings of the IEEE CICC\u201993, pages 15.5.1\u201315.5.4, San Diego, CA, May 1993. IEEE."},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1049\/el:19920194","volume":"41","author":"A. Hiasat","year":"1992","unstructured":"A. Hiasat. New memoryless modulo (2n + 1) residu multiplierElectronic Letters, 41(3):314\u2013315, January 1992.","journal-title":"Electronic Letters"},{"unstructured":"ISO. Information technology-security techniques-modes of operation for an n-bit block cipher. International standard ISO\/IEC 10116:1997(E), ISO\/IEC, 15 April 1997.","key":"21_CR6"},{"unstructured":"X. Lai. On the Design and Security of Block Ciphers. Number 1 in ETH Series in Information Processing. Hartung-Gorre Verlag Konstanz, 1992.","key":"21_CR7"},{"key":"21_CR8","first-page":"389","volume-title":"Advances in Cryptology-EUROCRYPT\u201990","author":"X. Lai","year":"1990","unstructured":"X. Lai and J. Massey. A proposal for a new block encryption standard. In Advances in Cryptology-EUROCRYPT\u201990, pages 389\u2013404, Berlin, 1990. Springer-Verlag."},{"key":"21_CR9","first-page":"8","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 91","author":"X. Lai","year":"1991","unstructured":"X. Lai, J. Massey, and S. Murphy. Markov ciphers and differential cryptanalysis. In Advances in Cryptology-EUROCRYPT\u2019 91, pages 8\u201313, Berlin, 1991. Springer-Verlag."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/12.660169","volume":"47","author":"Y. Ma","year":"1998","unstructured":"Y. Ma. A simplified architecture for modulo (2n + 1) multiplication. IEEE Transactions on Computers, 47(3):333\u2013337, March 1998.","journal-title":"IEEE Transactions on Computers"},{"unstructured":"J. L. Massey and X. Lai. Device for convertig a digital block and the use thereof, 28 Nov 1991. International Patent PCT\/CH91\/00117.","key":"21_CR11"},{"unstructured":"J. L. Massey and X. Lai. Device for the conversion of a digital block and use of same, 25 May 1993. U.S. Patent #5,214,703.","key":"21_CR12"},{"unstructured":"O. Mencer, M. Morf, and M. J. Flynn. Hardware software tri-design of encryption for mobile communication units. In Proceedings of International Conference on Acoustics, Speech,and Signal Processing, Seattle, Washington, USA, May 1998.","key":"21_CR13"},{"doi-asserted-by":"crossref","unstructured":"S. Trimberger. Field-Programmable Gate Array Technology. Kluwer Academic Publishers, 1994.","key":"21_CR14","DOI":"10.1007\/978-1-4615-2742-8"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF00929618","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Z. Wang, G. A. Jullien, and W. C. Miller. An efficient tree architecture for modulo (2n+1) multiplication. Journal of VLSI Signal Processing Systems, 14(3):241\u2013248, December 1996.","journal-title":"Journal of VLSI Signal Processing Systems"},{"key":"21_CR16","volume-title":"Proceedings IEEE Symposium on Computer Arithmetic","author":"R. Zimmermann","year":"1999","unstructured":"R. Zimmermann. Efficient VLSI implementation of modulo (2n + 1) addition and multiplication. In Proceedings IEEE Symposium on Computer Arithmetic, Adeleide, Australia, April 1999. IEEE."},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/4.278352","volume":"29","author":"R. Zimmermann","year":"1994","unstructured":"R. Zimmermann, A. Curiger, H. Bonnenberg, H. Kaeslin, N. Felber, and W. Fichtner. A 177 Mbit\/s VLSI implementation of the international data encryption algorithm. IEEE Journal of Solid-State Circuits, 29(3):303\u2013307, March 1994.","journal-title":"IEEE Journal of Solid-State Circuits"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48059-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T09:49:14Z","timestamp":1589881754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48059-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666462","9783540480594"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48059-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"8 February 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}