4340 search results - page 196 / 868 » Formal Methods and Cryptography |
149
click to vote
SACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
113
click to vote
ARITH
2007
IEEE
15 years 11 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
136
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effecti...
143
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
116
click to vote
PAIRING
2007
Springer
15 years 10 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...