Book ChapterDOI
On Probable Security for Conventional Cryptography
Serge Vaudenay
- Vol. 1787, pp 1-16
TLDR
Handy tools based on Decorrelation Theory for dealing with decorrelation theory results are provided and it is shown how to make their proof easier.Abstract:
Many previous results on the provable security of conventional cryptography have been published so far. We provide here handy tools based on Decorrelation Theory for dealing with them and we show how to make their proof easier. As an illustration we survey a few of these results and we (im)prove some by our technique.read more
Citations
More filters
Book ChapterDOI
Indistinguishability of Random Systems
TL;DR: A general framework for proving the indistinguishability of two random systems is proposed, based on the concept of the equivalence of two systems, conditioned on certain events, and an efficient construction of a quasi-random function is given which can be used as a building block in cryptographic systems based on pseudorandom functions.
Journal ArticleDOI
Decorrelation: A Theory for Block Cipher Security
TL;DR: This paper proposes convenient tools in order to study Pseudorandomness in connection with the Shannon Theory, the Carter–Wegman universal hash functions paradigm, and the Luby–Rackoff approach, which enables the construction of new ciphers with security proofs under specific models.
Journal Article
Indistinguishability of random systems
TL;DR: In this article, a general framework for proving the indistinguishability of two random systems, based on the concept of equivalence of two systems, conditioned on certain events, is proposed.
Book ChapterDOI
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
Shiho Moriai,Serge Vaudenay +1 more
TL;DR: This work compares the randomness provided by the schemes used by the AES candidates and provides a general paradigm for analyzing the security provided bythe interaction between the different levels of the block cipher structure.
Journal Article
Information-theoretic cryptography
TL;DR: The general concept of an information-theoretic cryptographic primitive is proposed which covers many previously considered primitives like oblivious transfer, noisy channels, and multi-party computation and the concept of a generalized random oracle which answers more general queries than the evaluation of a random function is proposed.
References
More filters
Journal ArticleDOI
How to construct pseudorandom permutations from pseudorandom functions
Michael Luby,Charles Rackoff +1 more
TL;DR: Any pseudorandom bit generator can be used to construct a block private key cryptos system which is secure against chosen plaintext attack, which is one of the strongest known attacks against a cryptosystem.
BookDOI
Advances in Cryptology — EUROCRYPT ’99
TL;DR: This work shows that if the private exponent d used in the RSA public-key cryptosystem is less than N then the system is insecure.
BookDOI
Advances in Cryptology — CRYPTO ’94
TL;DR: The first, successful experiment in breaking the full 16-round DES is reported, based on new linear approximate equations, each of which provides candidates for 13 secret key bits and reliability of the key candidates is taken into consideration, which increases the siicccss r a k .
Related Papers (5)
How to construct pseudorandom permutations from pseudorandom functions
Michael Luby,Charles Rackoff +1 more