{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:04:35Z","timestamp":1725858275174},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319396385"},{"type":"electronic","value":"9783319396392"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39639-2_14","type":"book-chapter","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T07:25:00Z","timestamp":1466148300000},"page":"157-168","source":"Crossref","is-referenced-by-count":0,"title":["Arithmetic in Finite Fields Supporting Type-2 or Type-3 Optimal Normal Bases"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Gashkov","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Frolov","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Sergeev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,18]]},"reference":[{"key":"14_CR1","unstructured":"Lidl, R., Niderreiter, H.: Finite Fields. Addison-Wesley Publishing Company, London (1983)"},{"key":"14_CR2","volume-title":"Finite Fields: Structure and Arithmetics","author":"D Jungnickel","year":"1993","unstructured":"Jungnickel, D.: Finite Fields: Structure and Arithmetics. Wissenschaftsverlag, Mannheim (1993)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Algebraic Aspects of Cryptography. Springer, Berlin (1998)","DOI":"10.1007\/978-3-662-03642-6"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Proceedings of the Tenth IMA International Conference on Cryptography and Coding\/LNCS 3796, pp. 3\u201336 (2005)","DOI":"10.1007\/11586821_2"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Joux, A.: One Round Protocol for Tripartite Diffie-Hellman. LNCS 1838, pp. 385\u2013393 (2000)","DOI":"10.1007\/10722028_23"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Baretto, P.S.L.M., Kim, H.Y., Lynn, D., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystims. Crypto 2002, LNCS 2442, pp. 354\u2013358 (2002)","DOI":"10.1007\/3-540-45708-9_23"},{"key":"14_CR7","unstructured":"Lee E., Lee H.-S., Lee Y. Fast computation of Tate pairing on general divisors for hyperelliptic curves of genus 3. \u2014 Cryptology ePrint Archive, Report 2006\/125. \u2014 http:\/\/eprint.iacr.org\/2006\/125"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bolotov, A.A., Gashkov, S.B., Burtsev, A.A., Zhebet, S.Y., Frolov, A.B.: On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings. J. Math. Sci. pp. 49\u201375 (2010) (Springer Science\u00a0+\u00a0Business Media, Inc., New York)","DOI":"10.1007\/s10958-010-9974-1"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A., Wilson, R.M.: Optimal Normal Bases in GF(pn). Discrete Appl. Math. 22, 149\u2013161 (1988\/89)","DOI":"10.1016\/0166-218X(88)90090-X"},{"issue":"4","key":"14_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1515\/dma.2001.11.4.327","volume":"11","author":"AA Bolotov","year":"2001","unstructured":"Bolotov, A.A., Gashkov, S.B.: On quick multiplication in normal bases of finite fields. Discrete Math. Appl. 11(4), 327\u2013356 (2001)","journal-title":"Discrete Math. Appl."},{"key":"14_CR11","unstructured":"Jamshid Shokrollahi. Efficient implementation of elliptic curve cryptography on FPGA. PhD thesis, universitet Bonn, 2007"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Shokrollahi, A., Shokrollahi, J.: Efficient multiplication using type 2 optimal normal bases. In: WAIFI\u201907, LNCS, pp. 55\u201368 (2007)","DOI":"10.1007\/978-3-540-73074-3_6"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-13797-6_4","volume":"6087","author":"DJ Bernstein","year":"2010","unstructured":"Bernstein, D.J., Lange, T.: Type-II optimal polynomial bases. Arith. Finite Fields Proc. Lect. Notes Comput. Sci. 6087, 41\u201361 (2010)","journal-title":"Arith. Finite Fields Proc. Lect. Notes Comput. Sci."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Duursma, I., Lee, H.-S.: \u201cTate pairing implementation for hyperelliptic curves\u201d y2\u00a0=\u00a0xp\u00a0\u2212\u00a0x\u00a0+\u00a0d. Asiacrypt-2003, LNCS 2894, pp. 111\u2013123 (2003)","DOI":"10.1007\/978-3-540-40061-5_7"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Gashkov, S., Frolov, A., Lukin, S., Sukhanova, O.: Arithmetic in the finite fields using optimal normal and polynomial bases in combination. In: Advances in Intelligent Systems and Computing. Volume 365. Theory and Engineering of Complex Systems and Dependability. Proceedings of the Tenth International Conference on Dependability and Complex Systems DepCos-RELCOMEX, pp. 153\u2013162, June 29\u2013July 3 2015","DOI":"10.1007\/978-3-319-19216-1_15"},{"key":"14_CR16","first-page":"45","volume":"1","author":"SB Gashkov","year":"2016","unstructured":"Gashkov, S.B., Frolov, A.B., Lukin, S.A.: Optimal normal bases of 2-d and 3-d types in finite fields of characteristic 7. MPEI Bull. 1, 45\u201349 (2016). (In Russian)","journal-title":"MPEI Bull."},{"issue":"5","key":"14_CR17","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1515\/dma.2000.10.5.499","volume":"10","author":"SB Gashkov","year":"2000","unstructured":"Gashkov, S.B.: On fast multiplication of polynomials, the Fourier and Hartley transforms. Discrete Math. Appl. 10(5), 499\u2013528 (2000)","journal-title":"Discrete Math. Appl."},{"key":"14_CR18","unstructured":"Bernstein, D.J.: Minimum number of bit operations for multiplication. http:\/\/binary.cr.yp.to\/m.html . Accessed 2009"},{"key":"14_CR19","unstructured":"Gashkov, S.B., Frolov, A.B., Shilkin, S.O.: On some algorithms of inversion and division in finite rings and fields. MPEI Bull. N6, 20\u201331 (2006) (in Russian)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields. Cryptographic Hardware and Embedded Systems, CHES 2000, LNCS 1965, pp. 1\u201324, Springer (2000)","DOI":"10.1007\/3-540-44499-8_1"}],"container-title":["Advances in Intelligent Systems and Computing","Dependability Engineering and Complex Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39639-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T21:37:43Z","timestamp":1568065063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39639-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319396385","9783319396392"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39639-2_14","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}