Finding a Basis Conversion Matrix via Prime Gauss Period Normal Basis
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes a method to construct a basis conversion matrix between two given bases in Fpm. In the proposed method, Gauss period normal basis (GNB) works as a bridge between the two bases. The proposed method exploits this property and construct a basis conversion matrix mostly faster than EDF-based algorithm on average in polynomial time. Finally, simulation results are reported in which the proposed method compute a basis conversion matrix within 30 msec on average with Celeron (2.00GHz) when m log p ≈ 160.
- （社）電子情報通信学会の論文
- 2009-06-01
著者
-
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
-
NOGAMI Yasuyuki
Okayama University
-
Nogami Yasuyuki
Faculty Of Natural Science And Technology Graduate School Of Okayama University
-
Morikawa Yoshitaka
Okayama Univ. Okayama‐shi Jpn
-
NAMBA Ryo
Communication Network Engineering, Okayama University
-
Namba Ryo
Communication Network Engineering 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