{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:40:50Z","timestamp":1725522050095},"publisher-location":"Boston, MA","reference-count":21,"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_5","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T16:55:17Z","timestamp":1228928117000},"page":"75-104","source":"Crossref","is-referenced-by-count":0,"title":["Fast Finite Field Multiplication"],"prefix":"10.1007","author":[{"given":"Serdar S\u00fcer","family":"Erdem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu\u011frul","family":"Yanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c7etin Kaya","family":"Ko\u00e7","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"D. V. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 2000.","DOI":"10.1007\/s001450010012"},{"key":"5_CR2","first-page":"311","volume-title":"Advances in Cryptology\u2013-CRYPTO 86, Proceedings","author":"P. Barrett","year":"1986","unstructured":"P. Barrett. Implementing the Rivest Shamir and Adleman public-key encryption algorithm on a standard digital signal processor. In A. M. Odlyzko, editor, Advances in Cryptology\u2013-CRYPTO 86, Proceedings, Lecture Notes in Computer Science, vol. 263, pp. 311\u2013323. Springer, Berlin, Germany, 1986."},{"key":"5_CR3","volume-title":"Algebraic Coding Theory","author":"E. Berlekamp","year":"1968","unstructured":"E. Berlekamp. Algebraic Coding Theory. McGraw-Hill, New York, NY, 1968."},{"key":"5_CR4","volume-title":"Theory and Practice of Error Control Codes","author":"R. Blahut","year":"1983","unstructured":"R. Blahut. Theory and Practice of Error Control Codes. Addison-Wesley, Reading, MA, 1983."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"A. Bosselaers, R. Govaerts, and J. Vandewalle. Comparison of three modular reduction functions. In Crypto \u201993, Lecture Notes in Computer Science, vol. 773, pp. 175\u2013186, 1994.","DOI":"10.1007\/3-540-48329-2_16"},{"key":"5_CR6","volume-title":"Software implementation of the NIST elliptic curves over prime fields. Topics in Cryptology \u2013 CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"M. Brown, D. Hankerson, J. L\u00f3pez, and A. Menezes. Software implementation of the NIST elliptic curves over prime fields. Topics in Cryptology \u2013 CT-RSA 2001, Lecture Notes in Computer Science, vol. 2020, pp. 250\u2013265, Springer, Berlin, Germany, 2001"},{"key":"5_CR7","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2003","author":"J. F. Dhem","year":"2003","unstructured":"J. F. Dhem. Efficient modular reduction algorithm in $\\mathcal{F}_q[x]$ and its application to \u201cleft to right\u201d modular multiplication in $\\mathcal{F}_2[x]$ . In C. D. Walter, editor, Cryptographic Hardware and Embedded Systems \u2013 CHES 2003, Lecture Notes in Computer Science, vol. 2779, pp. 203\u2013213. Springer, Berlin, Germany, 2003."},{"key":"5_CR8","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":"5_CR9","unstructured":"IEEE P1363. Standard specifications for public-key cryptography."},{"key":"5_CR10","volume-title":"The Art of Computer Programming, Volume 2, Seminumerical Algorithms","author":"D. E. Knuth","year":"1998","unstructured":"D. E. Knuth. The Art of Computer Programming, Volume 2, Seminumerical Algorithms. Addison-Wesley, Reading, MA, Third edition, 1998.","edition":"3"},{"issue":"177","key":"5_CR11","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 of Computation, 48(177):203\u2013209, January 1987.","journal-title":"Mathematics of Computation"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"\u00c7. K. Ko\u00e7","year":"1998","unstructured":"\u00c7. K. Ko\u00e7 and T. Acar. Montgomery multiplication in GF $(2^k)$ . Designs, Codes and Cryptography, 14(1):57\u201369, April 1998.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"5_CR13","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"},{"key":"5_CR14","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"R. J. McEliece","year":"1989","unstructured":"R. J. McEliece. Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, Boston, MA, Second edition, 1989.","edition":"2"},{"key":"5_CR15","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"A. Menezes, P. Van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, 1997."},{"key":"5_CR16","volume-title":"Applications of Finite Fields","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes, I. F. Blake, X. Gao, R. C. Mullen, S. A. Vanstone, and T. Yaghoobian. Applications of Finite Fields. Kluwer Academic Publishers, Boston, MA, 1993."},{"key":"5_CR17","first-page":"417","volume-title":"Advances in Cryptology\u2013-CRYPTO 85, Proceedings","author":"V. Miller","year":"1985","unstructured":"V. Miller. Uses of elliptic curves in cryptography. In H. C. Williams, editor, Advances in Cryptology\u2013-CRYPTO 85, Proceedings, Lecture Notes in Computer Science, No. 218, pp. 417\u2013426. Springer, Berlin, Germany, 1985."},{"issue":"170","key":"5_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. L. Montgomery","year":"1985","unstructured":"P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519\u2013521, April 1985.","journal-title":"Mathematics of Computation"},{"key":"5_CR19","volume-title":"Error-Correcting Codes","author":"W. W. Peterson","year":"1972","unstructured":"W. W. Peterson and E. J. Weldon Jr. Error-Correcting Codes. MIT Press, Cambridge, MA, 1972."},{"key":"5_CR20","unstructured":"J. Solinas. Generalized Mersenne numbers. Technical Report CORR 99-39, Dept. of C&O, University of Waterloo, 1999."},{"key":"5_CR21","volume-title":"Reed-Solomon Codes and Their Applications","author":"S. B. Wicker","year":"1994","unstructured":"S. B. Wicker and V. K. Bhargava, editors. Reed-Solomon Codes and Their Applications. IEEE Press, New York, NY, 1994."}],"container-title":["Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-71817-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T04:30:42Z","timestamp":1619670642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-71817-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387718163","9780387718170"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-71817-0_5","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}