Advances in Cryptology – CRYPTO 2004
@inproceedings{Franklin2004AdvancesIC, title={Advances in Cryptology – CRYPTO 2004}, author={M. Franklin}, booktitle={Lecture Notes in Computer Science}, year={2004} }
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks based on this technique and derive explicit and compact gain formulas for generalized versions of Matsui’s Algorithm 1 and Algorithm 2. The theoretical framework allows both approaches to be treated in a unified way, and predicts significantly improved attack complexities compared to current linear attacks using a… CONTINUE READING
Figures, Tables, and Topics from this paper
705 Citations
Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- Mathematics, Computer Science
- FSE
- 2008
- 35
- PDF
Multidimensional Linear Cryptanalysis of Reduced Round Serpent
- Mathematics, Computer Science
- ACISP
- 2008
- 69
Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
- Computer Science
- Inscrypt
- 2007
- 35
- PDF
A Statistical Saturation Attack against the Block Cipher PRESENT
- Mathematics, Computer Science
- CT-RSA
- 2009
- 127
- PDF
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
- Mathematics, Computer Science
- ICISC
- 2008
- 33
- PDF
An Improved Fast Correlation Attack on Stream Ciphers
- Computer Science
- Selected Areas in Cryptography
- 2008
- 5
- PDF
References
SHOWING 1-10 OF 33 REFERENCES
Simplified OAEP for the RSA and Rabin Functions
- Mathematics, Computer Science
- CRYPTO
- 2001
- 156
- Highly Influential
- PDF
Finding a Small Root of a Univariate Modular Equation
- Mathematics, Computer Science
- EUROCRYPT
- 1996
- 309
- Highly Influential
- PDF
The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin
- Mathematics, Computer Science
- EUROCRYPT
- 1996
- 984
- Highly Influential
- PDF
Efficient signature generation by smart cards
- Mathematics, Computer Science
- Journal of Cryptology
- 2004
- 2,161
- PDF
An OAEP Variant With a Tight Security Proof
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2002
- 13
- Highly Influential
- PDF
On the Exact Security of Full Domain Hash
- Mathematics, Computer Science
- CRYPTO
- 2000
- 407
- Highly Influential
- PDF
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
- Mathematics, Computer Science
- CRYPTO
- 1992
- 58
- PDF
Security Proof for Partial-Domain Hash Signature Schemes
- Computer Science
- CRYPTO
- 2002
- 37
- Highly Influential
- PDF