On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
f8 and f9 are standardized by 3GPP to provide confidentiality and integrity, respectively. It was claimed that f8 and f9' are secure if the underlying block cipher is a PseudoRandom Permutation (PRP), where f9' is a slightly modified version of f9. In this paper, however, we disprove both claims by showing a counterexample. We first construct a PRP F with the following property: There is a non-zero constant Cst such that for any key K, F_K(・) = F^<-1>_<K⊕Cst>(・). We then show that f8 and f9' are completely insecure if F is used as the underlying block cipher. Therefore, PRP assumption does not necessarily imply the security of f8 and f9', and it is impossible to prove their security under PRP assumption. It should be stressed that these results do not imply the original f8 and f9 (with KASUMI as the underlying block cipher) are insecure, or broken. They simply undermine their provable security.
- 社団法人電子情報通信学会の論文
- 2004-05-01
著者
-
IWATA Tetsu
Department of Computer and Information Sciences, Ibaraki University
-
KUROSAWA Kaoru
Department of Computer and Information Sciences, Ibaraki University
-
Iwata Tetsu
Department Of Computational Science And Engineering Nagoya University
-
Kurosawa Kaoru
Department Of Computer And Information Sciences Ibaraki University
-
Kurosawa Kaoru
Department Of Behavioral Sciences Faculty Of Letters Chiba University
関連論文
- On the Security of a MAC by Mitchell(Symmetric Key Cryptography)(Cryptography and Information Security)
- Tweakable Pseudorandom Permutation from Generalized Feistel Structure
- MPP Characteristics of Variants of Merkle-Damgard Iterated Hash Functions
- TMAC: Two-Key CBC MAC (Symmetric Cipher) (Cryptography and Information Security)
- TMAC : Two-Key CBC MAC
- Combinatorial Bounds and Design of Broadcast Authentication (Special Section on Discrete Mathematics and Its Applications)
- A Network Game Based on Fair Random Numbers(Cyberworlds)
- A Scheme for Partial Disclosure of Transaction Log(Application)(Cryptography and Information Security)
- On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms(Discrete Mathematics and Its Applications)
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer (Protocol) (Cryptography and Information Security)
- Hoe to Improve Interpolation Attack(Symmetric Key Cryptography)(Cryptography and Information Security)
- On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
- Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k(Special Section on Cryptography and Information Security)
- Some new results on nonperfect secret sharing schemes
- A.C. Characteristics of the Electroviscous Effect
- Transient Pressure-Drop Fluctuatins in Electroviscous Effect
- Electroviscous Effect in Liquid Crystals
- The Electroviscous Effect in the MBBA Liquid Crystal
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- New bound for affine resolvable designs and its application to authentication codes
- On Parallel Hash Functions Based on Block-Ciphers (Symmetric Cipher) (Cryptography and Information Security)
- Square Hash with a Small Key Size (Symmetric Cipher) (Cryptography and Information Security)
- k-Resilient Identity-Based Encryption in the Standard Model(Public Key Cryptography, Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackott Cipher (Symmetric Cipher) (Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackoff Cipher
- Birthday Paradox for Multi-Collisions
- Practical and Proven Zero-Knowledge Constant Round Variants of GQ and Schnorr (Special Section on Cryptography and Information Security)
- Process interactionism, process analysis, and self process : An extension of Kurt Lewin's approach to personality psychology
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer
- Square Hash with a Small Key Size
- Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions