{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:38:00Z","timestamp":1769751480496,"version":"3.49.0"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Electron."],"published-print":{"date-parts":[[2023,6,1]]},"DOI":"10.1587\/transele.2022lhs0001","type":"journal-article","created":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T06:57:41Z","timestamp":1669705061000},"page":"331-334","source":"Crossref","is-referenced-by-count":3,"title":["High Speed ASIC Architectures for Aggregate Signature over BLS12-381"],"prefix":"10.1587","volume":"E106.C","author":[{"given":"Kaoru","family":"MASADA","sequence":"first","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryohei","family":"NAKAYAMA","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"IKEDA","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] D. Boneh, B. Lynn, and H. Shacham, \u201cShort signatures from the Weil pairing,\u201d Advances in Cryptology \u2014 ASIACRYPT 2001, ed. C. Boyd, Lecture Notes in Computer Science (LNCS), vol.2248, pp.514-532, Springer Berlin Heidelberg, 2001. 10.1007\/3-540-45682-1_30","DOI":"10.1007\/3-540-45682-1_30"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, \u201cAggregate and verifiably encrypted signatures from bilinear maps,\u201d Advances in Cryptology \u2014 EUROCRYPT 2003, ed. E. Biham, Lecture Notes in Computer Science (LNCS), vol.2656, pp.416-432, Springer Berlin Heidelberg, 2003. 10.1007\/3-540-39200-9_26","DOI":"10.1007\/3-540-39200-9_26"},{"key":"3","unstructured":"[3] A. Faz-Hernandez, S. Scott, N. Sullivan, R.S. Wahby, and C.A. Wood, \u201cHashing to elliptic curves,\u201d 2021."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] 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), pp.263-266, 2019. 10.1109\/a-sscc47793.2019.9056951","DOI":"10.1109\/A-SSCC47793.2019.9056951"},{"key":"5","unstructured":"[5] S. Bowe, \u201cBLS12-381: New zk-SNARK elliptic curve construction,\u201d 2017."},{"key":"6","unstructured":"[6] E. Barker, \u201cRecommendation for key management,\u201d NIST Special Publication (SP) 800-57 Part 1, Rev.5, Gaithersburg, MD., National Institute of Standards and Technology, 2020."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] U. Banerjee and A.P. Chandrakasan, \u201cA low-power BLS12-381 pairing cryptoprocessor for internet-of-things security applications,\u201d IEEE Solid-State Circuits Letters, vol.4, pp.190-193, 2021. 10.1109\/lssc.2021.3124074","DOI":"10.1109\/LSSC.2021.3124074"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Y. Zhang, S. Wang, X. Zhang, J. Dong, X. Mao, F. Long, C. Wang, D. Zhou, M. Gao, and G. Sun, \u201cPipeZK: Accelerating zero-knowledge proof with a pipelined architecture,\u201d 2021 ACM\/IEEE 48th Annual International Symposium on Computer Architecture (ISCA), pp.416-428, 2021. 10.1109\/isca52012.2021.00040","DOI":"10.1109\/ISCA52012.2021.00040"},{"key":"9","unstructured":"[9] R. Anzai, J. Sakamoto, Z. Song, N. Yoshida, and T. Matsumoto, \u201cLow-latency hardware implementation of BLS12-381 pairing,\u201d 2022 Symposium on Cryptography and Information Security, 2022."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] R.S. Wahby and D. Boneh, \u201cFast and simple constant-time hashing to the BLS12-381 elliptic curve,\u201d IACR Transactions on Cryptographic Hardware and Embedded Systems, vol.2019, no.4, pp.154-179, Aug. 2019. 10.46586\/tches.v2019.i4.154-179","DOI":"10.46586\/tches.v2019.i4.154-179"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] P.L. Montgomery, \u201cModular multiplication without trial division,\u201d Mathematics of Computation, vol.44, pp.519-521, 1985. 10.1090\/s0025-5718-1985-0777282-x","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] S. Sugiyama, H. Awano, and M. Ikeda, \u201c31.3 \u03bcs\/signature-generation 256-bit \ud835\udd3dp ECDSA cryptoprocessor,\u201d 2018 IEEE Asian Solid-State Circuits Conference (A-SSCC), pp.153-156, 2018. 10.1109\/asscc.2018.8579287","DOI":"10.1109\/ASSCC.2018.8579287"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] B. M\u00f6ller, 2k-Ary Exponentiation, pp.639-640, Springer US, Boston, MA, 2005.","DOI":"10.1007\/0-387-23483-7_445"},{"key":"14","unstructured":"[14] A. Miyaji, Cryptography in algebraic aspects: from basic number theory to implementing elliptic curve cryptography, Nippon Hyoron Sha Co., Ltd., 2012."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] M. Joye and S.-M. Yen, \u201cThe Montgomery powering ladder,\u201d Cryptographic Hardware and Embedded Systems-CHES 2002, ed. B.S. Kaliski, \u00e7.K. Ko\u00e7, and C. Paar, Lecture Notes in Computer Science (LNCS), vol.2523, pp.291-302, Springer Berlin Heidelberg, 2003. 10.1007\/3-540-36400-5_22","DOI":"10.1007\/3-540-36400-5_22"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J. Renes, C. Costello, and L. Batina, \u201cComplete addition formulas for prime order elliptic curves,\u201d Advances in Cryptology-EUROCRYPT 2016, ed. M. Fischlin and J.S. Coron, Lecture Notes in Computer Science (LNCS), vol.9665, pp.403-428, Springer Berlin Heidelberg, 2016. 10.1007\/978-3-662-49890-3_16","DOI":"10.1007\/978-3-662-49890-3_16"},{"key":"17","unstructured":"[17] L. Ghammam and E. Fouotsa, \u201cOn the computation of the optimal ate pairing at the 192-bit security level,\u201d Cryptology ePrint Archive, Ppaper, 2016\/130, 2016."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] C.H. Lim and H.S. Hwang, \u201cFast implementation of elliptic curve arithmetic in GF(<i>p<sup>n<\/sup><\/i>),\u201d Public Key Cryptography, ed. H. Imai and Y. Zheng, Lecture Notes in Computer Science (LNCS), vol.1751, pp.405-421, Springer Berlin Heidelberg, 2000. 10.1007\/978-3-540-46588-1_27","DOI":"10.1007\/978-3-540-46588-1_27"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] G.X. Yao, J. Fan, R.C.C. Cheung, and I. Verbauwhede, \u201cFaster pairing coprocessor architecture,\u201d Pairing-Based Cryptography-Pairing 2012, ed. M. Abdalla and T. Lange, Lecture Notes in Computer Science (LNCS), vol.7708, pp.160-176, Springer Berlin Heidelberg, 2013. 10.1007\/978-3-642-36334-4_10","DOI":"10.1007\/978-3-642-36334-4_10"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] 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 Pairing-Based Cryptography-Pairing 2012, ed. M. Abdalla and T. Lange, Lecture Notes in Computer Science (LNCS), vol.7708, pp.177-195, Springer Berlin Heidelberg, 2013. 10.1007\/978-3-642-36334-4_11","DOI":"10.1007\/978-3-642-36334-4_11"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] J.-L. Beuchat, J.E. Gonz\u00e1lez-D\u00edaz, S. Mitsunari, E. Okamoto, F. Rodr\u00edguez-Henr\u00edquez, and T. Teruya, \u201cHigh-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves,\u201d Pairing-Based Cryptography-Pairing 2010, ed. M. Joye, A. Miyaji, and A. Otsuka, Lecture Notes in Computer Science (LNCS), vol.6487, pp.21-39, Springer Berlin Heidelberg, 2010. 10.1007\/978-3-642-17455-1_2","DOI":"10.1007\/978-3-642-17455-1_2"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] Z. Zhao and G. Bai, \u201cUltra high-speed SM2 ASIC implementation,\u201d 2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications, pp.182-188, 2014. 10.1109\/trustcom.2014.27","DOI":"10.1109\/TrustCom.2014.27"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] K. Karabina, \u201cSquaring in cyclotomic subgroups,\u201d Mathematics of Computation, vol.82, no.281, pp.555-579, 2013. 10.1090\/s0025-5718-2012-02625-1","DOI":"10.1090\/S0025-5718-2012-02625-1"},{"key":"24","unstructured":"[24] S. Mitsunari, \u201cmcl,\u201d 2018."}],"container-title":["IEICE Transactions on Electronics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transele\/E106.C\/6\/E106.C_2022LHS0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T03:27:06Z","timestamp":1685762826000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transele\/E106.C\/6\/E106.C_2022LHS0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,1]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transele.2022lhs0001","relation":{},"ISSN":["0916-8524","1745-1353"],"issn-type":[{"value":"0916-8524","type":"print"},{"value":"1745-1353","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,1]]},"article-number":"2022LHS0001"}}