Advances in Cryptology – CRYPTO 2004

@inproceedings{Franklin2004AdvancesIC,
  title={Advances in Cryptology – CRYPTO 2004},
  author={M. Franklin},
  booktitle={Lecture Notes in Computer Science},
  year={2004}
}
  • M. Franklin
  • Published in
    Lecture Notes in Computer…
    2004
  • Computer Science
  • 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
    705 Citations

    Figures, Tables, and Topics from this paper

    Multidimensional Linear Cryptanalysis of Reduced Round Serpent
    • 69
    A Statistical Saturation Attack against the Block Cipher PRESENT
    • 127
    • PDF
    On Multidimensional Linear Cryptanalysis
    • 18
    • PDF
    An Improved Fast Correlation Attack on Stream Ciphers
    • 5
    • PDF
    Collisions on SHA-0 in One Hour
    • 39
    • PDF
    Algebraic Cryptanalysis of 58-Round SHA-1
    • 34
    • PDF
    Multi-trail Statistical Saturation Attacks
    • 11
    • PDF

    References

    SHOWING 1-10 OF 33 REFERENCES
    Simplified OAEP for the RSA and Rabin Functions
    • D. Boneh
    • Mathematics, Computer Science
    • CRYPTO
    • 2001
    • 156
    • Highly Influential
    • PDF
    Finding a Small Root of a Univariate Modular Equation
    • 309
    • Highly Influential
    • PDF
    The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin
    • 984
    • Highly Influential
    • PDF
    Efficient signature generation by smart cards
    • C. Schnorr
    • Mathematics, Computer Science
    • Journal of Cryptology
    • 2004
    • 2,161
    • PDF
    An OAEP Variant With a Tight Security Proof
    • J. Jonsson
    • Computer Science
    • IACR Cryptol. ePrint Arch.
    • 2002
    • 13
    • Highly Influential
    • PDF
    Optimal Asymmetric Encryption-How to Encrypt with RSA
    • 473
    • Highly Influential
    • PDF
    On the Exact Security of Full Domain Hash
    • J. Coron
    • Mathematics, Computer Science
    • CRYPTO
    • 2000
    • 407
    • Highly Influential
    • PDF
    Analysis of Bernstein's Factorization Circuit
    • 49
    • PDF
    Security Proof for Partial-Domain Hash Signature Schemes
    • 37
    • Highly Influential
    • PDF