52 search results - page 7 / 11 » Is There a Shortage of Primes for Cryptography |
PAIRING
2007
Springer
14 years 1 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...
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 ...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
A fundamental question in leakage-resilient cryptography is: can leakage resilience always be amplified by parallel repetition? It is natural to expect that if we have a leakage-r...
PKC
2004
Springer
14 years 1 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...