{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T18:29:08Z","timestamp":1759775348030,"version":"3.44.0"},"reference-count":223,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-9260(02)00053-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"1-64","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":58,"title":["Hardware architectures for public key cryptography"],"prefix":"10.1016","volume":"34","author":[{"given":"Lejla","family":"Batina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u0131dd\u0131ka","family":"Berna \u00d6rs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Preneel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joos","family":"Vandewalle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-9260(02)00053-6_BIB1","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0167-9260(02)00053-6_BIB2","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":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystem","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comp."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB4","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201985","first-page":"417","article-title":"Uses of elliptic curves in cryptography","volume":"Vol. 218","author":"Miller","year":"1985"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB5","doi-asserted-by":"crossref","unstructured":"P. Schaumont, I. Verbauwhede, A reconfiguration hierarchy for Elliptic Curve Cryptography, in: Proceedings of the 35th Asilomar Conference on Signals, Systems, and Computers, 2001.","DOI":"10.1109\/ACSSC.2001.986966"},{"issue":"3","key":"10.1016\/S0167-9260(02)00053-6_BIB6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MM.1996.502401","article-title":"Public key security systems","volume":"16","author":"Abdelguerfi","year":"1996","journal-title":"IEEE Micro."},{"issue":"4","key":"10.1016\/S0167-9260(02)00053-6_BIB7","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/49.17708","article-title":"Algorithm engineering for public key algorithm","volume":"7","author":"Beth","year":"1989","journal-title":"IEEE J. Selected Areas in Commun."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB8","unstructured":"Certicom Corp., Current public-key cryptographic systems, Whitepaper, http:\/\/www.certicom.com (2000)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB9","unstructured":"C. Paar, Reconfigurable hardware in modern cryptography, Presentation on the 4th Workshop on Elliptic Curve Cryptography (ECC 2000), http:\/\/www.cacr.math.uwaterloo.ca\/conferences\/2000\/ecc00\/slides.html (October 2\u20134 2000)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB10","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 1999)","first-page":"94","article-title":"A scalable architecture for Montgomery multiplication","volume":"Vol. 1717","author":"Tenca","year":"1999"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB11","unstructured":"A. Gutub, A scalable hardware for montgomery modular inverse computation, Tech. Report, Information Security Laboratory, Electrical and Computer Engineering Department, Oregon State University, Corvallis, Oregon 97331 (June 2001)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB12","doi-asserted-by":"crossref","unstructured":"A. Gutub, A.F. Tenca, \u00c7.K. Ko\u00e7, Scalable VLSI architecture for GF(p) Montgomery modular inverse computation, in: Proceedings of IEEE Computer Society Annual Symposium on VLSI, 2002, pp. 53\u201358.","DOI":"10.1109\/ISVLSI.2002.1016874"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB13","series-title":"Proceedings of RSA 2002 Cryptographers\u2019 Track","first-page":"40","article-title":"Montgomery in practice: How to do it more efficiently in hardware","volume":"Vol. 2271","author":"Batina","year":"2002"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB14","series-title":"Proceedings of Third International Workshop on Practice and Theory in Public Key Cryptography (PKC 2000)","first-page":"446","article-title":"Selecting cryptographic key sizes","volume":"Vol. 1751","author":"Lenstra","year":"2000"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB15","unstructured":"R. Anderson, M. Kuhn, Tamper resistance\u2014a cautionary note, in: Proceedings of the 2nd USENIX Workshop on Electronic Commerce, 1996, pp. 1\u201311."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB16","series-title":"Proceedings of 1997 Security Protocols Workshop","first-page":"125","article-title":"Low cost attacks on tamper resistant devices","volume":"Vol. 1361","author":"Anderson","year":"1997"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB17","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2001)","first-page":"255","article-title":"Electromagnetic analysis: concrete results","volume":"Vol. 2162","author":"Gandolfi","year":"2001"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB18","unstructured":"G. Hachez, F. Koeune, J.-J. Quisquater, Timing attack: what can be achieved by a powerful adversary?, in: A. Barb\u00e9, E.C. van der Meulen, P. Vanroose (Eds.), Proceedings of the 20th Symposium on Information Theory in the Benelux, 1999, pp. 63\u201370."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB19","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201996","first-page":"104","article-title":"Timing attacks on implementations of Diffie\u2013Hellman, RSA, DSS and other systems","volume":"Vol. 1109","author":"Kocher","year":"1996"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB20","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201999","first-page":"388","article-title":"Differential power analysis","volume":"Vol. 1666","author":"Kocher","year":"1999"},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB21","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TC.2002.1004593","article-title":"Examining smart-card security under the threat of power analysis attacks","volume":"51","author":"Messerges","year":"2002","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB22","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201997","first-page":"37","article-title":"On the importance of checking cryptographic protocols for faults (extended abstract)","volume":"Vol. 1233","author":"Boneh","year":"1997"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB23","doi-asserted-by":"crossref","unstructured":"N. Koblitz, A Course in Number Theory and Cryptography, 2nd Edition, Graduate Text in Mathematics, Vol. 114, Springer, Berlin, Germany, 1994.","DOI":"10.1007\/978-1-4419-8592-7"},{"issue":"2","key":"10.1016\/S0167-9260(02)00053-6_BIB24","first-page":"203","article-title":"Twenty years of attacks on the RSA cryptosystem","volume":"46","author":"Boneh","year":"1999","journal-title":"Notices Am. Math. Soc."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB25","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1997."},{"year":"1997","series-title":"Handbook of Applied Cryptography","author":"Menezes","key":"10.1016\/S0167-9260(02)00053-6_BIB26"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB27","doi-asserted-by":"crossref","unstructured":"I. Blake, G. Seroussi, N.P. Smart, Elliptic Curves in Cryptography, London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, 1999.","DOI":"10.1017\/CBO9781107360211"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB28","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1006\/jagm.1997.0913","article-title":"A survey of fast exponentiation methods","volume":"27","author":"Gordon","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB29","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201901","first-page":"190","article-title":"Faster point multiplication on elliptic curves with efficient endomorphisms","volume":"Vol. 2139","author":"Gallant","year":"2001"},{"issue":"30","key":"10.1016\/S0167-9260(02)00053-6_BIB30","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(95)00153-P","article-title":"Analysis of sliding window techniques for exponentiation","volume":"10","author":"Ko\u00e7","year":"1995","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB31","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201994","first-page":"95","article-title":"More flexible exponentiations with precomputation","volume":"Vol. 839","author":"Lim","year":"1994"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB32","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1018013116103","article-title":"Redundant integer representation and fast exponentiation","volume":"7","author":"Gollmann","year":"1998","journal-title":"Designs, Codes Cryptogr."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB33","series-title":"Proceedings of RSA 2002 Cryptographers\u2019 Track","first-page":"53","article-title":"MIST: an efficient, randomized exponentiation algorithm for resisting power analysis","volume":"Vol. 2271","author":"Walter","year":"2002"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB34","doi-asserted-by":"crossref","unstructured":"C.D. Walter, Some security aspects of the MIST randomized exponentiation algorithm, in: B.S. Kaliski Jr., \u00c7.K. Ko\u00e7, C. Paar (Eds.), Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2002), Lecture Notes in Computer Science, Springer, Berlin, 2002.","DOI":"10.1007\/3-540-36400-5_21"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB35","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","article-title":"Modular multiplication without trial division","volume":"44","author":"Montgomery","year":"1985","journal-title":"Math. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB36","series-title":"Proceedings of Topics in Cryptology- CT-RSA 2002","first-page":"30","article-title":"Precise bounds for Montgomery modular multiplication and some potentially insecure RSA moduli","volume":"Vol. 2271","author":"Walter","year":"2002"},{"issue":"21","key":"10.1016\/S0167-9260(02)00053-6_BIB37","doi-asserted-by":"crossref","first-page":"1831","DOI":"10.1049\/el:19991230","article-title":"Montgomery exponentiation needs no final subtraction","volume":"35","author":"Walter","year":"1999","journal-title":"Electron. Lett."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB38","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2000)","first-page":"293","article-title":"Montgomery exponentiation with no final subtractions: Improved results","volume":"Vol. 1965","author":"Hachez","year":"2000"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB39","doi-asserted-by":"crossref","unstructured":"\u00c7.K. Ko\u00e7, T. Acar, B.S. Kaliski Jr., Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro. (1996) 26\u201333.","DOI":"10.1109\/40.502403"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB40","doi-asserted-by":"crossref","unstructured":"S.E. Eldridge, C.D. Walter, Hardware implementation of Montgomery's modular multiplication algorithm. IEEE Trans. Comput. 42 (93) 693\u2013699.","DOI":"10.1109\/12.277287"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB41","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 1999)","first-page":"80","article-title":"Montgomery's multiplication technique: How to make it smaller and faster","volume":"Vol. 1717","author":"Walter","year":"1999"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB42","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201982","first-page":"327","article-title":"A short report on the RSA chip","volume":"Vol. 740","author":"Rivest","year":"1982"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB43","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/PGEC.1965.264145","article-title":"A one-dimensional real-time iterative multiplier","volume":"14","author":"Atrubin","year":"1965","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"11","key":"10.1016\/S0167-9260(02)00053-6_BIB44","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/2.241423","article-title":"General-purpose systolic arrays","volume":"26","author":"Johnson","year":"1993","journal-title":"IEEE Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB45","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201992","first-page":"183","article-title":"Massively parallel elliptic curve factoring","volume":"Vol. 658","author":"Dixon","year":"1992"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB46","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","article-title":"Factoring integers with elliptic curves","volume":"126","author":"Lenstra","year":"1987","journal-title":"Ann. Math."},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB47","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1049\/ip-cdt:20000638","article-title":"An improved linear systolic array for fast modular exponentiation","volume":"147","author":"Walter","year":"2000","journal-title":"IEEE Comput. Digital Tech."},{"issue":"3","key":"10.1016\/S0167-9260(02)00053-6_BIB48","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1002\/ecjc.4430770304","article-title":"Montgomery modular multiplication method and systolic arrays suitable for modular exponentiation","volume":"77","author":"Iwamura","year":"1994","journal-title":"Electron. Commun. Japan"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB49","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/12.210181","article-title":"Systolic modular multiplication","volume":"42","author":"Walter","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB50","series-title":"Proceedings of Topics in Cryptology-CT-RSA 2001","first-page":"235","article-title":"Scalable algorithm for Montgomery multiplication and its implementation on the coarse-grain reconfigurable chip","volume":"Vol. 2020","author":"Trichina","year":"2001"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB51","unstructured":"T. Blum, Modular exponentiation on reconfigurable hardware, Master's Thesis, Worcester Polytechnic Institute, April 1999."},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB52","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/12.295851","article-title":"A systolic, linear-array multiplier for a class of right-shift algorithms","volume":"43","author":"Kornerup","year":"1994","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0167-9260(02)00053-6_BIB53","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. VLSI systems"},{"issue":"1","key":"10.1016\/S0167-9260(02)00053-6_BIB54","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/92.820767","article-title":"Two systolic architectures for modular multiplication","volume":"8","author":"Tsai","year":"2000","journal-title":"IEEE Trans. VLSI systems"},{"issue":"2","key":"10.1016\/S0167-9260(02)00053-6_BIB55","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/92.585224","article-title":"VLSI array algorithms and architectures for RSA modular multiplication","volume":"5","author":"Jeong","year":"1997","journal-title":"IEEE Trans. VLSI systems"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB56","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201990","first-page":"619","article-title":"Systolic modular multiplication","volume":"Vol. 537","author":"Even","year":"1990"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB57","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201992","first-page":"477","article-title":"Systolic-arrays for modular exponentiation using Montgomery method","volume":"Vol. 658","author":"Iwamura","year":"1992"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB58","doi-asserted-by":"crossref","unstructured":"E.F. Brickell, A fast modular multiplication algorithm with application to two key cryptography, in: D. Chaum, R.L. Rivest, A.T. Sherman (Eds.), Advances in Cryptology: Proceedings of CRYPTO\u201982, Vol. 740, Plenum Press, New York and London, Springer, Berlin, 1982, pp. 51\u201360.","DOI":"10.1007\/978-1-4757-0602-4_5"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB59","doi-asserted-by":"crossref","unstructured":"H. Orup, Simplifying quotient determination in high-radix modular multiplication, in: Proceedings of the 12th Symposium on Computer Arithmetic, IEEE, 1995, pp. 193\u2013199.","DOI":"10.1109\/ARITH.1995.465359"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB60","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201992","first-page":"221","article-title":"High-speed implementation methods for RSA scheme","volume":"Vol. 658","author":"Iwamura","year":"1992"},{"issue":"9","key":"10.1016\/S0167-9260(02)00053-6_BIB61","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1049\/el:19980624","article-title":"Systolic modular exponentiation via Montgomery algorithm","volume":"34","author":"Tiountchik","year":"1998","journal-title":"Electron. Lett."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB62","doi-asserted-by":"crossref","unstructured":"A.A. Tiountchik, E. Trichina, RSA acceleration with field programmable gate arrays, in: Proceedings of ACISP 1999, 1999, pp. 164\u2013176.","DOI":"10.1007\/3-540-48970-3_14"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB63","doi-asserted-by":"crossref","unstructured":"J. Poldre, K. Tammemae, M. Mandre, Modular exponent realization on FPGAs, in: Proceedings of 8th International Workshop on Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm (FPL\u201998), Tallinn, Estonia, 1998, pp. 336\u2013347.","DOI":"10.1007\/BFb0055261"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB64","doi-asserted-by":"crossref","unstructured":"T. Blum, C. Paar, Montgomery modular exponentiation on reconfigurable hardware, in: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, 1999, pp. 70\u201377.","DOI":"10.1109\/ARITH.1999.762831"},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB65","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1109\/12.936241","article-title":"High-radix Montgomery modular exponentiation on reconfigurable hardware","volume":"50","author":"Blum","year":"2001","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB66","doi-asserted-by":"crossref","unstructured":"A.J. Elbirt, C. Paar, Towards an FPGA architecture optimized for public-key algorithms, in: J. Schewel et al. (Eds.), Proceedings of the SPIE's Symposium on Voice, and Communications, Boston, MA, USA, 1999, pp. 33\u201342.","DOI":"10.1117\/12.359540"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB67","doi-asserted-by":"crossref","unstructured":"W.L. Freking, K.K. Parhi, Performance-scalable array architectures for modular multiplication, in: Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors, IEEE, 2000, pp. 149\u2013160.","DOI":"10.1109\/ASAP.2000.862386"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB68","doi-asserted-by":"crossref","unstructured":"W.L. Freking, K.K. Parhi, A unified method for iterative computation of modular multiplication and reduction operations, in: Proceedings of the IEEE International Conference on Computer Design, IEEE, 1999, pp. 80\u201387.","DOI":"10.1109\/ICCD.1999.808395"},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB69","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1049\/el:19980286","article-title":"Optimised bit serial modular multiplier for implementation on field programmable gate arrays","volume":"34","author":"Marnane","year":"1998","journal-title":"Electron. Lett."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB70","unstructured":"Y.S. Kim, W.S. Kang, J.R. Choi, Implementation of 1024-bit modular processor for RSA cryptosystem, in: Proceedings of Asia-Pasific Conference on ASIC (AP-ASIC), Cheju Island, Korea, 2000."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB71","first-page":"153","article-title":"Algorithms for high-speed modular arithmetic","volume":"31","author":"Norris","year":"1981","journal-title":"Congr. Numer."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB72","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1080\/00207169008803847","article-title":"A verification of Brickell's fast modular multiplication algorithm","volume":"33","author":"Walter","year":"1990","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB73","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201986","first-page":"277","article-title":"VLSI implementation of public-key encryption algorithms","volume":"Vol. 263","author":"Orton","year":"1986"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB74","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201987","first-page":"95","article-title":"The RSA cryptography processor","volume":"Vol. 304","author":"Sedlak","year":"1987"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB75","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201988","first-page":"257","article-title":"Fast RSA-hardware: dream or reality","volume":"Vol. 330","author":"Hoornaert","year":"1988"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB76","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201989","first-page":"219","article-title":"A single chip 1024 bits RSA processor","volume":"Vol. 434","author":"Vandemeulebroecke","year":"1989"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB77","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201989","first-page":"371","article-title":"Modular exponentiation using recursive sums of residues","volume":"Vol. 435","author":"Findlay","year":"1989"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB78","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201989","first-page":"387","article-title":"A fast modular-multiplication algorithm based on a higher radix","volume":"Vol. 435","author":"Morita","year":"1989"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB79","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201990","first-page":"246","article-title":"VICTOR: an efficient RSA hardware implementation","volume":"Vol. 473","author":"Orup","year":"1990"},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB80","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1109\/12.156537","article-title":"A radix-4 modular multiplication hardware algorithm for modular exponentiation","volume":"41","author":"Takagi","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB81","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1109\/12.256444","article-title":"Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem","volume":"41","author":"Takagi","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB82","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201991","first-page":"313","article-title":"Fast modular multiplication by operand scaling","volume":"Vol. 576","author":"Walter","year":"1991"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB83","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/00207169108803976","article-title":"Fast modular multiplication using 2-power radix","volume":"3","author":"Walter","year":"1991","journal-title":"Int. J. Comput. Math."},{"issue":"17","key":"10.1016\/S0167-9260(02)00053-6_BIB84","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1049\/el:19940969","article-title":"Logarithmic speed modular multiplication","volume":"30","author":"Walter","year":"1994","journal-title":"IEE Electron. Lett."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB85","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","article-title":"A suggestion for a fast multiplier","volume":"EC-13","author":"Wallace","year":"1964","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB86","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/12.709375","article-title":"Exponentiation using division chains","volume":"47","author":"Walter","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB87","doi-asserted-by":"crossref","unstructured":"J.-S. Chiang, J.-K. Chen, An efficient VLSI architecture for RSA public-key cryptosystem, in: Proceedings of the IEEE International Circuits and Systems (ISCAS\u201999), Vol. 1, IEEE, Silver Spring, MD, 1999, pp. 496\u2013499.","DOI":"10.1109\/ISCAS.1999.777936"},{"issue":"13","key":"10.1016\/S0167-9260(02)00053-6_BIB88","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1049\/el:19900587","article-title":"Carry save adders for computing the product AB modulo N","volume":"26","author":"Ko\u00e7","year":"1990","journal-title":"Electron. Lett."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB89","unstructured":"K.-S. Cho, J.-H. Ryu, J.-D. Cho, High-speed modular multiplication algorithm for RSA cryptosystem, in: Proceedings of IECON, 2001, pp. 479\u2013483."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB90","doi-asserted-by":"crossref","unstructured":"A.D. Booth, A signed binary multiplication technique, Quart. J. Mech. Appl. 4 (2).","DOI":"10.1093\/qjmam\/4.2.236"},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB91","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/71.382314","article-title":"Modulo reduction in residue number systems","volume":"6","author":"Posch","year":"1998","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB92","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/12.83626","article-title":"A VLSI modulo m multiplier","volume":"40","author":"Alia","year":"1991","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0167-9260(02)00053-6_BIB93","first-page":"167","article-title":"An RNS montgomery's modular multiplication","volume":"19","author":"Bajard","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB94","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201900","first-page":"523","article-title":"Cox-Rower architecture for fast parallel montgomery multiplication","volume":"Vol. 1807","author":"Kawamura","year":"2000"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB95","series-title":"Proceedings of Workshop on Cryptograpic Hardware and Embedded Systems (CHES 2001)","first-page":"372","article-title":"Implementation of RSA algorithm based on RNS montgomery multiplication","volume":"Vol. 2162","author":"Nozaki","year":"2001"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB96","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1049\/el:19820617","article-title":"Fast decipherment algorithm for RSA public-key cryptosystem","volume":"18","author":"Quisquater","year":"1982","journal-title":"Electron. Lett."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB97","unstructured":"ECMNET, The ECMNET project, http:\/\/www.loria.fr\/zimmerma\/records\/ecmnet.html (May 2002)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB98","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201998","first-page":"318","article-title":"Fast RSA-type cryptosystem modulo pkq","volume":"Vol. 1462","author":"Takagi","year":"1998"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB99","doi-asserted-by":"crossref","unstructured":"J. Grossch\u00e4dl, The Chinese remainder theorem and its application in a high-speed RSA crypto chip, in: Proceedings of the 16th Annual Computer Security Application Conference, IEEE Computer Society Press, New Orleans, Louisiana, USA, 2000, pp. 384\u2013393.","DOI":"10.1109\/ACSAC.2000.898893"},{"issue":"12","key":"10.1016\/S0167-9260(02)00053-6_BIB100","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s001459900055","article-title":"Chinese remaindering based cryptosystem in the presence of faults","volume":"4","author":"Joye","year":"1999","journal-title":"J. Cryptol."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB101","doi-asserted-by":"crossref","unstructured":"C. Aum\u00fcller, P. Bier, W. Fischer, P. Hofreiter, J.-P. Seifert, Fault attacks on RSA with CRT: concrete results and practical countermeasures, in: B.S. Kaliski Jr., \u00c7.K. Ko\u00e7, C. Paar (Eds.), Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2002), Lecture Notes in Computer Science, Springer, Berlin, 2002.","DOI":"10.1007\/3-540-36400-5_20"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB102","series-title":"Advances in Cryptology: Proceedings of EURO-CRYPT\u201984","first-page":"159","article-title":"RSA chips: Past\/present\/future","volume":"Vol. 209","author":"Rivest","year":"1984"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB103","unstructured":"Y.A. Lau, T.R. McPherson, Implementation of a hybrid RSA\/DES management system, in: A. Gersho (Ed.), Advances in Cryptology: Proceedings of CRYPTO\u201981, IEEE, 1981, p. 83."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB104","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201985","first-page":"350","article-title":"Developing an RSA chip","volume":"Vol. 218","author":"Kochanski","year":"1985"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB105","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201986","first-page":"481","article-title":"Thomas\u2014a complete single chip RSA device","volume":"Vol. 263","author":"Rankine","year":"1986"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB106","unstructured":"M. Shand, J. Vuillemin, Fast implementations of RSA cryptography, in: Proceedings of the 11th IEEE Symposium on Computer Arithmetic, Windsor, Ont., Canada, 1993."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB107","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2001)","first-page":"189","article-title":"High-radix design of a scalable modular multiplier","volume":"Vol. 2162","author":"Tenca","year":"2001"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB108","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2000)","first-page":"281","article-title":"A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m)","volume":"Vol. 1965","author":"Sava\u015f","year":"2000"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB109","unstructured":"Atmel Corp., NIMBUS security chip, Presented at the 7th CACR Information Security Workshop on Smart Cards: Technology, Applications and Security, http:\/\/www.cacr.math.uwaterloo.ca\/conferences.html (April 25 2001)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB110","unstructured":"Spyrus Inc., USB token, the reader-less smart card, Presented at the 7th CACR Information Security Workshop on Smart Cards: Technology, Applications and Security, http:\/\/www.cacr.math.uwaterloo.ca\/conferences.html (April 25 2001)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB111","unstructured":"Infineon Technologies AG, SLE 66CUX640P: USB Security IC, St. Martin Strasse 53, D-81541 Munchen, Germany, http:\/\/www.infineon.com (August 2001)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB112","unstructured":"E. Hess, Aspects of public key cryptosystems in practice, Presentation on the 4th Workshop on Elliptic Curve Cryptography (ECC 2000), http:\/\/www.cacr.math.uwaterloo.ca\/conferences\/2000\/ecc00\/slides.html (October 2\u20134 2000)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB113","unstructured":"Motorola Inc., MPC18x, MPC190: Security processors, http:\/\/e-www.motorola.com\/index.html."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB114","unstructured":"Koninklijke Philips Electronics N.V., The 2nd generation SmartXA, http:\/\/www.semiconductors.philips.com\/markets\/identification\/products."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB115","unstructured":"Certicom Corp., CHRYSALIS-ITS, http:\/\/www.certicom.com\/products\/chrysalis\/chrysalis_feat.html."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB116","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201989","first-page":"368","article-title":"A survey of hardware implementations of RSA","volume":"Vol. 435","author":"Brickell","year":"1989"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB117","unstructured":"\u00c7.K. Ko\u00e7, RSA hardware implementation, Tech. Report, RSA Laboratories, RSA Data Security, Inc., Redwood City, CA (August 1995)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB118","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201984","first-page":"10","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"Vol. 196","author":"ElGamal","year":"1985"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB119","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB120","first-page":"23","article-title":"The discrete logarithm problem in GL(n,q)","volume":"47","author":"Menezes","year":"1998","journal-title":"Ars Combin."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB121","unstructured":"E.D. Mastrovito, VLSI architectures for computations in Galois fields, Ph.D. thesis, Department of Electrical Engineering, Link\u00f8ping University, S-581 83 Link\u00f8ping, Sweden, 1991."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB122","unstructured":"J.K. Omura, J.L. Massey, Computation method and apparatus for finite field arithmetic, United States Patent, Patent Number: 4.587.627, May 6, 1986."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB123","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","article-title":"Optimal normal bases in GF(pn)","volume":"22","author":"Mullin","year":"1989","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB124","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/12.589237","article-title":"Modular arithmetic using low order redundant bases","volume":"46","author":"Parker","year":"1997","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0167-9260(02)00053-6_BIB125","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/12.46283","article-title":"Generalized signed-digit number systems","volume":"39","author":"Parhami","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB126","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 1999)","first-page":"280","article-title":"Highly regular architectures for finite field computation using redundant basis","volume":"Vol. 1717","author":"Wu","year":"1999"},{"issue":"9","key":"10.1016\/S0167-9260(02)00053-6_BIB127","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1109\/12.713313","article-title":"A new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits","volume":"47","author":"Drolet","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB128","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 1999)","first-page":"123","article-title":"Fast multiplication in finite field GF(2N)","volume":"Vol. 1717","author":"Silverman","year":"1999"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB129","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1109\/T-C.1971.223173","article-title":"A cellular-array multiplier for GF(2m)","volume":"C-20","author":"Laws","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0167-9260(02)00053-6_BIB130","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/92.661252","article-title":"Efficient semisystolic architectures for finite-field arithmetic","volume":"6","author":"Jain","year":"1998","journal-title":"IEEE Trans. VLSI systems"},{"issue":"4","key":"10.1016\/S0167-9260(02)00053-6_BIB131","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TC.1984.1676441","article-title":"Systolic multipliers for finite fields GF(2m)","volume":"C-33","author":"Yeh","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB132","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1109\/12.156540","article-title":"Bit-serial systolic divider and multiplier for finite fields GF(2m)","volume":"41","author":"Hasan","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB133","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/12.863045","article-title":"Look-up table-based large finite field multiplication in memory constrained cryptosystems","volume":"49","author":"Hasan","year":"2000","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB134","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/12.156539","article-title":"Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)","volume":"41","author":"Hasan","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB135","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/12.926154","article-title":"Bit-parallel systolic multipliers for GF(2m) fields defined by all-one and equally spaced polynomials","volume":"50","author":"Lee","year":"2001","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB136","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1109\/12.508323","article-title":"A new architecture for a parallel finite field multiplier with low complexity based on composite fields","volume":"45","author":"Paar","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB137","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201997","first-page":"363","article-title":"Fast arithmetic architectures for public-key algorithms over galois fields GF((2n)m)","volume":"Vol. 1233","author":"Paar","year":"1997"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB138","doi-asserted-by":"crossref","unstructured":"C. Paar, M. Rosner, Comparison of arithmetic architectures for Reed-Solomon decoders, in: K.L. Pocek, J. Arnold (Eds.), Proceedings of FCCM\u201997, Napa Valley, CA, 1997, pp. 219\u2013225.","DOI":"10.1109\/FPGA.1997.624622"},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB139","first-page":"847","article-title":"VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2m)","volume":"44","author":"Wei","year":"1997","journal-title":"IEEE Transactions on Circuits and Systems II: Analog Digital Signal Process."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB140","unstructured":"W.-C. Tsai, C. B. Shung, S.-J. Wang, A systolic architecture for elliptic curve cryptosystems, in: Proceedings of the ICSP2000, 2000, pp. 591\u2013597."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB141","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 1999)","first-page":"280","article-title":"Low complexity bit-parallel finite field arithmetic using polynomial basis","volume":"Vol. 1717","author":"Wu","year":"1999"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB142","doi-asserted-by":"crossref","unstructured":"G. Orlando, C. Paar, A super-serial galois fields multiplier for FPGAs and its application to public-key algorithms, in: Proceedings of Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201999), 1999, pp. 232\u2013239.","DOI":"10.1109\/FPGA.1999.803685"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB143","unstructured":"L. Song, K.K. Parhi, Low-complexity modified Mastrovito multipliers over finite fields GF(2M), in: Proceedings of the International Symposium on Circuits and Systems (ISCAS\u201999), IEEE, 1999, pp. 508\u2013512."},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB144","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/12.769434","article-title":"Mastrovito multiplier for all trinomials","volume":"48","author":"Sunar","year":"1999","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB145","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/12.859542","article-title":"Mastrovito multiplier for general irreducible polynomials","volume":"49","author":"Halbutog\u0303ullar\u0131","year":"2000","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB146","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/12.936239","article-title":"Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials","volume":"50","author":"Zhang","year":"2001","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB147","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1109\/12.888042","article-title":"VLSI algorithms, architectures, and implementation of a versatile GF(2m) processor","volume":"49","author":"Hasan","year":"2000","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB148","doi-asserted-by":"crossref","unstructured":"H. Wu, Montgomery multiplier and squarer in GF(2m), Tech. Report CORR 2000-28, The Centre for Applied Cryptographic Research (CACR), University of Waterloo, Canada, 2000.","DOI":"10.1007\/3-540-44499-8_21"},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB149","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/TC.2002.1004591","article-title":"Montgomery multiplier and squarer for a class of finite fields","volume":"51","author":"Wu","year":"2002","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB150","doi-asserted-by":"crossref","unstructured":"L. Gao, K.K. Parhi, Custom VLSI design of efficient low latency and low power finite field multiplier for Reed-Solomon codec, in: Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS 2001), Vol. 4, 2001, pp. 574\u2013577.","DOI":"10.1109\/ISCAS.2001.922302"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB151","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/12.660172","article-title":"Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields","volume":"47","author":"Ko\u00e7","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB152","unstructured":"Z. Yu, Low power finite field multiplication and division in re-configurable Reed-Solomon codes, in: Proceedings of the 2002 IEEE International Symposium on Circuits and Systems (ISCAS 2002), 2002, pp. 785\u2013788."},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB153","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TC.1985.1676616","article-title":"VLSI architectures for computing multiplications and inverses in GF(2m)","volume":"34","author":"Wang","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB154","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TC.2002.1004590","article-title":"A new construction of Massey-Omura parallel multiplier over GF(2m)","volume":"51","author":"Reyhani-Masoleh","year":"2002","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB155","unstructured":"C.C. Wang, Algorithm to design finite-field normal-basis multipliers, Tech. Report NPO-17109, NASA's Jet Propulsion Laboratory, Pasadena, CA, 1986."},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB156","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/12.35840","article-title":"An algorithm to design finite field multipliers using a self-dual normal bases","volume":"38","author":"Wang","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB157","unstructured":"I.M. Onyszchuk, R.C. Mullin, S.A. Vanstone, Computational method and apparatus for finite field multiplication, United States Patent, Patent Number: 4.745.568, May 17, 1988."},{"issue":"2","key":"10.1016\/S0167-9260(02)00053-6_BIB158","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00196789","article-title":"An implementation for a fast public key cryptosystem","volume":"3","author":"Agnew","year":"1991","journal-title":"J. Cryptol."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB159","doi-asserted-by":"crossref","unstructured":"G.B. Agnew, R.C. Mullin, S.A. Vanstone, On the development of a fast Elliptic Curve Cryptosystem, in: R.A. Rueppel (Ed.), Advances in Cryptology: Proceedings of EUROCRYPT\u201992, Lecture Notes in Computer Science, Springer, Berlin, Hungary, 1992, pp. 482\u2013487.","DOI":"10.1007\/3-540-47555-9_44"},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB160","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/12.589230","article-title":"A search of minimal key functions for normal basis multipliers","volume":"46","author":"Lu","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB161","unstructured":"R.C. Mullin, Multiple bit multiplier, United States Patent, Patent Number: 5,787,028, July 28, 1998."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB162","unstructured":"L. Gao, G.E. Sobelman, Improved VLSI designs for multiplication and inversion in GF(2m), in: Proceedings of the 13th Annual International ASIC\/SOC Conference, Washington DC, 2000, pp. 97\u2013101."},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB163","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/12.888054","article-title":"Efficient normal basis multipliers in composite fields","volume":"49","author":"Oh","year":"2000","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0167-9260(02)00053-6_BIB164","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/12.902754","article-title":"An efficient optimal normal basis type ii multiplier","volume":"50","author":"Sunar","year":"2001","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB165","doi-asserted-by":"crossref","unstructured":"S. Sutikno, A. Surya, An architecture of F22N multiplier for elliptic curves cryptosystem, in: Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS 2000), Vol. 1, Geneva, Switzerland, 2000, pp. 279\u2013282.","DOI":"10.1109\/ISCAS.2000.857084"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB166","doi-asserted-by":"crossref","unstructured":"A. Reyhani-Masoleh, M. A. Hasan, Efficient digit-serial normal basis multipliers over GF(2m), in: Proceedings of the 2002 IEEE International Symposium on Circuits and Systems (ISCAS 2002), 2002, pp. 781\u2013784.","DOI":"10.1109\/ISCAS.2002.1010820"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB167","unstructured":"A. Reyhani-Masoleh, M. A. Hasan, Efficient multiplication beyond optimal normal bases, Tech. Report CORR 2002-12, The Centre for Applied Cryptographic Research (CACR), University of Waterloo, 2002."},{"issue":"13","key":"10.1016\/S0167-9260(02)00053-6_BIB168","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1049\/el:19910738","article-title":"New bit-serial systolic multiplier for GF(2m) using irreducible trinomials","volume":"27","author":"Diab","year":"1991","journal-title":"Electron. Lett."},{"issue":"3","key":"10.1016\/S0167-9260(02)00053-6_BIB169","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/12.485570","article-title":"GF(2m) multiplication and division over the dual basis","volume":"45","author":"Fenn","year":"1996","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB170","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1109\/12.707588","article-title":"Low complexity bit-parallel multipliers for a class of finite fields","volume":"47","author":"Wu","year":"1998","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/S0167-9260(02)00053-6_BIB171","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1109\/12.736433","article-title":"New low-complexity bit-parallel finite field multipliers using weakly dual nases","volume":"47","author":"Wu","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB172","series-title":"Proceedings of Second International Workshop on Practice and Theory in Public Key Cryptography (PKC 1999)","first-page":"12","article-title":"A new aspect of dual basis for efficient field arithmetic","volume":"Vol. 1560","author":"Lee","year":"1999"},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB173","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/TC.2002.1004597","article-title":"Equally spaced polynomials, dual bases, and multiplication in F2n","volume":"51","author":"Gollman","year":"2002","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/S0167-9260(02)00053-6_BIB174","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1109\/12.2212","article-title":"A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard bases","volume":"37","author":"Hsu","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB175","unstructured":"C. Paar, N. Lange, A comparative VLSI synthesis of finite field multipliers, in: Proceedings of the Third International Symposium on Communication Theory & Applications, Lake District, UK, 1995."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB176","series-title":"Proceedings of the Ninth International Workshop on Field-Programmable Logic and Applications (FPL)","first-page":"51","article-title":"Optimal finite field multipliers for FPGAs","volume":"Vol. 1673","author":"Ahlquist","year":"1999"},{"year":"1993","series-title":"Elliptic Curve Public Key Cryptosystems","author":"Menezes","key":"10.1016\/S0167-9260(02)00053-6_BIB177"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB178","series-title":"State of the Art in Applied Cryptography","first-page":"132","article-title":"Elliptic curve public-key cryptosystems\u2014an introduction","volume":"Vol. 1528","author":"De Win","year":"1997"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB179","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1008354106356","article-title":"The state of elliptic curve cryptography","volume":"19","author":"Koblitz","year":"2000","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB180","unstructured":"IEEE P1363, Standard specifications for public key cryptography, 1999."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB181","series-title":"Proceedings of ICICS\u201997","first-page":"282","article-title":"Efficient elliptic curve exponentiation","volume":"Vol. 1334","author":"Miyaji","year":"1997"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB182","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201997","first-page":"342","article-title":"Efficient algorithms for elliptic curve cryptosystems","volume":"Vol. 1294","author":"Guajardo","year":"1997"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB183","series-title":"Proceedings of ASIACRYPT 1998","first-page":"51","article-title":"Efficient elliptic curve exponentiation using mixed coordinates","volume":"Vol. 1514","author":"Cohen","year":"1998"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB184","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","article-title":"Speeding up the computations on an elliptic curve using addition-subtraction chains","volume":"24","author":"Morain","year":"1990","journal-title":"Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB185","series-title":"Advances in Cryptology: Proceedings of CRYPTO\u201997","first-page":"357","article-title":"An improved algorithm for arithmetic on a family of elliptic curves","volume":"Vol. 1294","author":"Solinas","year":"1997"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB186","unstructured":"C. Paar, Implementation options for finite field arithmetic for elliptic curve cryptosystems, Presented at the Third workshop on Elliptic Curve Cryptography (ECC 1999), http:\/\/www.cacr.math.uwaterloo.ca\/conferences\/1999\/ecc99\/slides.html (November 1\u20133, 1999)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB187","unstructured":"Certicom Corp., The elliptic curve cryptosystem for smart cards, The seventh in a series of ECC white papers, http:\/\/www.certicom.com."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB188","series-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2001)","first-page":"206","article-title":"A bit-serial unified multiplier architecture for finite fields GF(p) and GF(2n)","volume":"Vol. 2162","author":"Grossch\u00e4dl","year":"2001"},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB189","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1109\/12.403725","article-title":"The Montgomery inverse and its applications","volume":"44","author":"Kaliski","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/S0167-9260(02)00053-6_BIB190","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/12.863048","article-title":"The Montgomery modular inverse revisited","volume":"49","author":"Sava\u015f","year":"2000","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB191","series-title":"Proceedings of Workshop on Cryptograpic Hardware and Embedded Systems (CHES 2001)","first-page":"356","article-title":"A scalable GF(p) elliptic curve processor architecture for programmable hardware","volume":"Vol. 2162","author":"Orlando","year":"2001"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB192","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","article-title":"Constructive and destructive facets of Weil descent on elliptic curves","volume":"15","author":"Gaudry","year":"2002","journal-title":"J. Cryptol."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB193","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201902","first-page":"29","article-title":"Extending the GHS weil descent attack","volume":"Vol. 2332","author":"Galbraith","year":"2002"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB194","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201901","first-page":"30","article-title":"How secure are elliptic curves over composite extension fields?","volume":"Vol. 2045","author":"Smart","year":"2001"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB195","unstructured":"G. Frey, How to disguise an elliptic curve, Talk at Waterloo workshop on the ECDLP, http:\/\/www.cacr.math.uwaterloo.ca\/conferences\/1998\/ecc98\/slides.html (1998)."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB196","unstructured":"H. Wu, On complexity of squaring using polynomial basis in GF(2m), Tech. Report CORR 2000-28, The Centre for Applied Cryptographic Research (CACR), University of Waterloo, Canada, 2000."},{"issue":"13","key":"10.1016\/S0167-9260(02)00053-6_BIB197","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1049\/el:20000824","article-title":"Squaring architecture for GF(2m) and its applications in cryptographic systems","volume":"36","author":"Orlando","year":"2000","journal-title":"Electron. Lett."},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB198","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1109\/12.35833","article-title":"A VLSI architecture for fast inversion in GF(2m)","volume":"38","author":"Feng","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"17","key":"10.1016\/S0167-9260(02)00053-6_BIB199","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1049\/el:19961036","article-title":"Fast normal basis inversion in GF(2m)","volume":"32","author":"Fenn","year":"1996","journal-title":"Electron. Lett."},{"issue":"3","key":"10.1016\/S0167-9260(02)00053-6_BIB200","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1049\/el:19970128","article-title":"Complexity of the inversion in GF(2m)","volume":"33","author":"Calvo","year":"1997","journal-title":"Electron. Lett."},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB201","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/12.926155","article-title":"A fast algorithm for multiplicative inversion in GF(2m) using normal basis","volume":"50","author":"Takagi","year":"2001","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB202","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/12.729800","article-title":"Systolic array implementation of Euclid's algorithm for inversion and division in GF(2m)","volume":"47","author":"Guo","year":"1998","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB203","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/12.888047","article-title":"New systolic arrays for C+AB2, inversion, and division in GF(2m)","volume":"49","author":"Wang","year":"2000","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/S0167-9260(02)00053-6_BIB204","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1049\/el:19880226","article-title":"Effective recursive algorithm for computing multiplicative inverses in GF(2m)","volume":"24","author":"Itoh","year":"1988","journal-title":"Electron. Lett."},{"issue":"10","key":"10.1016\/S0167-9260(02)00053-6_BIB205","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1049\/el:19890449","article-title":"Generalized fast algorithm for computing multiplicative inverses in GF(2m)","volume":"25","author":"Asano","year":"1989","journal-title":"Electron. Lett."},{"issue":"8","key":"10.1016\/S0167-9260(02)00053-6_BIB206","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/12.238496","article-title":"On computing multiplicative inverses in GF(2m)","volume":"42","author":"Brunner","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB207","unstructured":"Z. Yan, D.V. Sarwate, Systolic architectures for finite field inversion and division, in: Proceedings of the 2002 IEEE International Symposium on Circuits and Systems (ISCAS 2002), 2002, pp. 789\u2013792."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB208","series-title":"Advances in Cryptology: Proceedings of EUROCRYPT\u201989","first-page":"706","article-title":"A fast elliptic curve cryptosystem","volume":"Vol. 434","author":"Agnew","year":"1989"},{"issue":"5","key":"10.1016\/S0167-9260(02)00053-6_BIB209","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/49.223883","article-title":"An implementation of elliptic curve cryptosystem over F2155","volume":"11","author":"Agnew","year":"1993","journal-title":"IEEE J. Selected Areas Commun."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB210","doi-asserted-by":"crossref","unstructured":"S. Sutikno, R. Effendi, A. Surya, Design and implementation of arithmetic processor GF(2155) for elliptic curve cryptosystems, in: Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems (APCCAS\u201998), 1998, pp. 647\u2013650.","DOI":"10.1109\/APCCAS.1998.743903"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB211","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02620228","article-title":"Arithmetic operations in GF(2m)","volume":"6","author":"Agnew","year":"1993","journal-title":"J. Cryptol."},{"key":"10.1016\/S0167-9260(02)00053-6_BIB212","doi-asserted-by":"crossref","unstructured":"S. Sutikno, A. Surya, R. Effendi, An implementation of elgamal elliptic curves cryptosystem, in: Proceedings of the 1998 IEEE Asia Pacific Conference on Circuits and Systems, Chiangmai, Thailand, 1998, pp. 483\u2013486.","DOI":"10.1109\/APCCAS.1998.743829"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB213","doi-asserted-by":"crossref","unstructured":"L. Gao, S. Shrivastava, H. Lee, G.E. Sobelman, A compact fast variable key size elliptic curve cryptosystem coprocessor, in: Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM), 1999, pp. 304\u2013305.","DOI":"10.1109\/FPGA.1999.803707"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB214","series-title":"Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems (CHES 1999)","first-page":"257","article-title":"Elliptic curve scalar multiplier design using FPGAs","volume":"Vol. 1717","author":"Gao","year":"1999"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB215","doi-asserted-by":"crossref","unstructured":"O. Hauck, A. Katoch, S.A. Huss, VLSI system design using asynchronous wave pipelines: a 0.35\u03bcm CMOS 1.5GHz elliptic curve public key cryptosystem chip, in: Proceedings of Sixth International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2000), IEEE, 2000, pp. 188\u2013196.","DOI":"10.1109\/ASYNC.2000.837014"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB216","doi-asserted-by":"crossref","unstructured":"K.H. Leung, K.W. Ma, W.K. Wong, P.H.W. Leong, FPGA implementation of a microcoded elliptic curve cryptographic processor, in: Proceedings of Field-Programmable Custom Computing Machines (FCCM\u201900), 2000, pp. 68\u201376.","DOI":"10.1109\/FPGA.2000.903394"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB217","doi-asserted-by":"crossref","unstructured":"M. Ernst, S. Klupsch, O. Hauck, S.A. Huss, Rapid prototyping for hardware accelerated elliptic curve public-key cryptosystems, in: Proceedings of 12th IEEE Workshop on Rapid System Prototyping, Monterey, CA, 2001, pp. 24\u201331.","DOI":"10.1109\/IWRSP.2001.933834"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB218","series-title":"Proceedings of Workshop on Cryptograpic Hardware and Embedded Systems (CHES 2000)","first-page":"41","article-title":"A high-performance reconfigurable elliptic curve processor for GF(2m)","volume":"Vol. 1965","author":"Orlando","year":"2000"},{"issue":"11","key":"10.1016\/S0167-9260(02)00053-6_BIB219","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1109\/4.962304","article-title":"An energy-efficient reconfigurable public-key cryptography processor","volume":"36","author":"Goodman","year":"2001","journal-title":"IEEE J. Solid-State Circuits"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB220","doi-asserted-by":"crossref","unstructured":"S. Janssens, J. Thomas, W. Borremans, P. Gijsels, I. Verbauwhede, F. Vercauteren, B. Preneel, J. Vandewalle, Hardware\/software co-design of an elliptic curve public-key cryptosystem, in: Proceedings IEEE Workshop on of Signal Processing Systems, 2001, pp. 209\u2013216.","DOI":"10.1109\/SIPS.2001.957349"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB221","doi-asserted-by":"crossref","unstructured":"P. Schaumont, I. Verbauwhede, K. Keutzer, M. Sarrafzadeh, A quick safari through the reconfiguration jungle, in: Proceedings of 38th Design Automation Conference (DAC\u201901), Las Vegas, NV, USA, 2001, pp. 172\u2013177.","DOI":"10.1145\/378239.378404"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB222","doi-asserted-by":"crossref","unstructured":"M. Bednara, M. Daldrup, J. Teich, J. von zur Gathen, J. Shokrollahi, Tradeoff analysis of FPGA based Elliptic Curve Cryptosystems, in: Proceedings of the 2002 IEEE International Symposium on Circuits and Systems (ISCAS 2002), 2002, pp. 797\u2013800.","DOI":"10.1109\/ISCAS.2002.1010824"},{"key":"10.1016\/S0167-9260(02)00053-6_BIB223","unstructured":"J.-H. Kim, D.-H. Lee, A compact finite field processor over GF(2m) for Elliptic Curve Cryptography, in: Proceedings of the 2002 IEEE International Symposium on Circuits and Systems (ISCAS 2002), 2002, pp. 340\u2013343."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926002000536?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926002000536?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:11:27Z","timestamp":1759137087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926002000536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":223,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167926002000536"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(02)00053-6","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2003,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hardware architectures for public key cryptography","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(02)00053-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}