3 search results - page 1 / 1 » An Algorithm for Inversion in GF(2^m) Suitable for Implement... |
ARITH
2007
IEEE
13 years 9 months ago
2007
IEEE
An algorithm for inversion in GF(2m ) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid's algorithm...
CHES
2000
Springer
13 years 9 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
TC
2008
13 years 5 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...