76 search results - page 8 / 16 » Pipelining GF(P) Elliptic Curve Cryptography Computation |
ASAP
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper proposes different low-cost coprocessors for public key authentication on 8-bit smart cards. Elliptic curve cryptography is used for its efficiency per bit of key and ...
IJNSEC
2006
14 years 10 months ago
2006
The joint sparse form (JSF) for the non-adjacent form (NAF) representation of two large integers a and b, was proposed by Solinas. Then Ciet extended it to the -JSF for the -NAF r...
104
Voted
CODES
2003
IEEE
15 years 3 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...
PAIRING
2009
Springer
15 years 4 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
103
click to vote
CTRSA
2005
Springer
15 years 3 months ago
2005
Springer
For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2w−...