Sciweavers

190 search results - page 21 / 38
» Supersingular Elliptic Curves in Cryptography
Sort
View
CODES
2003
IEEE
15 years 5 months ago
Design space exploration of a hardware-software co-designed GF(2m) galois field processor for forward error correction and crypt
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...
Wei Ming Lim, Mohammed Benaissa
90
Voted
IJNSEC
2006
71views more  IJNSEC 2006»
14 years 11 months ago
Joint Sparse Form of Window Three for Koblitz Curve
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...
Yong Ding, Kwok-Wo Wong, Yu-Min Wang
EUROCRYPT
1999
Springer
15 years 4 months ago
On the Performance of Hyperelliptic Cryptosystems
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
Nigel P. Smart
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
15 years 6 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
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 ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...
CTRSA
2005
Springer
78views Cryptology» more  CTRSA 2005»
15 years 5 months ago
New Minimal Weight Representations for Left-to-Right Window Methods
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−...
James A. Muir, Douglas R. Stinson