Finite Extension Field with Modulus of All-One Polynomial and Representation of Its Elements for Fast Arithmetic Operations(Information Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• In many cryptographic applications, a large-order finite field is used as a definition field, and accordingly, many researches on a fast implementation of such a large-order extension field are reported. This paper proposes a definition field F_pm with its characteristic p a pseudo Mersenne number, the modular polynomial f(x) an irreducible all-one polynomial (AOP), and using a suitable basis. In this paper, we refer to this extension field as an all-one polynomial field (AOPF) and to its basis as pseudo polynomial basis (PPB). Among basic arithmetic operations in AOPF, a multiplication between non-zero elements and an inversion of a non-zero element are especially time-consuming. As a fast realization of the former, we propose cyclic vector multiplication algorithm (CVMA), which can be used for possible extension degree m and exploit a symmetric structure of multiplicands in order to reduce the number of operations. Accordingly, CVMA attains a 50% reduction of the number of scalar multiplications as compared to the usually adopted vector multiplication procedure. For fast realization of inversion, we use the Itoh-Tsujii algorithm (ITA) accompanied with Frobenius mapping (FM). Since this paper adopts the PPB, FM can be performed without any calculations. In addition to this feature, ITA over AOPF can be composed with self reciprocal vectors, and by using CVMA this fact can also save computation cost for inversion.

• 社団法人電子情報通信学会の論文
• 2003-09-01

著者

• Morikawa Yoshitaka

  Communication Network Engineering Okayama University

• Nogami Yasuyuki

  Communication Network Engineering Okayama University

• SAITO Akinori

  Communication Network Engineering, Okayama University

• Morikawa Y

  Communication Network Engineering Okayama University

• Saito A

  Keio Univ. Yokohama‐shi Jpn

• Saito Akinori

  Communication Network Engineering Okayama University

• Nogami Yasuyuki

  Communication Network Engineering Natural Science And Technology Okayama University

関連論文

• 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
• Finding a Basis Conversion Matrix via Prime Gauss Period Normal Basis
• A Necessary Condition for Gauss Period Normal Bases to Be the Same Normal Basis
• A Consideration on the Order of Genus 2 Hyperelliptic Curve
• Mixed Bases for Efficient Inversion in F_ and Conversion Matrices of SubBytes of AES
• Rounding Logistic Maps over Integers and the Properties of the Generated Sequences

スポンサーリンク