{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:34:24Z","timestamp":1725888864037},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319594149"},{"type":"electronic","value":"9783319594156"}],"license":[{"start":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:00:00Z","timestamp":1496188800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-59415-6_16","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T04:42:30Z","timestamp":1496119350000},"page":"166-177","source":"Crossref","is-referenced-by-count":0,"title":["Comparative Analysis of Calculations in Cryptographic Protocols Using a Combination of Different Bases of Finite Fields"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Gashkov","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Frolov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"4","key":"16_CR1","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\u2013\u2013356 (2001)","journal-title":"Discrete Math. Appl."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A., Wilson, R.M.: Optimal normal bases in GF(p n ). Discrete Appl. Math. 22, 149\u2013161 (1988\/1989)","DOI":"10.1016\/0166-218X(88)90090-X"},{"key":"16_CR3","unstructured":"Shokrollahi, J.: Efficient implementation of elliptic curve cryptography on FPGA. PhD thesis, Universit\u00e4t Bonn (2007)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Shokrollahi, A., Shokrollahi, J.: Efficient multiplication using type 2 optimal normal bases. In: WAIFI 2007. LNCS, pp. 55\u201368 (2007)","DOI":"10.1007\/978-3-540-73074-3_6"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Type-II optimal polynomial bases. In: Arithmetic Finite Fields, Proceedings. LNCS, vol. 6087, pp. 41\u201361 (2010)","DOI":"10.1007\/978-3-642-13797-6_4"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: ANTS 2000. LNCS, vol. 1838, pp. 385\u2013394 (2000)","DOI":"10.1007\/10722028_23"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Menezes, A.J., Vanstone, S., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Th. IT-39, 1639\u20131646 (1993)","DOI":"10.1109\/18.259647"},{"key":"16_CR8","unstructured":"Bernstein, D.J.: Minimum number of bit operations for multiplication. http:\/\/binary.cr.yp.to\/m.html , (Accessed 2009)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Kwon, S.: Efficient tate pairing computation for supersingular elliptic curves over binary fields. Cryptology ePrint archive, Report 2004\/303 (2004)","DOI":"10.1007\/11506157_12"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Dependability Engineering of Complex Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59415-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T19:19:49Z","timestamp":1659035989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59415-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,31]]},"ISBN":["9783319594149","9783319594156"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59415-6_16","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,5,31]]}}}