# Notions and relations for RKA-secure permutation and function families

@article{Kim2011NotionsAR, title={Notions and relations for RKA-secure permutation and function families}, author={Jongsung Kim and Jaechul Sung and Ermaliza Razali and Raphael C.-W. Phan and Marc Joye}, journal={Designs, Codes and Cryptography}, year={2011}, volume={60}, pages={15-35} }

The theory of designing block ciphers is mature, having seen significant progress since the early 1990s for over two decades, especially during the AES development effort. Nevertheless, interesting directions exist, in particular in the study of the provable security of block ciphers along similar veins as public-key primitives, i.e. the notion of pseudorandomness (PRP) and indistinguishability (IND). Furthermore, recent cryptanalytic progress has shown that block ciphers well designed against…

## References

SHOWING 1-10 OF 54 REFERENCES

A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications

- Computer Science, MathematicsEUROCRYPT
- 2003

This work begins by introducing definitions for the concepts of PRPs and PRFs secure against classes of RKAs, each such class being specified by an associated set of related-key deriving (RKD) functions, and proves impossibility results for some classes of attacks.

A concrete security treatment of symmet-ric encryption: Analysis of the DES modes of operation

- Computer ScienceFOCS 1997
- 1997

This work studies notions and schemes for symmetric (ie. private key) encryption in a concrete security framework and analyzes the concrete complexity of reductions among them, providing both upper and lower bounds, and obtaining tight relations.

Ciphers Secure against Related-Key Attacks

- Computer Science, MathematicsFSE
- 2004

This paper studies the security of PRF- and PRP-constructions against related-key attacks, and presents two novel constructions for related-keys secure PRFs and proves their security under number-theoretical infeasibility assumptions.

On the Notions of PRP - RKA , KR and KR - RKA for Block Ciphers

- Computer Science, MathematicsProvSec
- 2007

This paper considers the security of recently proposed PRP-RKA secure block ciphers and discusses how they relate to existing types of attacks on blockciphers.

A Related-Key Rectangle Attack on the Full KASUMI

- Computer Science, MathematicsASIACRYPT
- 2005

The results show that theoretically, KASUMI is not secure with respect to differential-based related-key attacks, and thus, the security of the entire encryption system of the 3GPP networks cannot be proven at this time.

Advanced Slide Attacks

- Computer Science, MathematicsEUROCRYPT
- 2000

This paper finds very efficient known- and chosen-text attacks on generic Feistel ciphers with a periodic key-schedule with four independent subkeys, and is able to break a DES variant proposed in [2] using just 128 chosen texts and negligible time for the analysis.

On the Existence of Related-Key Oracles in Cryptosystems Based on Block Ciphers

- Computer Science, MathematicsOTM Workshops
- 2006

The aim in this paper is to show how RK oracles exist in various block cipher based cryptosystems and formally introduce the notion of related-key multiplicative differentials, and related- key compositionally differentials.

The Security of the Cipher Block Chaining Message Authentication Code

- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 2000

A technical lemma of independent interest is bounding the success probability of a computationally unbounded adversary in distinguishing between a random ml-bit to l-bit function and the CBC MAC of a random l- bit to l -bit function.

New Types of Cryptanalytic Attacks Using related Keys (Extended Abstract)

- Computer Science, MathematicsEUROCRYPT
- 1993

It is shown that the key scheduling algorithms of many blockciphers inherit obvious relationships between keys, and use these key relations to attack the block ciphers, and shows that theKey scheduling algorithm should be carefully designed and that its structure should not be too simple.

A Tweakable Enciphering Mode

- Computer Science, MathematicsCRYPTO
- 2003

We describe a block-cipher mode of operation, CMC, that turns an n-bit block cipher into a tweakable enciphering scheme that acts on strings of mn bits, where m ≥ 2. When the underlying block cipher…