Results 1  10
of
20
Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2 m)
 IEEE TRANSACTIONS ON COMPUTERS
, 2004
"... Representing the field elements with respect to the polynomial (or standard) basis, we consider bit parallel architectures for multiplication over the finite field GFð2 m Þ. In this effect, first we derive a new formulation for polynomial basis multiplication in terms of the reduction matrix Q. The ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
(Show Context)
Representing the field elements with respect to the polynomial (or standard) basis, we consider bit parallel architectures for multiplication over the finite field GFð2 m Þ. In this effect, first we derive a new formulation for polynomial basis multiplication in terms of the reduction matrix Q. The main advantage of this new formulation is that it can be used with any field defining irreducible polynomial. Using this formulation, we then develop a generalized architecture for the multiplier and analyze the time and gate complexities of the proposed multiplier as a function of degree m and the reduction matrix Q. To the best of our knowledge, this is the first time that these complexities are given in terms of Q. Unlike most other articles on bit parallel finite field multipliers, here we also consider the number of signals to be routed in hardware implementation and we show that, compared to the wellknown Mastrovito’s multiplier, the proposed architecture has fewer routed signals. In this article, the proposed generalized architecture is further optimized for three special types of polynomials, namely, equally spaced polynomials, trinomials, and pentanomials. We have obtained explicit formulas and complexities of the multipliers for these three special irreducible polynomials. This makes it very easy for a designer to implement the proposed multipliers using hardware description languages like VHDL and Verilog with minimum knowledge of finite field arithmetic.
Customizable elliptic curve cryptosystems
 IEEE Transactions on Very Large Scale Integration (VLSI) Systems
, 2005
"... Abstract—This paper presents a method for producing hardware designs for elliptic curve cryptography (ECC) systems over the finite field qp@P A, using the optimal normal basis for the representation of numbers. Our field multiplier design is based on a parallel architecture containing multiplebit s ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(Show Context)
Abstract—This paper presents a method for producing hardware designs for elliptic curve cryptography (ECC) systems over the finite field qp@P A, using the optimal normal basis for the representation of numbers. Our field multiplier design is based on a parallel architecture containing multiplebit serial multipliers; by changing the number of such serial multipliers, designers can obtain implementations with different tradeoffs in speed, size and level of security. A design generator has been developed which can automatically produce a customised ECC hardware design that meets userdefined requirements. To facilitate performance characterization, we have developed a parametric model for estimating the number of cycles for our generic ECC architecture. The resulting hardware implementations are among the fastest reported: for a key size of 270 bits, a point multiplication in a Xilinx XC2V6000 FPGA at 35 MHz can run over 1000 times faster
Parallel Montgomery Multiplication in GF(2 k ) Using Trinomial Residue Arithmetic
 In 17th IEEE Symposium on Computer Arithmetic (ARITH05
, 2005
"... We propose the first general multiplication algorithm in GF(2 k) with a subquadratic area complexity of O(k 8/5) = O(k 1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2 k); i.e. the polynomials in GF(2)[X] of degree at most k − 1, by their remainder modulo a set of n pair ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
We propose the first general multiplication algorithm in GF(2 k) with a subquadratic area complexity of O(k 8/5) = O(k 1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2 k); i.e. the polynomials in GF(2)[X] of degree at most k − 1, by their remainder modulo a set of n pairwise prime trinomials, T1,..., Tn, of degree d and such that nd ≥ k. Our algorithm is based on Montgomery’s multiplication applied to the ring formed by the direct product of the trinomials.
1 Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication based on Toeplitz MatrixVector Product
"... In this paper, we present a new method for parallel binary finite field multiplication which results in subquadratic space complexity. The method is based on decomposing the building blocks of FanHasan subquadratic Toeplitz matrixvector multiplier. We reduce the space complexity of their architect ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we present a new method for parallel binary finite field multiplication which results in subquadratic space complexity. The method is based on decomposing the building blocks of FanHasan subquadratic Toeplitz matrixvector multiplier. We reduce the space complexity of their architecture by recombining the building blocks. In comparison to other similar schemes available in the literature, our proposal presents a better space complexity while having the same time complexity. We also show that block recombination can be used for efficient implementation of the GHASH function of Galois Counter Mode (GCM).
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
 PROC. INT. CONF. APPLICATIONSPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS (ASAP
, 2004
"... Binary finite fields GF(2^n) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On wordoriented programmable processors, field elements are generally represented as polynomials with coefficients from {0, 1}. Key arithmetic operati ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Binary finite fields GF(2^n) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On wordoriented programmable processors, field elements are generally represented as polynomials with coefficients from {0, 1}. Key arithmetic operations on these polynomials, such as squaring and multiplication, are not supported by integeroriented processor architectures. Instead, these are implemented in software, causing a very large fraction of the cryptography execution time to be dominated by a few elementary operations. For example, more than 90% of the execution time of 163bit ECC may be consumed by two simple field operations: squaring and multiplication. A few
Quadrinomial Modular Arithmetic Using Modified Polynomial Basis
 In Proceedings of the International Conference on Information Technology: Coding and Computing ( ITCC’2005
, 2005
"... Finite field arithmetic has advantageous space and time complexity when the field is built with a sparse polynomial. Katti and Brennan in their paper [3] introduced a new type of polynomial, wich we will call here the Nearly All One Polynomial (NAOP), and they show that the NAOP modular arithmetic i ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Finite field arithmetic has advantageous space and time complexity when the field is built with a sparse polynomial. Katti and Brennan in their paper [3] introduced a new type of polynomial, wich we will call here the Nearly All One Polynomial (NAOP), and they show that the NAOP modular arithmetic is roughly equivalent to quadrinomial arithmetic. In this paper we will introduce a new representation: the modified polynomial basis, to compute modulo quadrinomials. We obtain a faster bitparallel multiplier in F2n with time complexity equal to TA + (2 + ⌈log2(n + 1)⌉)TX and a time complexity equal to (n + 1) 2 AND and ((n + 1) 2 + m − k − 1) XOR. For fields F2n of degree n ranging between 160 and 500, which cannot be constructed with an irreducible trinomial or an optimal normal basis, our multiplier improve the time complexity by a factor of 8 % the previous multipliers proposed of [6, 3, 8], in compensation the space complexity increase by a factor
Fault detection architectures for field multiplication using polynomial bases
 Issue on Fault Diagnosis and Tolerance in Cryptography
, 2006
"... ..."
Parallel Montgomery Multiplication in GF(2^k) using Trinomial Residue Arithmetic
 Proceedings 17th IEEE Symposium on computer Arithmetic
, 2005
"... Abstract We propose the first general multiplication algorithm in GF(2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2k); i.e. the polynomials in GF(2)[X] of degree at most k 1, by their remainder modulo a set of n ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract We propose the first general multiplication algorithm in GF(2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2k); i.e. the polynomials in GF(2)[X] of degree at most k 1, by their remainder modulo a set of n pairwise prime trinomials, T1,..., Tn, of degree d and such that nd> = k. Our algorithm is based on Montgomery's multiplication applied to the ring formed by the direct product of the trinomials.
Systolic and nonsystolic scalable modular designs of finite field multipliers for ReedSolomon Codec
 in Proc. Int. Conf. Cryptol. India, 2001
, 2009
"... Abstract—In this paper, we present efficient algorithms for modular reduction to derive novel systolic and nonsystolic architectures for polynomial basis finite field multipliers over GF (2m) to be used in ReedSolomon codec. Using the proposed algorithm for unit degree reduction and optimization ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we present efficient algorithms for modular reduction to derive novel systolic and nonsystolic architectures for polynomial basis finite field multipliers over GF (2m) to be used in ReedSolomon codec. Using the proposed algorithm for unit degree reduction and optimization of implementation of the logic functions in the processing elements (PE), we have derived an efficient bitparallel systolic design for finite field multiplier which involves nearly twothird of the areacomplexity of the existing design having the same timecomplexity. The proposed modular reduction algorithms are also used to derive efficient nonsystolic serial/parallel designs of field multipliers over GF (28) with different digitsizes, where the critical path and the hardwarecomplexity are further reduced by optimizing the implementation of modular reduction operations and finite field accumulations. The proposed bitserial design involves nearly 55 % of the minimum of area, and half the minimum of areatime complexity of the existing bitserial designs. Similarly, the proposed digitserial/parallel designs involve significantly less area, and less areatime complexities compared with the existing designs of the same digitsize. By parallel modular reduction through multiple degrees followed by appropriate logiclevel subexpression sharing; a hardwareefficient regular and modular form of a balancedtree bitparallel nonsystolic multiplier is also derived. The proposed bitparallel nonsystolic pipelined design involves less than 65 % of the area and nearly twothird of the areatime complexity of the existing bitparallel design for a ReedSolomon codec, while the nonpipelined form offers nearly 25 % saving of area with less timecomplexity. Index Terms—Finite field, Galois field, finite field multiplication, ReedSolomon codec, errorcontrolcoding, systolic array, very large scale integration (VLSI).
The Parity of the Number of Irreducible Factors for Some Pentanomials
, 2008
"... It is well known that StickelbergerSwan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials, tetran ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
It is well known that StickelbergerSwan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials, tetranomials, selfreciprocal polynomials and so on. We discuss this problem