{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:38:48Z","timestamp":1769755128835,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2024,3,1]]},"DOI":"10.1587\/transfun.2023vlp0009","type":"journal-article","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T22:24:52Z","timestamp":1693434292000},"page":"549-556","source":"Crossref","is-referenced-by-count":2,"title":["Template-Based Design Optimization for Selecting Pairing-Friendly Curve Parameters"],"prefix":"10.1587","volume":"E107.A","author":[{"given":"Momoko","family":"FUKUDA","sequence":"first","affiliation":[{"name":"Faculty of Engineering, The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"IKEDA","sequence":"additional","affiliation":[{"name":"VLSI Design and Education Center, The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] D. Boneh and M. Franklin, \u201cIdentity-based encryption from the weil pairing,\u201d Annual International Cryptology Conference, pp.213-229, 2001. 10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] A. Sahai and B. Waters, \u201cFuzzy identity-based encryption,\u201d Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.457-473, 2005. 10.1007\/11426639_27","DOI":"10.1007\/11426639_27"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] T. Okamoto and K. Takashima, \u201cFully secure functional encryption with general relations from the decisional linear assumption,\u201d Annual Cryptology Conference, pp.191-208, 2010. 10.1007\/978-3-642-14623-7_11","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Kim and R. Barbulescu, \u201cExtended tower number field sieve: A new complexity for the medium prime case,\u201d Cryptology ePrint Archive, Paper 2015\/1027, 2015.","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. Menezes, P. Sarkar, and S. Singh, \u201cChallenges with assessing the impact of NFS advances on the security of pairing-based cryptography,\u201d Cryptology ePrint Archive, Paper 2016\/1102, 2016.","DOI":"10.1007\/978-3-319-61273-7_5"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] R. Barbulescu and S. Duquesne, \u201cUpdating key size estimations for pairings,\u201d J. Cryptology, vol.32, pp.1298-1336, 2019. 10.1007\/s00145-018-9280-5","DOI":"10.1007\/s00145-018-9280-5"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] K. Xagawa, R. Kikuchi, A. Ichikawa, and T. Miura, \u201cStandardization trends on cryptographic algorithms and protocols in ISO\/IEC JTC 1 SC 27 WG 2,\u201d NTT Technical Review, vol.19, no.5, pp.83-87, May 2021. 10.53829\/ntr202105gls","DOI":"10.53829\/ntr202105gls"},{"key":"8","unstructured":"[8] I.O. for Standardization\/International Electrotechnical Commission, \u201cInformation security \u2014 Cryptographic techniques based on elliptic curves \u2014 Part 5: Elliptic curve generation (ISO\/IEC 15946-5),\u201d 2022."},{"key":"9","unstructured":"[9] S. Kikuoka and S. Ikeda, \u201cThe efficiency of safety from a hardware point of view on pairing-based cryptography over BN and BLS12 curve,\u201d The Institute of Electronics, Information and Communication Engineers Society Conference, 2022."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D.F. Aranha, L. Fuentes-Casta\u00f1eda, E. Knapp, A. Menezes, and F. Rodr\u00edguez-Henr\u00edquez, \u201cImplementing pairings at the 192-bit security level,\u201d International Conference on Pairing-Based Cryptography, pp.177-195, 2013. 10.1007\/978-3-642-36334-4_11","DOI":"10.1007\/978-3-642-36334-4_11"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R. Udani and K. Suzuki, \u201cApplication and evaluation of efficient algorithm for computing product of pairings to 256-bit secure pairing-friendly curves,\u201d 2019 International Conference of Advanced Informatics: Concepts, Theory and Applications (ICAICTA), pp.1-6, Sept. 2019. 10.1109\/icaicta.2019.8904197","DOI":"10.1109\/ICAICTA.2019.8904197"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] G.C.C.F. Pereira, M.A. Simpl\u00edcio, M. Naehrig, and P.S.L.M. Barreto, \u201cA family of implementation-friendly bn elliptic curves,\u201d The Journal of Systems and Software, vol.84, no.8, pp.1319-1326, 2011. 10.1016\/j.jss.2011.03.083","DOI":"10.1016\/j.jss.2011.03.083"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] A. Guillevic, S. Masson, and E. Thom\u00e9, \u201cCocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation,\u201d Des. Codes Cryptogr., vol.88, pp.1047-1081, June 2020. 10.1007\/s10623-020-00727-w","DOI":"10.1007\/s10623-020-00727-w"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Y.E. Housni and A. Guillevic, \u201cFamilies of snark-friendly 2-chains of elliptic curves,\u201d Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.367-396, 2022. 10.1007\/978-3-031-07085-3_13","DOI":"10.1007\/978-3-031-07085-3_13"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] A. Guillevic, \u201cA short-list of pairing-friendly curves resistant to special tnfs at the 128-bit security level,\u201d IACR International Conference on Public-Key Cryptography, pp.535-564, 2020. 10.1007\/978-3-030-45388-6_19","DOI":"10.1007\/978-3-030-45388-6_19"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] F. Hess, N.P. Smart, and F. Vercauteren, \u201cThe eta pairing revisited,\u201d IEEE Trans. Inf. Theory, vol.52, no.10, pp.4595-4602, Oct. 2006. 10.1109\/tit.2006.881709","DOI":"10.1109\/TIT.2006.881709"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] N. Benger and M. Scott, \u201cConstructing tower extensions of finite fields for implementation of pairing-based cryptography,\u201d International Workshop on the Arithmetic of Finite Fields, pp.180-195, 2010. 10.1007\/978-3-642-13797-6_13","DOI":"10.1007\/978-3-642-13797-6_13"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] F. Vercauteren, \u201cOptimal pairings,\u201d IEEE Trans. Inf. Theory, vol.56, no.1, pp.455-461, Jan. 2010. 10.1109\/tit.2009.2034881","DOI":"10.1109\/TIT.2009.2034881"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] K. Karabina, \u201cSquaring in cyclotomic subgroups,\u201d Math. Comp., vol.82, pp.555-579, 2013. 10.1090\/s0025-5718-2012-02625-1","DOI":"10.1090\/S0025-5718-2012-02625-1"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] V.S. Miller, \u201cThe weil pairing, and its efficient calculation,\u201d J. Cryptology, vol.17, pp.235-261, Sept. 2004. 10.1007\/s00145-004-0315-8","DOI":"10.1007\/s00145-004-0315-8"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] K. Masada, R. Nakayama, and M. Ikeda, \u201cHardware acceleration of aggregate signature generation and authentication by BLS signature over BLS12-381 curve,\u201d 2022 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS), pp.1-3, 2022. 10.1109\/coolchips54332.2022.9772706","DOI":"10.1109\/COOLCHIPS54332.2022.9772706"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Sugiyama, H. Awano, and M. Ikeda, \u201c31.3\u00b5s\/signature-generation 256-bit \ud835\udd3d<i><sub>p<\/sub><\/i> ecdsa cryptoprocessor,\u201d 2018 IEEE Asian Solid-State Circuits Conference (A-SSCC), pp.153-156, Dec. 2018. 10.1109\/asscc.2018.8579287","DOI":"10.1109\/ASSCC.2018.8579287"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] M. Ikeda, T. Ichihashi, and H. Awano, \u201c33us, 94uJ optimal ate pairing engine on BN curve over 254b prime field in 65nm CMOS fdsoi,\u201d 2019 IEEE Asian Solid-State Circuits Conference, A-SSCC 2019, pp.263-266, Nov. 2019. 10.1109\/a-sscc47793.2019.9056951","DOI":"10.1109\/A-SSCC47793.2019.9056951"},{"key":"24","unstructured":"[24] K. Ikeda and M. Ikeda, \u201cDesign space search for faster Fp256 elliptic curve cryptography,\u201d IEICE Technical Report, vol.119, no.444, pp.209-214, 2020."},{"key":"25","unstructured":"[25] Y. Nagahama, D. Fujimoto, and T. Matsumoto, 2018 Symposium on Cryptography and Information Security (SCIS 2018), 2D4-1, 2018."},{"key":"26","unstructured":"[26] H. Awano, T. Ichihashi, and M. Ikeda, 2018 Symposium on Cryptography and Information Security (SCIS 2018), 2D4-3, 2018."},{"key":"27","unstructured":"[27] T. Nonner, \u201cpyschedule,\u201d 2021."},{"key":"28","unstructured":"[28] B. Gautam, P. Thomas, E.H. Youssef, T. Arya, and G. Gus, \u201cGo library for finite fields, elliptic curves and pairings for zero-knowledge proof systems,\u201d 2022."},{"key":"29","unstructured":"[29] D.F. Aranha, \u201cRelic,\u201d 2020."},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] A. Lavice, N.E. Mrabet, A. Berzati, J.B. Rigaud, and J. Proy, \u201cHardware implementations of pairings at updated security levels,\u201d International Conference on Smart Card Research and Advanced Applications, pp.189-209, 2022. 10.1007\/978-3-030-97348-3_11","DOI":"10.1007\/978-3-030-97348-3_11"},{"key":"31","unstructured":"[31] M. Shigeo, \u201cmcl,\u201d 2021."},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] Y. Dai, Z. Zhou, F. Zhang, and C.A. Zhao, \u201cSoftware implementation of optimal pairings on elliptic curves with odd prime embedding degrees,\u201d IEICE Trans. Fundamentals, vol.E105-A, no.5, pp.858-870, May 2022. 10.1587\/transfun.2021eap1115","DOI":"10.1587\/transfun.2021EAP1115"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/3\/E107.A_2023VLP0009\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T06:12:17Z","timestamp":1730009537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/3\/E107.A_2023VLP0009\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,1]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023vlp0009","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,1]]},"article-number":"2023VLP0009"}}