Sciweavers

CRYPTO
1994
Springer
128views Cryptology» more  CRYPTO 1994»
13 years 8 months ago
Linear Cryptanalysis Using Multiple Approximations
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limit...
Burton S. Kaliski Jr., Matthew J. B. Robshaw
IWSEC
2007
Springer
13 years 10 months ago
Run-Time Randomization to Mitigate Tampering
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
Bertrand Anckaert, Mariusz H. Jakubowski, Ramarath...
DCC
2008
IEEE
14 years 3 months ago
Semantic security for the McEliece cryptosystem without random oracles
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill M...