Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications
نویسندگان
چکیده
Recently, there has been a lot of interest on cryptographic applications based on fields GF (p), for p > 2. This contribution presents GF (p) multipliers architectures, where p is odd. We present designs which trade area for performance based on the number of coefficients that the multiplier processes at one time. Families of irreducible polynomials are introduced to reduce the complexity of the modulo reduction operation and, thus, improved the efficiency of the multiplier. We, then, specialize to fields GF (3) and provide the first cubing architecture presented in the literature. We synthesize our architectures for the special case of GF (3) on the XCV1000-8-FG1156 and XC2VP20-7-FF1156 FPGAs and provide area/performance numbers and comparisons to previous GF (3) and GF (2) implementations. Finally, we provide tables of irreducible polynomials over GF (3) of degree m with 2 ≤ m ≤ 255.
منابع مشابه
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...
متن کاملEfficient Unified Arithmetic for Hardware Cryptography
The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF (q), where q = p k and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1], the US federal Digital Signature Standard [2], elliptic curve cryptography [3, 4], and also recently identity based cryptography [5, 6]. Most p...
متن کامل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...
متن کاملLow-Power Design of a Functional Unit for Arithmetic in Finite Fields GF(p) and GF(2m)
Recent multi-application smart cards are equipped with powerful 32-bit RISC cores clocked at 33 MHz or even more. They are able to support a variety of public-key cryptosystems, including elliptic curve systems over prime fields GF(p) and binary fields GF(2) of arbitrary order. This flexibility is achieved by implementing the cryptographic primitives in software and taking advantage of dedicate...
متن کامل