Results 1  10
of
15
A New Finite Field Multiplier Using Redundant Representation
 IEEE Trans. Computers
, 2008
"... ..."
Software Multiplication Using Gaussian Normal Bases
 IEEE Transactions on Computers
, 2006
"... ..."
Efficient algorithms and architectures for field multiplication using Gaussian normal bases
 IEEE Trans. Computers
, 2006
"... ..."
Efficient multiplication using type 2 optimal normal bases
"... Abstract. In this paper we propose a new structure for multiplication using optimal normal bases of type 2. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of Fqn to suitable polynomials of degree at most n over Fq. These polynomials ar ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. In this paper we propose a new structure for multiplication using optimal normal bases of type 2. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of Fqn to suitable polynomials of degree at most n over Fq. These polynomials are multiplied using any method which is suitable for the implementation platform, then the product is converted back to the normal basis using the inverse of the above transformation. The efficiency of the transformation arises from a special factorization of its matrix into sparse matrices. This factorization — which resembles the FFT factorization of the DFT matrix — allows to compute the transformation and its inverse using O(n log n) operations in Fq, rather than O(n 2) operations needed for a general change of basis. Using this technique we can reduce the asymptotic cost of multiplication in optimal normal bases of type 2 from 2M(n) + O(n) reported by Gao et al. (2000) to M(n) + O(n log n) operations in Fq, where M(n) is the number of Fqoperations to multiply two polynomials of degree n − 1 over Fq. We show that this cost is also smaller than other proposed multipliers for n> 160, values which are used in elliptic curve cryptography.
Software multiplication using normal bases
 Dept. of Combinatorics and Optimization, Univ. of
, 2004
"... Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over the NIST recommended binary fields. In this paper we present new software algorithms for efficient multiplication over the binary fie ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over the NIST recommended binary fields. In this paper we present new software algorithms for efficient multiplication over the binary field F2m that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multiplication, and a method that exploits a mapping to a ring where fast polynomialbased techniques can be employed. Our analysis including experimental results on an Intel Pentium family processor shows that the new algorithms are faster and can use memory more efficiently than previous methods. Despite significant improvements, we conclude that the penalty in multiplication is still sufficiently large to discourage the use of normal bases in software implementations of elliptic curve systems. Key words Multiplication in F2 m, normal basis, Gaussian normal basis, elliptic curve cryptography. 1
M.(2008) ‘A High Speed Word Level Finite Field Multiplier Using Reordered Normal Basis
 Proc. IEEE Int’l Symp. Circuit and Systems (ISCAS
"... Abstract — Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered normal basis is presented. Proposed architecture has a very regular structure which makes it suitable for VLSI impl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered normal basis is presented. Proposed architecture has a very regular structure which makes it suitable for VLSI implementation. Architectural complexity comparison shows that the new architecture has smaller critical path delay compared to other word level multipliers available in open literature at the cost of having moderately higher area complexity. The new architecture out performs all other similar proposals considering the product of area and delay as a measure of performance. I.
Elliptic periods for finite fields ∗
, 2008
"... We construct two new families of basis for finite field extensions. Bases in the first family, the socalled elliptic bases, are not quite normal bases, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Bases in the second family, the socalled normal ..."
Abstract
 Add to MetaCart
We construct two new families of basis for finite field extensions. Bases in the first family, the socalled elliptic bases, are not quite normal bases, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Bases in the second family, the socalled normal elliptic bases are normal bases and allow fast (quasilinear) arithmetic. We prove that all extensions admit models of this kind. 1
Fast Encoding and Decoding of Gabidulin Codes
, 901
"... Abstract—Gabidulin codes are the rankmetric analogs of ReedSolomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding algorithms for Gabidulin codes based on lowcomplexity normal bases. In addition, a new decoding algorithm is p ..."
Abstract
 Add to MetaCart
Abstract—Gabidulin codes are the rankmetric analogs of ReedSolomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding algorithms for Gabidulin codes based on lowcomplexity normal bases. In addition, a new decoding algorithm is proposed based on a transformdomain approach. Together, these represent the fastest known algorithms for encoding and decoding Gabidulin codes. I.