2967 search results - page 193 / 594 » Cryptology |
175
click to vote
ASIACRYPT
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
192
click to vote
ASIACRYPT
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to ...
157
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n...
187
click to vote
CHES
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We propose a superscalar coprocessor for high-speed curvebased cryptography. It accelerates scalar multiplication by exploiting instruction-level parallelism (ILP) dynami...
179
click to vote
CHES
2006
Springer
15 years 11 months ago
2006
Springer
This paper describes the implementation of the Advanced Encryption Standard Algorithm, Rijndael, in a new nanoscale technology, called CMOL. This technology consists of an array of...