Scalar Multiplication Using Frobenius Expansion over Twisted Elliptic Curve for Ate Pairing Based Cryptography
スポンサーリンク
概要
- 論文の詳細を見る
For ID-based cryptography, not only pairing but also scalar multiplication must be efficiently computable. In this paper, we propose a scalar multiplication method on the circumstances that we work at Ate pairing with Barreto-Naehrig (BN) curve. Note that the parameters of BN curve are given by a certain integer, namely mother parameter. Adhering the authors previous policy that we execute scalar multiplication on subfield-twisted curve $\\tilde{E} (\\boldsymbol{F}_{p^2}$) instead of doing on the original curve $E(\\boldsymbol{F}_{p^{12}}$), we at first show sextic twisted subfield Frobenius mapping (ST-SFM) $\\tilde{\\varphi}$ in $\\tilde{E} (\\boldsymbol{F}_{p^2})$. On BN curves, note $\\tilde{\\varphi}$ is identified with the scalar multiplication by p. However a scalar is always smaller than the order r of BN curve for Ate pairing, so ST-SFM does not directly applicable to the above circumstances. We then exploit the expressions of the curve order r and the characteristic p by the mother parameter to derive some radices such that they are expressed as a polynomial of p. Thus, a scalar multiplication [s] can be written by the series of ST-SFMs $\\tilde{\\varphi}$. In combination with the binary method or multi-exponentiation technique, this paper shows that the proposed method runs about twice or more faster than plain binary method.
- (社)電子情報通信学会の論文
- 2009-01-01
著者
-
NEKADO Kenta
Graduate School of Natural Science and Technology, Okayama University
-
NOGAMI Yasuyuki
Graduate School of Natural Science and Technology, Okayama University
-
Morikawa Yoshitaka
Faculty Of Engineering Okayama University
-
Morikawa Yoshitaka
Communication Network Engineering Okayama University
-
Nogami Yasuyuki
Communication Network Engineering Okayama University
-
Nogami Yasuyuki
Faculty Of Engineering Okayama University
-
Nekado Kenta
Communication Network Engineering Natural Science And Technology Okayama University
-
SAKEMI Yumi
Communication Network Engineering, Natural Science and Technology, Okayama University
-
OKIMOTO Takumi
Communication Network Engineering, Natural Science and Technology, Okayama University
-
AKANE Masataka
Communication Network Engineering, Natural Science and Technology, Okayama University
-
NOGAMI Yasuyuki
Okayama University
-
SAKEMI Yumi
Okayama University
-
Nogami Yasuyuki
Faculty Of Natural Science And Technology Graduate School Of Okayama University
-
Morikawa Yoshitaka
Okayama Univ. Okayama‐shi Jpn
-
Sakemi Yumi
Communication Network Engineering Natural Science And Technology Okayama University
-
Okimoto Takumi
Communication Network Engineering Natural Science And Technology Okayama University
-
Akane Masataka
Communication Network Engineering Natural Science And Technology Okayama University
-
Nogami Yasuyuki
Graduate School Of Natural Science And Technology Okayama University
-
Nogami Yasuyuki
Communication Network Engineering Natural Science And Technology Okayama University
関連論文
- Cyclic Vector Multiplication Algorithm and Existence Probability of Gauss Period Normal Basis
- An IIR Ramp Filter for Filtered Backprojection Reconstruction of X-ray CT
- Fast Implementation of Extension Fields with TypeII ONB and Cyclic Vector Multiplication Algorithm(Discrete Mathematics and Its Applications)
- Finite Extension Field with Modulus of All-One Polynomial and Representation of Its Elements for Fast Arithmetic Operations(Information Theory)
- Scalar Multiplication Using Frobenius Expansion over Twisted Elliptic Curve for Ate Pairing Based Cryptography
- Integer Variable x-Based Cross Twisted Ate Pairing and Its Optimization for Barreto-Naehrig Curve
- A Multiplication Algorithm in F_ Such That p > m with a Special Class of Gauss Period Normal Bases
- Zero Correlation Distribution of ZCZ Sequences Obtained from a Perfect Sequence and a Unitary Matrix
- Finding a Basis Conversion Matrix via Prime Gauss Period Normal Basis
- Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield-Twisted Elliptic Curve
- A Necessary Condition for Gauss Period Normal Bases to Be the Same Normal Basis
- A Consideration on the Order of Genus 2 Hyperelliptic Curve
- An Efficient Square Root Computation in Finite Fields GF(p^)(Cryptography and Information Security, Information Theory and Its Applications)
- Cyclic Vector Multiplication Algorithm and Existence Probability of Gauss Period Normal Basis
- Mixed Bases for Efficient Inversion in F_ and Conversion Matrices of SubBytes of AES
- An Improvement of Twisted Ate Pairing Efficient for Multi-Pairing and Thread Computing
- Rounding Logistic Maps over Integers and the Properties of the Generated Sequences
- Detailed Cost Estimation of CNTW Forgery Attack against EMV Signature Scheme