Advances in Cryptology — EUROCRYPT ’93

@inproceedings{Helleseth2001AdvancesIC,
  title={Advances in Cryptology — EUROCRYPT ’93},
  author={Tor 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. 
Distinguishing Distributions Using Chernoff Information
TLDR
This paper revisits computational soundness amplification by sequential repetition in the threshold case, i.e when completeness is not perfect and outlines applications to the Leftover Hash Lemma and iterative attacks on block ciphers.
Stochastic Cryptanalysis of Crypton
TLDR
This paper shows how to exploit some statistical deficiencies of the Crypton round function to mount stochastic attacks on round-reduced versions of Crypton, which are more efficient than the best differential and linear attacks.
On Unbiased Linear Approximations
TLDR
A novel form of linear cryptanalysis using multiple linear approximations which can be used to extract key information when all pre-existing techniques would fail is shown.
Trapdoor Permutation Polynomials of Z/ n Z and Public Key Cryptosystems
TLDR
It is shown that the ideas developed in this extended abstract can be used to design the most efficient known cryptosystem with semantic security under non-adaptive chosen ciphertext attacks in the standard security model.
Impossible Differential Cryptanalysis of ARIA Reduced to 7 Rounds
TLDR
This paper finds a new impossible differential property of ARIA, and proposes an attack against ARIA-256 reduced to 7 rounds based on this property, while previous attacks can only attack ARIA up to 6 rounds.
Dial C for Cipher
TLDR
This work introduces C, a practical provably secure block cipher with a slow key schedule based on the Blum-Blum-Shub pseudo-random generator, and proposes a variant of C with simpler substitution boxes which is suitable for most applications, and for which security proofs still hold.
A Linear Analysis of Blowfish and Khufu
TLDR
The first known-plaintext (and ciphertext-only) attacks on these ciphers are reported, and the fraction of user keys that generate weak nonlinear components is estimated, with large enough bias.
The Complexity of Distinguishing Distributions (Invited Talk)
TLDR
This paper reviews techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples and links it with the Chernoff information and provides a useful approximation based on the squared Euclidean distance.
Combined Differential and Linear Cryptanalysis of Reduced-Round PRINTcipher
TLDR
This paper analyzes the security of PRINTcipher using a technique that combines differential and linear cryptanalysis and shows that specific choices of some of the key bits give rise to a certain differential characteristic probability, which is far higher than the best characteristic probability claimed by the designers.
Probing Attacks on Tamper-Resistant Devices
TLDR
By locally observing the value of a few RAM or adress bus bits during the execution of a cryptographic algorithm, an attacker could easily recover information on the secret key being used.
...
1
2
3
4
5
...