DocumentCode :
1474120
Title :
Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
Author :
Nogami, Yasuyuki ; Kato, Hidehiro ; Nekado, Kenta ; Uehara, Satoshi ; Morikawa, Yoshitaka
Author_Institution :
Dept. of Commun. Network Eng., Okayama Univ., Okayama, Japan
Volume :
58
Issue :
7
fYear :
2012
fDate :
7/1/2012 12:00:00 AM
Firstpage :
4936
Lastpage :
4947
Abstract :
Several methods for finding a basis conversion matrix between two different bases in an extension field have been proposed. Among them, the one based on Gauss period normal basis (GNB) is on average the most efficient. However, since it needs to construct a certain tower field , some inefficient cases in which the towering degree becomes large have been reported. This paper first determines that such inefficient cases are caused by the GNB condition. In order to overcome this inefficiency, we propose a method that does not use any GNB in the target extension field , but instead uses a certain polynomial basis in derived by a certain small cyclic group in . This causes re- laxation of the condition for the towering degree . In addition, our experimental results show that the proposed method substantially accelerates the computation time for finding a basis conversion matrix.
Keywords :
matrix multiplication; polynomial matrices; public key cryptography; GNB condition; Gauss period normal basis; basis conversion matrix; polynomial basis; public key cryptography; small multiplicative cyclic group; target extension field; tower field; towering degree; Cryptography; Gaussian processes; Generators; Manganese; Poles and towers; Polynomials; Vectors; Basis conversion; Gauss period normal basis (GNB); extension field; public key cryptography;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2012.2191477
Filename :
6172234
Link To Document :
بازگشت