{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:11:59Z","timestamp":1725516719032},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694984"},{"type":"electronic","value":"9783540694991"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69499-1_5","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"47-61","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Extension Field Inversion in the Frequency Domain"],"prefix":"10.1007","author":[{"given":"Sel\u00e7uk","family":"Bakt\u0131r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D.V. Bailey","year":"1998","unstructured":"Bailey, D.V., Paar, C.: Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 472\u2013485. Springer, Heidelberg (1998)"},{"issue":"3","key":"5_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D.V. Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography. Journal of Cryptology\u00a014(3), 153\u2013176 (2001)","journal-title":"Journal of Cryptology"},{"key":"5_CR3","unstructured":"Bakt\u0131r, S.: Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography. Master\u2019s thesis, Electrical and Computer Engineering Department, Worcester Polytechnic Institute, Worcester, MA, USA (April 2003)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/1185448.1185568","volume-title":"Proceedings of the 44th ACM Southeast Conference (ACMSE 2006)","author":"S. Bakt\u0131r","year":"2006","unstructured":"Bakt\u0131r, S., Sunar, B.: Achieving Efficient Polynomial Multiplication in Fermat Fields Using the Fast Fourier Transform. In: Proceedings of the 44th ACM Southeast Conference (ACMSE 2006), March 2006, pp. 549\u2013554. ACM Press, New York (2006)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1007\/11902140_103","volume-title":"Computer and Information Sciences \u2013 ISCIS 2006","author":"S. Bakt\u0131r","year":"2006","unstructured":"Bakt\u0131r, S., Sunar, B.: Finite Field Polynomial Multiplication in the Frequency Domain with Application to Elliptic Curve Cryptography. In: Levi, A., Sava\u015f, E., Yenig\u00fcn, H., Balc\u0131soy, S., Sayg\u0131n, Y. (eds.) ISCIS 2006. LNCS, vol.\u00a04263, pp. 991\u20131001. Springer, Heidelberg (2006)"},{"key":"5_CR6","unstructured":"Bakt\u0131r, S., Sunar, B.: Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography (preprint, 2007), http:\/\/www.wpi.edu\/~selcuk\/DFTmultExpanded_preprint.pdf"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11036-007-0022-4","volume":"12","author":"S. Bakt\u0131r","year":"2007","unstructured":"Bakt\u0131r, S., Kumar, S., Paar, C., Sunar, B.: A State-of-the-art Elliptic Curve Cryptographic Processor Operating in the Frequency Domain. Mobile Networks and Applications (MONET)\u00a012(4), 259\u2013270 (2007)","journal-title":"Mobile Networks and Applications (MONET)"},{"key":"5_CR8","volume-title":"DFT\/FFT and Convolution Algorithms","author":"C.S. Burrus","year":"1985","unstructured":"Burrus, C.S., Parks, T.W.: DFT\/FFT and Convolution Algorithms. John Wiley & Sons, Chichester (1985)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"J. Cooley","year":"1965","unstructured":"Cooley, J., Tukey, J.: An Algorithm for the Machine Calculation of Complex Fourier Series. Mathematics of Computation\u00a019, 297\u2013301 (1965)","journal-title":"Mathematics of Computation"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Guajardo, J., Paar, C.: Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography. Design, Codes, and Cryptography\u00a0(25), 207\u2013216 (2002)","DOI":"10.1023\/A:1013860532636"},{"key":"5_CR11","unstructured":"Hinton, G., Sager, D., Upton, M., Boggs, D., Carmean, D., Kyker, A., Roussel, P.: The Microarchitecture of the Pentium 4 Processor. Intel Technology Journal\u00a0Q1 (2001)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A Fast Algorithm for Computing Multiplicative Inverses in GF(2 m ) Using Normal Bases. Information and Computation\u00a078, 171\u2013177 (1988)","journal-title":"Information and Computation"},{"key":"5_CR13","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications, vol.\u00a020. Addison-Wesley, Reading (1983)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.2307\/2004932","volume":"25","author":"J.M. Pollard","year":"1971","unstructured":"Pollard, J.M.: The Fast Fourier Transform in a Finite Field. Mathematics of Computation\u00a025, 365\u2013374 (1971)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Saldaml\u0131, G., Ko\u00e7, \u00c7.K.: Spectral Modular Exponentiation. In: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)","DOI":"10.1109\/ARITH.2007.34"},{"key":"5_CR17","volume-title":"IFIP CARDIS 2000, Fourth Smart Card Research and Advanced Application Conference","author":"A. Woodbury","year":"2000","unstructured":"Woodbury, A., Bailey, D.V., Paar, C.: Elliptic Curve Cryptography on Smart Cards without Coprocessors. In: IFIP CARDIS 2000, Fourth Smart Card Research and Advanced Application Conference, Bristol, UK, September\u00a020\u201322, 2000. Kluwer, Dordrecht (2000)"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69499-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:48:55Z","timestamp":1557719335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69499-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540694984","9783540694991"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69499-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}