242 search results - page 14 / 49 » Randomness in Cryptography |
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
64
Voted
CRYPTO
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
CHES
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The recent development of side channel attacks has lead implementers to use increasingly sophisticated countermeasures in critical operations such as modular exponentiati...
JOC
2011
14 years 14 days ago
2011
Physical random number generators (a.k.a. TRNGs) appear to be critical components of many cryptographic systems. Yet, such building blocks are still too seldom provided with a form...
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...