4 search results - page 1 / 1 » Evaluating Instruction Set Extensions for Fast Arithmetic on... |
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 ...
CHES
2004
Springer
13 years 10 months ago
2004
Springer
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...
PAIRING
2007
Springer
13 years 11 months ago
2007
Springer
A series of recent algorithmic advances has delivered highly effective methods for pairing evaluation and parameter generation. However, the resulting multitude of options means m...