67 search results - page 9 / 14 » rsa 2010 |
CRYPTO
2010
Springer
14 years 6 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
100
click to vote
RSA
2010
14 years 7 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
RSA
2010
14 years 7 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
84
Voted
INFORMATICALT
2010
14 years 6 months ago
2010
Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptograp...
183
click to vote
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diffie and H...