Fast Implementation of Extension Fields with TypeII ONB and Cyclic Vector Multiplication Algorithm(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes an extension field named TypeII AOPF. This extension field adopts TypeII optimal normal basis, cyclic vector multiplication algorithm, and Itoh-Tsujii inversion algorithm. The calculation costs for a multiplication and inversion in this field is clearly given with the extension degree. For example, the arithmetic operations in TypeII AOPF F_<p^5> is about 20% faster than those in OEF F_<p^5>. Then, since CVMA is suitable for parallel processing, we show that TypeII AOPF is superior to AOPF as to parallel processing and then show that a multiplication in TypeII AOPF becomes about twice faster by parallelizing the CVMA computation in TypeII AOPF.
- 社団法人電子情報通信学会の論文
- 2005-05-01
著者
-
Morikawa Yoshitaka
Communication Network Engineering Okayama University
-
Nogami Yasuyuki
Communication Network Engineering Okayama University
-
SHINONAGA Shigeru
Communication Network Engineering, Okayama University
-
Shinonaga Shigeru
Communication Network Engineering Okayama University
-
Nogami Yasuyuki
Faculty Of Natural Science And Technology Graduate School Of Okayama University
-
Morikawa Yoshitaka
Okayama Univ. Okayama‐shi Jpn
-
Nogami Yasuyuki
Communication Network Engineering Natural Science And Technology Okayama University
関連論文
- 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
- 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
- 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