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

Razali, Ermaliza; Phan, Raphaël C.‐W.

doi:10.1007/11915034_66

Cited by 8 publications

(7 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PRP-RKA security of the resulting cipher comes with a restriction that the set of RKD functions Φ defining an RKA adversary only modifies the second part of the key (i.e., K 2 ). This is a weaker notion of RKA security compared to previous works [19,20,34] where no such restriction is made.…”

Section: Construction Amentioning

confidence: 87%

Notions and relations for RKA-secure permutation and function families

Kim

Sung

Razali

et al. 2010

Des. Codes Cryptogr.

Self Cite

View full text Add to dashboard Cite

Section: Construction Amentioning

confidence: 87%

Notions and relations for RKA-secure permutation and function families

Kim

Sung

Razali

et al. 2010

Des. Codes Cryptogr.

Self Cite

View full text Add to dashboard Cite

Section: First Constructionmentioning

confidence: 88%

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

2007

Self Cite

View full text Add to dashboard Cite

Abstract. Security of commonly used block ciphers is commonly measured in terms of their resistance to known attacks. While the provable security approach to block ciphers dates back to the first CRYPTO conference (1981), analysis of modern block cipher proposals typically do not benefit fully from this, except for a few cases. This paper considers the security of recently proposed PRP-RKA secure block ciphers and discusses how they relate to existing types of attacks on block ciphers.

show abstract

“…However, as demonstrated in [21,36,38], these kinds of attacks can be mounted in some of the current real-world applications such as the IBM 4758 cryptoprocessor, PGV-type hash functions, message authentication codes, recent authenticated encryption modes, cases of key-exchange protocols that do not guarantee key integrity, and key-update protocols that updates session keys using a known function, for example, K, K + 1, K + 2, etc., where K is a session key.…”

Section: Related Work-existing Related-key Attacks On Block Ciphersmentioning

confidence: 98%

Cryptanalysis of block-wise stream ciphers suitable for the protection of multimedia and ubiquitous systems

et al. 2010

View full text Add to dashboard Cite

In this paper we introduce a general framework of related-key attack on block-wise stream ciphers which are suitable for the protection of multimedia and ubiquitous systems. As a case study, we show how our cryptanalytic framework is applied to a block-wise stream cipher TWOPRIME: we construct various related-key differentials of TWOPRIME and use them to show that recovering related keys of TWOPRIME can be performed with a data complexity of 2 14 known plaintext blocks and a time complexity of 2 32 8-bit table lookups. We expect that our general framework for a related-key attack would be useful tool for analyzing many of block-wise stream ciphers.

show abstract

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

Cited by 8 publications

References 30 publications

Notions and relations for RKA-secure permutation and function families

Notions and relations for RKA-secure permutation and function families

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

Cryptanalysis of block-wise stream ciphers suitable for the protection of multimedia and ubiquitous systems

Contact Info

Product

Resources

About