![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
A Novel Arithmetic Unit over GF(2 m ) for Low Cost Cryptographic Applications
We present a novel VLSI architecture for division and multiplication in GF(2 m ), aimed at applications in low cost elliptic curve cryptographic processors. A compact and fast ar...
-
Chapter and Conference Paper
A New Digit-Serial Systolic Mulitplier for High Performance GF(2 m ) Applications
This paper presents a new digit-serial systolic multiplier over GF(2 m ) for cryptographic applications. The proposed array is based on the most significant digit first (MSD-firs...
-
Chapter and Conference Paper
Fast Irreducibility Testing for XTR Using a Gaussian Normal Basis of Low Complexity
XTR appeared in 2000 is a very promising alternative to elliptic curve cryptosystem. Though the basic idea behind XTR is very elegant and universal, one needs to restrict the primes p such as p ≡ 2 mod3 for optim...
-
Chapter and Conference Paper
Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic
We present an efficient exponentiation algorithm in a finite field GF(q n ) using a Gauss period of type (n,1). Though the Gauss period α of type (n,1) i...
-
Chapter and Conference Paper
A Compact and Fast Division Architecture for a Finite Field GF(2m)
Division over a finite field GF(2m) is the most time and area consuming operation. In this paper, A new division architecture for GF(2m) using the standard basis representation is proposed. Based on a modified ve...