{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:40:36Z","timestamp":1725522036612},"publisher-location":"Boston, MA","reference-count":24,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387718163"},{"type":"electronic","value":"9780387718170"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-71817-0_6","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T16:55:17Z","timestamp":1228928117000},"page":"105-124","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Unified Arithmetic for Hardware Cryptography"],"prefix":"10.1007","author":[{"given":"Erkay","family":"Sava\u015f","sequence":"first","affiliation":[]},{"given":"\u00c7etin Kaya","family":"Ko\u00e7","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644\u2013654, November 1976.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR2","first-page":"169","volume":"56","author":"National Institute for Standards and Technology. Digital Signature Standard (DSS)","year":"1991","unstructured":"National Institute for Standards and Technology. Digital Signature Standard (DSS), Federal Register, 56:169, August 1991.","journal-title":"Federal Register"},{"issue":"177","key":"6_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, Elliptic curve cryptosystems. Mathematics Computation, 48(177):203\u2013209, January 1987.","journal-title":"Mathematics Computation"},{"key":"6_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic Curve Public Key ryptosystems","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes.Elliptic Curve Public Key ryptosystems. Kluwer Academic Publishers, Boston, MA, 1993."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"D. Boneh and M. Franklin.Identity-based Encryption from the Weil Pairing.In Advances in Cryptology \u2013 CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pp. 213\u2013229. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"A. Shamir. Identity-Based Cryptosystems and Signature Schemes. In Advances in Cryptology - YPTO 1985, volume 196 of Lecture Notes in Computer ience,pp. 47\u201353. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-39568-7_5"},{"issue":"170","key":"6_CR7","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"4","author":"P. L. Montgomery","year":"1985","unstructured":"P. L. Montgomery. Modular multiplication ithout trial division.Mathematics of Computation, 4(170):519\u2013521, April 1985.","journal-title":"Mathematics of Computation"},{"key":"6_CR8","unstructured":"\u00c7. K. Ko\u00e7 and T. Acar. Montgomery multiplication in GF $(2^k)$ . In Proceedings of Third Annual Workshop on Selected Areas in Cryptography,pp. 95\u2013106, Queen\u2019s University, Kingston, Ontario, Canada, August 15\u201316 1996."},{"key":"6_CR9","unstructured":"IEEE. P1363. Standard pecifications for public-key cryptography. 2000."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"E. Sava\u015f, A. F. Tenca, and \u00c7. Ko \u00e7,A scalable and unified multiplier architecture for inite fields $GF(p)$ and $GF(2^m)$ . In Cryptographic Hardware and Embedded Systems, Workshop on Cryptographic Hardware and Embedded Systems, pp. 277-292. Springer-Verlag, Berlin, 2000.","DOI":"10.1007\/3-540-44499-8_22"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-48059-5_10","volume":"1717","author":"A. F. Tenca\u00c7 K","year":"1999","unstructured":"A. F. Tenca and \u00c7 K. Ko\u00e7.\u201cA Scalable Architecture for Montgomery multiplication\u201d,Lecture Notes in Computer Science, 1999, 1717, pp. 94\u2013108.","journal-title":"Lecture Notes in Computer Science"},{"issue":"10","key":"6_CR12","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","volume":"EC","author":"A. Avizienis","year":"1961","unstructured":"A. Avizienis. Signed-digit number representations r fast parallel arithmetic. IRE Transaction lectrononic Computers,EC(10):389\u2013400, September 1961.","journal-title":"IRE Transaction lectrononic Computers"},{"key":"6_CR13","unstructured":"E. \u00d6zt\u00dcrk, E. Sava\u015f, and B. Sunar,A Versatile ontgomery Multiplier Architecture with Characteristic Three upport.Under review, 2008."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"E. Sava\u00e7, A. F. Tenca, M. E. Ciftcibasi, and \u00c7.K. Ko\u00e7,\u201cMultiplier architectures for $GF(p)$ and $GF(2^k)$ \u201d, IEE Proceedings: Computers and Digital Techniques, 151(2): 147\u2013160,March 2004.","DOI":"10.1049\/ip-cdt:20040047"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/00207169108804001","volume":"40","author":"S. E. Eldridge","year":"1991","unstructured":"S. E. Eldridge. A faster modular multiplication lgorithm. International Journal of Computational athematics, 40:63\u201368, 1991.","journal-title":"International Journal of Computational athematics"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7. K. Ko\u00e7","year":"1996","unstructured":"\u00c7. K. Ko\u00e7, T. Acar, and B. S. Kaliski Jr. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26\u201333, June 1996.","journal-title":"IEEE Micro"},{"issue":"4","key":"6_CR17","first-page":"317","volume":"145","author":"J.-H. Oh","year":"1998","unstructured":"J.-H. Oh and S.-J. Moon. Modular multiplication ethod. IEE Proceedings, 145(4):317\u2013318, July 1998.","journal-title":"IEE Proceedings"},{"issue":"21","key":"6_CR18","first-page":"1831","volume":"35","author":"C. D. Walter","year":"1999","unstructured":"C. D. Walter. Montgomery xponentitation needs no final subtractions. lectronic etters, 35(21):1831\u20131832, October 1999.","journal-title":"lectronic etters"},{"key":"6_CR19","first-page":"293","volume-title":"montgomery exponentiation with no final subtractions: Improved esults. In Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science","author":"G. Hachez","year":"2000","unstructured":"G. Hachez and J.-J. Quisquater. montgomery exponentiation with no final subtractions: Improved esults. In Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science, No. 1965, pp.293\u201301. pringer-Verlag, Berlin, 2000."},{"issue":"8","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"B. S. Kaliski Jr","year":"1995","unstructured":"B. S. Kaliski Jr., The Montgomery inverse and ts applications.IEEE Transactions on Computers, 44(8):1064\u2013065, August 1995.","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR21","unstructured":"A. A.-A. Gutub, A. F. Tenca, E.Sava\u015f, and \u00c7. K.Ko\u00e7. Scalable and unified ardware to compute montgomeryinverse in ${GF}(p)$ and $GF(2^n)$ . In .B. S. Kaliski Jr., \u00c7.K. Ko\u00e7 and C. Paar, editors, Cryptographic Hardware and Embedded Systems, LNCS, pp.485\u201300, Springer-Verlag Berlin, 2002."},{"key":"6_CR22","first-page":"1155","volume-title":"Architecture for unifiedfield inversion with pplications in elliptic curve cryptography. InProc. vol. 3, he th IEEE International Conference onElectronics, Circuits and ystems ICECS 2002","author":"E. Sava\u015f","year":"2002","unstructured":"E. Sava\u015f and \u00c7. K. Ko\u00e7, Architecture for unifiedfield inversion with pplications in elliptic curve cryptography. InProc. vol. 3, he th IEEE International Conference onElectronics, Circuits and ystems ICECS 2002, pp. 1155\u20131158,Dubrovnik, Croatia, September 2002."},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1049\/ip-cdt:20059032","volume":"152","author":"E. Sava\u00e7","year":"2005","unstructured":"E. Sava\u00e7, M. Naseer, A. A-A. Gutub, and \u00c7. K. Ko\u00e7.\u201cEfficient Unified ontgomery Inversion with Multibit Shifting\u201d,IEE roceedings: Computers and Digital Techniques, 152(4): 489\u2013498, July 2005.","journal-title":"IEE roceedings: Computers and Digital Techniques"},{"issue":"7","key":"6_CR24","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1109\/12.863048","volume":"49","author":"E. Sava\u015f","year":"2000","unstructured":"E. Sava\u015f and \u00c7. K. Ko\u00e7, The Montgomery modularinverse - revisited. IEEE Transactions n Computers,49(7):763\u2013766, July. 2000.","journal-title":"IEEE Transactions n Computers"}],"container-title":["Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-71817-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T04:30:43Z","timestamp":1619670643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-71817-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387718163","9780387718170"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-71817-0_6","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}