Searching for "Arithmetic Operations in GF(2m)." – sorted by Relevance.
6 documents found, showing 1 through 6.
-
Efficient Software Implementation for Finite Field Multiplication in Normal Basis
- … intensively in the past twenty years. Among various arithmetic operations, GF (2m) multiplication has…
- Cited by 13 (0 self) – Add To MetaCart
-
Efficient VLSI implementation for Montgomery multiplication in GF(2 m
- …. Introduction Recently, finite field arithmetic operations in GF(2 m ) were frequently desired in coding theory…
- Cited by 1 (1 self) – Add To MetaCart
-
Instruction Set Extension for Fast Elliptic Curve Cryptography Over Binary Finite Fields GF(2m)
- … of this section we discuss arithmetic operations in GF(2 m ) by means of polynomial basis representation…
- Cited by 10 (5 self) – Add To MetaCart
-
VLSI Architectures for Multiplication in GF(2^m) for Application Tailored Digital Signal Processors
- … binary arithmetic multiplier with a GF(2 m ) multiplier. Using this approach saves a considerable number…
- Cited by 2 (0 self) – Add To MetaCart
-
Elliptic Curve Scalar Multiplication using Point Halving on Reconfigurable Hardware Platforms
- … basic arithmetic operation in GF (2 m ). Inversion can be avoided by means of projective coordinate…
- Add To MetaCart
-
Fast multiplication on elliptic curves over GF(2m) without precomputation
- …SPARC 300MHz machine. For comparison, we list the timings for the basic arithmetic operations in GF (2 m…
- Cited by 7 (0 self) – Add To MetaCart
Showing 1 through 6.
