Sciweavers

Share
4 search results - page 1 / 1
» Evaluating Instruction Set Extensions for Fast Arithmetic on...
Sort
View
ASAP
2004
IEEE
141views Hardware» more  ASAP 2004»
11 years 9 months ago
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
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 ...
A. Murat Fiskiran, Ruby B. Lee
ASAP
2004
IEEE
160views Hardware» more  ASAP 2004»
11 years 9 months ago
Architectural Support for Arithmetic in Optimal Extension Fields
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...
Johann Großschädl, Sandeep S. Kumar, Ch...
PAIRING
2007
Springer
132views Cryptology» more  PAIRING 2007»
11 years 11 months ago
Instruction Set Extensions for Pairing-Based Cryptography
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...
Tobias Vejda, Dan Page, Johann Großschä...
books