Visible to the public A Consideration of an Efficient Arithmetic Over the Extension Field of Degree 3 for Elliptic Curve Pairing Cryptography

TitleA Consideration of an Efficient Arithmetic Over the Extension Field of Degree 3 for Elliptic Curve Pairing Cryptography
Publication TypeConference Paper
Year of Publication2018
AuthorsLi, X., Kodera, Y., Uetake, Y., Kusaka, T., Nogami, Y.
Conference Name2018 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)
KeywordsConferences, cryptography, cubic extension, Cyclic Vector Multiplication Algorithm, Elliptic curve cryptography, elliptic curve pairing cryptography, Elliptic curves, finite element analysis, Gaussian processes, Metrics, Proposals, pubcrawl, public key cryptography, Random access memory, Resiliency, Scalability, Vectors
AbstractThis paper presents an efficient arithmetic in extension field based on Cyclic Vector Multiplication Algorithm that reduces calculation costs over cubic extension for elliptic curve pairing cryptography. In addition, we evaluate the calculation costs compared to Karatsuba-based method.
DOI10.1109/ICCE-China.2018.8448573
Citation Keyli_consideration_2018