{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:44:29Z","timestamp":1743079469217,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811668890"},{"type":"electronic","value":"9789811668906"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-6890-6_43","type":"book-chapter","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:02:28Z","timestamp":1646488948000},"page":"575-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardware Implementation of Multiplication over Quartic Extension Fields"],"prefix":"10.1007","author":[{"given":"Arthur","family":"Lavice","sequence":"first","affiliation":[]},{"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Berzati","sequence":"additional","affiliation":[]},{"given":"Jean-Baptiste","family":"Rigaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,6]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Barbulescu R, Duquesne S (2018) Updating key size estimations for pairings. J Cryptol. https:\/\/hal.archives-ouvertes.fr\/hal-01534101","DOI":"10.1007\/s00145-018-9280-5"},{"key":"43_CR2","unstructured":"Barbulescu R, El Mrabet N, Ghammam L (2019) A taxonomy of pairings, their security, their complexity. IACR Cryptology ePrint Archive 2019:485"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Barreto PSLM, Lynn B, Scott M (2002) Constructing elliptic curves with prescribed embedding degrees. In: SCN. Lecture notes in computer science, vol 2576. Springer, pp 257\u2013267","DOI":"10.1007\/3-540-36413-7_19"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Barreto PSLM, Naehrig M (2005) Pairing-friendly elliptic curves of prime order. In: Selected areas in cryptography. Lecture notes in computer science, vol 3897. Springer, pp 319\u2013331","DOI":"10.1007\/11693383_22"},{"key":"43_CR5","unstructured":"Ben-Sasson E, Chiesa A, Tromer E, Virza M (2014) Succinct non-interactive zero knowledge for a von neumann architecture. In: Proceedings of the 23rd USENIX conference on security symposium. SEC\u201914, USENIX Association, USA, pp 781\u2013796"},{"key":"#cr-split#-43_CR6.1","doi-asserted-by":"crossref","unstructured":"Boneh D, Franklin M (2001) Identity-based encryption from the weil pairing. In: Kilian J","DOI":"10.1007\/3-540-44647-8_13"},{"key":"#cr-split#-43_CR6.2","unstructured":"(ed) Advances in cryptology - CRYPTO 2001. Springer, Berlin, pp 213-229"},{"key":"#cr-split#-43_CR7.1","doi-asserted-by":"crossref","unstructured":"Boneh D, Lynn B, Shacham H (2001) Short signatures from the weil pairing. In: Boyd C","DOI":"10.1007\/3-540-45682-1_30"},{"key":"#cr-split#-43_CR7.2","unstructured":"(ed) Advances in cryptology - ASIACRYPT 2001. Springer, Berlin, pp 514-532"},{"key":"43_CR8","unstructured":"El Mrabet N, Guillermin N, Ionica S (2009) A study of pairing computation for elliptic curves with embedding degree 15. IACR Cryptology ePrint Archive 2009:370"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"El Mrabet N, Guillevic A, Ionica S (2011) Efficient multiplication in finite field extensions of degree 5. In: Nitaj A, Pointcheval D (eds) Progress in cryptology - AFRICACRYPT 2011. Springer, Berlin, pp 188\u2013205","DOI":"10.1007\/978-3-642-21969-6_12"},{"key":"43_CR10","doi-asserted-by":"publisher","unstructured":"Freeman D, Scott M, Teske E (2010) A taxonomy of pairing-friendly elliptic curves. J Cryptol 23(2):224\u2013280. https:\/\/doi.org\/10.1007\/s00145-009-9048-z","DOI":"10.1007\/s00145-009-9048-z"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Guillevic A (2020) A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level. In: Public Key Cryptography (2). Lecture Notes in Computer Science, vol 12111. Springer, pp 535\u2013564","DOI":"10.1007\/978-3-030-45388-6_19"},{"key":"43_CR12","unstructured":"Hankerson D, Menezes A, Scott M (2009) Software implementation of pairings. In: Identity-based cryptography, cryptology and information security series, vol 2. IOS Press, Amsterdam, pp 188\u2013206"},{"issue":"7","key":"43_CR13","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1109\/TC.2010.247","volume":"60","author":"M Huang","year":"2011","unstructured":"Huang M, Gaj K, El-Ghazawi T (2011) New hardware architectures for montgomery modular multiplication algorithm. IEEE Trans Comput 60(7):923\u2013936. https:\/\/doi.org\/10.1109\/TC.2010.247","journal-title":"IEEE Trans Comput"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Kachisa EJ, Schaefer EF, Scott M (2008) Constructing brezing-weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Pairing. Lecture notes in computer science, vol 5209. Springer, pp 126\u2013135","DOI":"10.1007\/978-3-540-85538-5_9"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Kim T, Barbulescu R (2016) Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw M, Katz J (eds) Advances in cryptology - CRYPTO 2016. Springer, Berlin, pp 543\u2013571","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"43_CR16","unstructured":"Knuth DE (1997) The art of computer programming, vol 1, 3rd edn. Fundamental algorithms. Addison Wesley Longman Publishing Co., Inc., USA"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Menezes A (2009) An introduction to pairing-based cryptography. In: Recent trends in cryptography, vol 477, pp 47\u201365","DOI":"10.1090\/conm\/477\/09303"},{"key":"43_CR18","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard JM (1978) Monte Carlo methods for index computation mod $$p$$. Math Comput 32:918\u2013924","journal-title":"Math Comput"},{"issue":"1","key":"43_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren F (2010) Optimal pairings. IEEE Trans Inf Theory 56(1):455\u2013461. https:\/\/doi.org\/10.1109\/TIT.2009.2034881","journal-title":"IEEE Trans Inf Theory"},{"key":"43_CR20","doi-asserted-by":"publisher","unstructured":"Wang AT, Guo BW, Wei CJ (2019) Highly-parallel hardware implementation of optimal ate pairing over barreto-naehrig curves. Integration 64:13\u201321. https:\/\/doi.org\/10.1016\/j.vlsi.2018.04.013, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167926018300336","DOI":"10.1016\/j.vlsi.2018.04.013"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Seventh International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-6890-6_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:08:18Z","timestamp":1646489298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-6890-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811668890","9789811668906"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-6890-6_43","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}