{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:54:50Z","timestamp":1743126890693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030973476"},{"type":"electronic","value":"9783030973483"}],"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-3-030-97348-3_11","type":"book-chapter","created":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T07:02:49Z","timestamp":1646722969000},"page":"189-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Hardware Implementations of\u00a0Pairings at\u00a0Updated Security Levels"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2804-1608","authenticated-orcid":false,"given":"Arthur","family":"Lavice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3840-584X","authenticated-orcid":false,"given":"Nadia El","family":"Mrabet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Berzati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7394-5345","authenticated-orcid":false,"given":"Jean-Baptiste","family":"Rigaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0402-6780","authenticated-orcid":false,"given":"Julien","family":"Proy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,9]]},"reference":[{"key":"11_CR1","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L., Markmann, T., Wahby, R.S., Liao, K.: RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"DF Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 48\u201368. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_5"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. J. Cryptol. (2018). https:\/\/hal.archives-ouvertes.fr\/hal-01534101","DOI":"10.1007\/s00145-018-9280-5"},{"key":"11_CR4","first-page":"485","volume":"2019","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu, R., El Mrabet, N., Ghammam, L.: A taxonomy of pairings, their security, their complexity. IACR Cryptol. ePrint Arch. 2019, 485 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"PSLM Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_19"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"11_CR7","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: USENIX Security Symposium, pp. 781\u2013796. USENIX Association (2014)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"issue":"3\u20134","key":"11_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125","journal-title":"J. Symb. Comput."},{"key":"11_CR11","unstructured":"Cocks, C., Pinch, R.: Identity-based cryptosystems based on the Weil pairing. In: manuscript (2001)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13013-7_14","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 224\u2013242. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_14"},{"key":"11_CR13","first-page":"342","volume":"2005","author":"P Duan","year":"2005","unstructured":"Duan, P., Cui, S., Chan, C.: Special polynomial families for generating more suitable elliptic curves for pairing-based cryptosystems. IACR Cryptol. ePrint Arch. 2005, 342 (2005)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"11_CR14","first-page":"370","volume":"2009","author":"N El Mrabet","year":"2009","unstructured":"El Mrabet, N., Guillermin, N., Ionica, S.: A study of pairing computation for elliptic curves with embedding degree 15. IACR Cryptol. ePrint Arch. 2009, 370 (2009)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Ghammam, L., Fouotsa, E.: Improving the computation of the optimal Ate pairing for a high security level. J. Appl. Math. Comput. 59 (2018). https:\/\/doi.org\/10.1007\/s12190-018-1167-y","DOI":"10.1007\/s12190-018-1167-y"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_13","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R Granger","year":"2010","unstructured":"Granger, R., Scott, M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 209\u2013223. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_13"},{"key":"11_CR18","unstructured":"Guillevic, A., Masson, S., Thom\u00e9, E.: Cocks-Pinch curves of embedding degrees five to eight and optimal Ate pairing computation. Cryptology ePrint Archive, Report 2019\/431 (2019). https:\/\/eprint.iacr.org\/2019\/431"},{"key":"11_CR19","unstructured":"Hess, F., Smart, N., Vercauteren, F.: The Eta pairing revisited. Cryptology ePrint Archive, Report 2006\/110 (2006). https:\/\/eprint.iacr.org\/2006\/110"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"F Hess","year":"2008","unstructured":"Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 18\u201338. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_2"},{"issue":"7","key":"11_CR21","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.: New hardware architectures for Montgomery modular multiplication algorithm. IEEE Trans. Comput. 60(7), 923\u2013936 (2011). https:\/\/doi.org\/10.1109\/TC.2010.247","journal-title":"IEEE Trans. Comput."},{"key":"11_CR22","unstructured":"John, T.: Duality theorems in Galois cohomology over number fields. In: International Congress of Mathematicians Stockholm 1962, Djursholm (1963)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Joux, A.: A one round protocol for tripartite diffie-hellman. In: ANTS-IV: Proceedings of the 4th International Symposium on Algorithmic Number Theory, London, UK, p. 385394 (2000)","DOI":"10.1007\/10722028_23"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing brezing-weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_9"},{"key":"11_CR25","unstructured":"Karabina, K.: Squaring in cyclotomic subgroups. Cryptology ePrint Archive, Report 2010\/542 (2010). https:\/\/eprint.iacr.org\/2010\/542"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-71667-1_10","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2017","author":"MA-A Khandaker","year":"2017","unstructured":"Khandaker, M.A.-A., Nanjo, Y., Ghammam, L., Duquesne, S., Nogami, Y., Kodera, Y.: Efficient optimal ate pairing at 128-bit security level. In: Patra, A., Smart, N.P. (eds.) INDOCRYPT 2017. LNCS, vol. 10698, pp. 186\u2013205. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71667-1_10"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"key":"11_CR28","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 1 (3rd Ed.): Fundamental Algorithms. Addison Wesley Longman Publishing Co., Inc., USA (1997)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13\u201336. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_2"},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The weil pairing, and its efficient calculation. J. Cryptol. 17(4), 235\u2013261 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0315-8","journal-title":"J. Cryptol."},{"issue":"170","key":"11_CR31","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Salman, A., Diehl, W., Kaps, J.: A light-weight hardware\/software co-design for pairing-based cryptography with low power and energy consumption. In: FPT, pp. 235\u2013238. IEEE (2017)","DOI":"10.1109\/FPT.2017.8280149"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Tenca, A., Koc, C.: A scalable architecture for Montgomery multiplication. In: Proceedings of First International Workshop Cryptographic Hardware and Embedded Systems (CHES 1999), pp. 94\u2013108 (01 1999)","DOI":"10.1007\/3-540-48059-5_10"},{"issue":"1","key":"11_CR34","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2010). https:\/\/doi.org\/10.1109\/TIT.2009.2034881","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.vlsi.2018.04.013","volume":"64","author":"AT Wang","year":"2019","unstructured":"Wang, A.T., Guo, B.W., Wei, C.J.: Highly-parallel hardware implementation of optimal Ate pairing over Barreto-Naehrig curves. Integration 64, 13\u201321 (2019)","journal-title":"Integration"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Xiong, X., Wong, D.S., Deng, X.: Tinypairing: a fast and lightweight pairing-based cryptographic library for wireless sensor networks. In: WCNC, pp. 1\u20136. IEEE (2010)","DOI":"10.1109\/WCNC.2010.5506580"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-36334-4_10","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"GX Yao","year":"2013","unstructured":"Yao, G.X., Fan, J., Cheung, R.C.C., Verbauwhede, I.: Faster pairing coprocessor architecture. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 160\u2013176. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_10"},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-34931-7_24","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"X Zhang","year":"2012","unstructured":"Zhang, X., Lin, D.: Analysis of optimum pairing products at high security levels. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 412\u2013430. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_24"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97348-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T07:04:42Z","timestamp":1646723082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97348-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030973476","9783030973483"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97348-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CARDIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Smart Card Research and Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L\u00fcbeck","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cardis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cardis2021.its.uni-luebeck.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}