{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:34:29Z","timestamp":1729611269997,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1109\/vlsisoc.2007.4402507","type":"proceedings-article","created":{"date-parts":[[2007,12,18]],"date-time":"2007-12-18T15:01:08Z","timestamp":1197990068000},"page":"252-257","source":"Crossref","is-referenced-by-count":6,"title":["A bit-sliced, scalable and unified montgomery multiplier architecture for RSA and ECC"],"prefix":"10.1109","author":[{"given":"M.","family":"Sudhakar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.V.","family":"Kamala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.B.","family":"Srinivas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-48059-5_10","article-title":"A Scalable Architecture for Montgomery Multiplication","author":"tenca","year":"1999","journal-title":"First International Workshop on Cryptographic Hardware and Embedded Systems"},{"key":"ref11","first-page":"281","article-title":"A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m)","author":"savas","year":"2000","journal-title":"Proceedings of CHES"},{"key":"ref12","first-page":"202","article-title":"A bit-serial unified multiplier architecture for finite fields GF(p) and GF(2m)","author":"gro\u00dfsch\u00e4dl","year":"2001","journal-title":"Proc CHES 2001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20040047"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1228516"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.9"},{"journal-title":"Certicom Corporation The Basics of ECC","year":"2006","key":"ref16"},{"journal-title":"NIST DSS Standard Basicrypt - Elliptic Curve Cryptography(ECC) Benchmark Suite benchmark","year":"0","key":"ref17"},{"article-title":"Implementation of 1024-bit modular processor for RSA cryptosystem","year":"0","author":"kim","key":"ref18"},{"key":"ref19","article-title":"A Complexity-Effective Version of Montgomery's Algorithm","author":"bunimov","year":"2002","journal-title":"Workshop Complexity-Effective Design"},{"key":"ref4","first-page":"446","article-title":"Selecting cryptographic key sizes","volume":"1751","author":"lenstra","year":"2000","journal-title":"Lecture Notes in Computer Science of Public Key Cryptography 2000"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining Digital Signatures and Public-key cryptosystems","volume":"21","author":"shamir","year":"1978","journal-title":"Comm ACM"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"journal-title":"US National Institute of Standards and Technology (NIST) Cryptographic Toolkit","first-page":"83","year":"2002","key":"ref5"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/82.700944","article-title":"A New RSA Cryptosystem Hardware Design Based on Montgomery's Algorithm","volume":"45","author":"yang","year":"1998","journal-title":"IEEE Trans on Circuits and Systems - II Analog and Digital Signal Processing"},{"key":"ref7","article-title":"Design of a Modular Multiplier Based on Montgomery's Algorithm","author":"bernal","year":"1998","journal-title":"Proc 13th International Conf Design of Circuits and Integrated Systems (DCIS '98)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1109\/92.766756","article-title":"An Improved Montgomery's Algorithm for High-Speed RSA Public-Key Cryptosystem","volume":"7","author":"su","year":"1999","journal-title":"IEEE Trans Very Large Scale Integration (VLSI) Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39799-X_31"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20040791"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1999.762831"},{"key":"ref21","first-page":"750","article-title":"An Efficient, Reconfigurable and Unified Montgomery Multiplier Architecture","author":"sudhakar","year":"2007","journal-title":"Proc IEEE Int Conf VLSI Design"},{"journal-title":"Xilinx Libraries Guide","year":"0","key":"ref24"},{"journal-title":"Virtex-II Pro and Virtex-II Pro X Platform FPGAs Complete Data Sheet","year":"0","key":"ref23"}],"event":{"name":"2007 IFIP International Conference on Very Large Scale Integration","start":{"date-parts":[[2007,10,15]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2007,10,17]]}},"container-title":["2007 IFIP International Conference on Very Large Scale Integration"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4402461\/4402462\/04402507.pdf?arnumber=4402507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T22:17:47Z","timestamp":1557094667000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4402507\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/vlsisoc.2007.4402507","relation":{},"subject":[],"published":{"date-parts":[[2007,10]]}}}