![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2 m ) for High Speed Cryptographic Processors
Many of the cryptographic schemes over small characteristic finite fields are efficiently implemented by using a trinomial basis. In this paper, we present new linear systolic arrays for multiplication in GF(2 ...
-
Chapter and Conference Paper
A New Systolic Array for Least Significant Digit First Multiplication in GF(2 m )
This paper presents a new digit-serial systolic multiplier over GF(2 m ) for cryptographic applications. When input data come in continuously, the proposed array produces multipl...
-
Chapter and Conference Paper
A Linear Systolic Array for Multiplication in GF(2 m ) for High Speed Cryptographic Processors
We present new designs of low complexity and low latency systolic arrays for multiplication in GF(2 m ) when there is an irreducible all one polynomial (AOP) of degree m. Our pro...
-
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...