Advances in Cryptology — EUROCRYPT ’93

@inproceedings{Helleseth2001AdvancesIC,
  title={Advances in Cryptology — EUROCRYPT ’93},
  author={T. Helleseth},
  booktitle={Lecture Notes in Computer Science},
  year={2001}
}
  • T. Helleseth
  • Published in
    Lecture Notes in Computer…
    2001
  • Computer Science
  • In this paper we show an explicit relation between authentication codes and codes correcting independent errors. This relation gives rise to several upper bounds on A-codes. We also show how to construct A-codes starting from error correcting codes. The latter is used to show that if Ps exceeds PI by an arbitrarily small positive amount, then the number of source states grows exponentially with the number of keys but if PS = PI it will grow only linearly. 
    589 Citations

    Figures, Tables, and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Distinguishing Distributions Using Chernoff Information
    • 17
    • PDF
    Stochastic Cryptanalysis of Crypton
    • 27
    • PDF
    On Unbiased Linear Approximations
    • 3
    Impossible Differential Cryptanalysis of ARIA Reduced to 7 Rounds
    • 13
    Dial C for Cipher
    • 12
    • PDF
    A Linear Analysis of Blowfish and Khufu
    • 9
    The Complexity of Distinguishing Distributions (Invited Talk)
    • 22
    Combined Differential and Linear Cryptanalysis of Reduced-Round PRINTcipher
    • 8
    • PDF
    Probing Attacks on Tamper-Resistant Devices
    • 54
    • PDF