RTL Implementations of GF ( 2 ) and GF ( 4 ) Arithmetic Components
نویسندگان
چکیده
Logic design for security application requires the use of specific encoding and higher radix elements thus implying an additional level of abstraction – a component level which is subsequently mapped into a gate level netlist. Implementation of particular components can be made in different ways, however RTL-based design of the multi-valued logic components is of more practical interest as it better integrates to the conventional EDA flow. This report presents possible implementations of Galois Field arithmetic components using typical library cells and the estimation of their physical characteristics for AMS C35 (0.35µm) library. The proposed component design is suggested to be used in further research of multi-valued logic synthesis for security applications, particularly in mixed radix Reed-Muller expansions.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملEfficient Software Implementations of Large Finite Fields GF (2) for Secure Storage Applications
Finite fields are widely used in constructing error-correcting codes and cryptographic algorithms. In practice, error-correcting codes use small finite fields to achieve high-throughput encoding and decoding. Conversely, cryptographic systems employ considerably larger finite fields to achieve high levels of security. We focus on developing efficient software implementations of arithmetic opera...
متن کاملScalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)
Computing the inverse of a number in finite fields GF(p) or GF(2) is equally important for cryptographic applications. This paper proposes a novel scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2) fields. We adjust and modify a GF(2) Montgomery inverse algorithm to accommodate multi-bit shifting hardware, making it very similar to a previo...
متن کاملFast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
This contribution describes a new class of arithmetic architectures for Galois fields GF (2k). The main applications of the architecture are public-key systems which are based on the discrete logarithm problem for elliptic curves. The architectures use a representation of the field GF (2k) as GF ((2n)m), where k = n · m. The approach explores bit parallel arithmetic in the subfield GF (2n), and...
متن کاملHighly Efficient GF(28) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design
This paper proposes a compact and efficient GF (2) inversion circuit design based on a combination of non-redundant and redundant Galois Field (GF) arithmetic. The proposed design utilizes redundant GF representations, called Polynomial Ring Representation (PRR) and Redundantly Represented Basis (RRB), to implement GF (2) inversion using a tower field GF ((2)). In addition to the redundant repr...
متن کامل