2967 search results - page 173 / 594 » Cryptology |
171
click to vote
ASIACRYPT
2003
Springer
16 years 12 days ago
2003
Springer
We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also...
179
click to vote
ASIACRYPT
2003
Springer
16 years 12 days ago
2003
Springer
In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encr...
156
click to vote
ASIACRYPT
2003
Springer
16 years 12 days ago
2003
Springer
We estimate the yield of the number field sieve factoring algorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17...
153
click to vote
ASIACRYPT
2003
Springer
16 years 12 days ago
2003
Springer
Abstract. Khazad is a new block cipher initially proposed as a candidate to the NESSIE project. Its design is very similar to Rijndael, although it is a 64-bit block cipher. In thi...
191
click to vote
ASIACRYPT
2003
Springer
16 years 12 days ago
2003
Springer
We present a variation of the index calculus attack by Gaudry which can be used to solve the discrete logarithm problem in the Jacobian of hyperelliptic curves. The new algorithm h...