Journal ArticleDOI
A new architecture for a parallel finite field multiplier with low complexity based on composite fields
Reads0
Chats0
TLDR
A bit parallel structure for a multiplier withLow complexity in Galois fields is introduced and a complete set of primitive field polynomials for composite fields is provided which perform module reduction with low complexity.Abstract:
A bit parallel structure for a multiplier with low complexity in Galois fields is introduced. The multiplier operates over composite fields GF((2/sup n/)/sup m/), with k=nm. The Karatsuba-Ofman algorithm (A. Karatsuba and Y. Ofmanis, 1963) is investigated and applied to the multiplication of polynomials over GF(2/sup n/). It is shown that this operation has a complexity of order O(k/sup log23/) under certain constraints regarding k. A complete set of primitive field polynomials for composite fields is provided which perform module reduction with low complexity. As a result, multipliers for fields GF(2/sup k/) up to k=32 with low gate counts and low delays are listed. The architectures are highly modular and thus well suited for VLSI implementation.read more
Citations
More filters
Book ChapterDOI
A Compact Rijndael Hardware Architecture with S-Box Optimization
TL;DR: Compact and high-speed hardware architectures and logic optimization methods for the AES algorithm Rijndael are described, including a new composite field and the S-Box structure is also optimized.
Journal ArticleDOI
Mastrovito multiplier for all trinomials
Berk Sunar,Çetin Kaya Koç +1 more
TL;DR: An architecture based on a new formulation of the multiplication matrix is described and it is shown that the Mastrovito multiplier for the generating trinomial x/sup m/+x/sup n/+1, where m/spl ne/2n, also requires m/sup 2/-1 XOR and m/Sup 2/ AND gates.
Book ChapterDOI
Efficient Algorithms for Elliptic Curve Cryptosystems
Jorge Guajardo,Christof Paar +1 more
TL;DR: An entirely new approach which accelerates the multiplications of points which is the core operation in elliptic curve public-key systems and which proofs to be faster than traditional point multiplication methods is described.
Book
Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems
TL;DR: The author's research focused on the development of a number representation system that allowed for the addition and subtraction of numbers up to and including the number of bits in a discrete-time system.
Journal ArticleDOI
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
Haining Fan,M.A. Hasan +1 more
TL;DR: This work presents a new scheme for subquadratic space complexity parallel multiplication in GF(2n) using the shifted polynomial basis using the Toeplitz matrix-vector products and coordinate transformation techniques, and to the best of the authors' knowledge, this is the first time that sub quadraticspace complexity parallel multipliers are proposed for dual, weakly dual, and triangular bases.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book
Theory and practice of error control codes
TL;DR: To understand the theoretical framework upon which error-control codes are built and then Algebraic Codes for Data Transmission by Richard E. Blahut, needed, several examples to illustrate the performance of the approximation scheme in practice are needed.
Journal Article
Multiplication of Multidigit Numbers on Automata
Anatoly A. Karatsuba,Yu. Ofman +1 more
Book ChapterDOI
Discrete logarithms in finite fields and their cryptographic significance
TL;DR: This paper surveys and analyzes known algorithms in this area, with special attention devoted to algorithms for the fields GF(2n), finding that in order to be safe from attacks using these algorithms, the value of n for which GF( 2n) is used in a cryptosystem has to be very large and carefully chosen.
Journal ArticleDOI
VLSI Architectures for Computing Multiplications and Inverses in GF(2 m )
TL;DR: In this article, a pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m) with the simple squaring property of the normal basis representation used together with this multiplier.