Cyclic Vector Multiplication Algorithm and Existence Probability of Gauss Period Normal Basis
スポンサーリンク
概要
- 論文の詳細を見る
Recently, pairing-based cryptographic application sch-emes have attracted much attentions. In order to make the schemes more efficient, not only pairing algorithm but also arithmetic operations in extension field need to be efficient. For this purpose, the authors have proposed a series of cyclic vector multiplication algorithms (CVMAs) corresponding to the adopted bases such as type-I optimal normal basis (ONB). Note here that every basis adapted for the conventional CVMAs are just special classes of Gauss period normal bases (GNBs). In general, GNB is characterized with a certain positive integer h in addition to characteristic p and extension degree m, namely type-<h.m> GNB in extension field Fpm. The parameter h needs to satisfy some conditions and such a positive integer h infinitely exists. From the viewpoint of the calculation cost of CVMA, it is preferred to be small. Thus, the minimal one denoted by hmin will be adapted. This paper focuses on two remaining problems: 1) CVMA has not been expanded for general GNBs yet and 2) the minimal hmin sometimes becomes large and it causes an inefficient case. First, this paper expands CVMA for general GNBs. It will improve some critical cases with large hmin reported in the conventional works. After that, this paper shows a theorem that, for a fixed prime number r, other prime numbers modulo r uniformly distribute between 1 to r-1. Then, based on this theorem, the existence probability of type-<hmin,m> GNB in Fpm and also the expected value of hmin are explicitly given.
著者
-
NEKADO Kenta
Graduate School of Natural Science and Technology, Okayama University
-
NOGAMI Yasuyuki
Graduate School of Natural Science and Technology, Okayama University
-
KATO Hidehiro
Graduate School of Natural Science and Technology, Okayama University
-
MORIKAWA Yoshitaka
Graduate School of Natural Science and Technology, Okayama University
関連論文
- Cyclic Vector Multiplication Algorithm and Existence Probability of Gauss Period Normal Basis
- 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
- Minimum Mean Absolute Error Predictors for Lossless Image Coding
- 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
- 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