117
Voted
ASIACRYPT
15 years 7 months ago
2009 Springer 
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
118
click to vote
ASIACRYPT
15 years 7 months ago
2009 Springer 
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
101
Voted
ASIACRYPT
15 years 7 months ago
2009 Springer
In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 299.5 time and data complex...
130
click to vote
ASIACRYPT
15 years 7 months ago
2009 Springer 
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
104
click to vote
ASIACRYPT
15 years 7 months ago
2009 Springer
Abstract. The security of cascade blockcipher encryption is an important and well-studied problem in theoretical cryptography with practical implications. It is well-known that dou...
|
Cryptology