209 search results - page 30 / 42 » Supersingular Curves in Cryptography |
PAIRING
2007
Springer
14 years 2 months ago
2007
Springer
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
PAIRING
2009
Springer
14 years 2 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 ...
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases...