156 search results - page 1 / 32 » Architectural Support for Arithmetic in Optimal Extension Fi... |
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...
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 ...
MASCOTS
2008
13 years 6 months ago
2008
Galois field implementations are central to the design of many reliable and secure systems, with many systems implementing them in software. The two most common Galois field opera...
AFRICACRYPT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
DAC
1998
ACM
13 years 8 months ago
1998
ACM
Carry-save-adder CSA is the most often used type of operation in implementing a fast computation of arithmetics of register-transfer level design in industry. This paper establis...