4 search results - page 1 / 1 » Instruction Set Extensions for Fast Arithmetic in Finite Fie... |
CHES
2004
Springer
13 years 10 months ago
2004
Springer
CODES
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper describes a hardware-software co-design approach for flexible programmable Galois Field Processing for applications which require operations over GF(2m ), such as RS an...
ASAP
2004
IEEE
13 years 8 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
ASAP
2004
IEEE
13 years 8 months ago
2004
IEEE
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...