Liam Keliher

Abstract. This report presents the results from the completed computation of an algorithm introduced by the authors in [11] for evaluating the provable security of the AES (Rijndael) against linear...

2 1 (2007)

Abstract. In this paper, we demonstrate that the linear hull effect is significant for the Q cipher. The designer of Q performs preliminary linear cryptanalysis by discussing linear characteristics...

2 (2007)

Liam Keliher, Henk Meijer

Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptanalysis. The best...

yz (2007)

The use of key-dependent s-boxes in block cipher design has not been widely investigated in the literature. Research into s-box design has focussed on determination of s-box properties which yield...

Toward Provable Security Against Differential and Linear Cryptanalysis for Camellia and Related Ciphers Abstract (2006)

Exact Maximum Expected Differential and Linear Probability for 2-Round Advanced Encryption Standard (AES) (2005)

We present a new algorithm that evaluates provable security against differential and linear cryptanalysis for Feistel ciphers with invertible substitution-diffusion (SD)-based round functions. This...

Liam Keliher, Jiayuan Sui

Provable security of a block cipher against di#erential / linear cryptanalysis is based on the maximum expected di#erential / linear probability (MEDP / MELP) over T 2 core rounds. Over the past few...

Exact maximum expected differential and linear probability for 2round advanced encryption standard (AES),” Cryptology ePrint archive, Report 2005/321 (2005)

Liam Keliher, Jiayuan Sui

Abstract. Provable security of a block cipher against differential / linear cryptanalysis is based on the maximum expected differential / linear probability (MEDP / MELP) over T ≥ 2 core rounds....

Refined analysis of bounds related to linear and differential cryptanalysis for the AES (2005)

Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probability for Rijndael (2004)

Abstract. The best upper bounds on the maximum expected linear probability (MELP) and the maximum expected differential probability (MEDP) for the AES, due to Park et al. [23], are 1.075 × 2 −106...

Toward the true random cipher: On expected linear probability values for SPNs with randomly selected s-boxes, chapter (2003)

This report presents the results from the completed computation of an algorithm introduced by the authors in [11] for evaluating the provable security of the AES (Rijndael) against linear...

Linear cryptanalysis of substitution-permutation networks (2003)

A block cipher, which is an important cryptographic primitive, is a bijective mapping from {0, 1} N to {0, 1} N (N is called the block size), parameterized by a key. In the true random cipher, each...

New method for upper bounding the maximum average linear hull probability for SPNs (2001)

The subject of this thesis is linear cryptanalysis of substitution-permutation networks (SPNs). We focus on the rigorous form of linear cryptanalysis, which requires the concept of linear hulls....

Dual of new method for upper bounding the maximum average linear hull probability for SPNs (2001)

Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptanalysis. The best...

High probability linear hulls in Q (2001)

In [3], we present a new algorithm for computing an upper bound on the maximum average linear hull probability (MALHP) for the SPN symmetric cipher structure, a value required to make claims about...

Modeling linear characteristics of substitution-permutation networks (2000)

Abstract. In this paper, we demonstrate that the linear hull effect is significant for the Q cipher. The designer of Q performs preliminary linear cryptanalysis by discussing linear characteristics...

Substitution-permutation network cryptosystems using key-dependent s-boxes (1997)

Abstract. In this paper we present a model for the bias values associated with linear characteristics of substitution-permutation networks (SPN's). The first iteration of the model is based on...

A new substitution-permutation network cryptosystem using key-dependent s-boxes (1997)

Substitution-permutation network cryptosystems using key-dependent s-boxes (1997)

Substitution-permutation networks (SPNs) are an important class of private key cryptosystems, having substitution boxes (s-boxes) as a critical internal component. Much of the research into s-boxes...

Results and conjectures related to the sharp form of the Littlewood conjecture (1995)

Results and conjectures related to the sharp form of the Littlewood conjecture (1995)

Let $0

Let $0

2 1