Security of the Five-Round KASUMI Type Permutation

スポンサーリンク

概要

• 論文の詳細を見る

• KASUMI is a blockcipher that forms the heart of the 3GPP confidentiality and integrity algorithms. In this paper, we study the security of the five-round KASUMI type permutations, and derive a highly non-trivial security bound against adversaries with adaptive chosen plaintext and chosen ciphertext attacks. To derive our security bound, we heavily use the tools from graph theory. However the result does not show its super-pseudorandomness, this gives us a strong evidence that the design of KASUMI is sound.

• （社）電子情報通信学会の論文
• 2008-01-01

著者

• 黒沢 馨

  The Authors Are With The Department Of Communication And Integrated Systems Tokyo Institute Of Techn

• 黒沢 馨

  Tokyo Institute Of Technology

• KUROSAWA Kaoru

  Ibaraki University

• Yagi Tohru

  Department Of Communications And Integrated Systems Tokyo Institute Of Technology

• Iwata Tetsu

  Nagoya Univ. Nagoya‐shi Jpn

• Iwata Tetsu

  Nagoya University

• Yagi Takuma

  The Authors Are With The Department Of Computer Sciences Kitami Institute Of Technology

• Yagi Tohru

  Tokyo Institute Of Technology

• Kurosawa Kaoru

  Ibaraki Univ. Hitachi‐shi Jpn

• Iwata T

  Nagoya University

関連論文

• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• 秘密分散共有法とその応用
• 秘密分散共有法 (特集 ネツトワ-クシステムと暗号--電子化社会の危機管理)
• Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
• 不正者に対して最も安全な秘密分散共有法
• 1995 IEEE International Symposium on Circuits and Systems
• ゼロ知識証明とマルチパーティプロトコル (<小特集>ゼロ知識証明とその応用)
• Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• A Network Game Based on Fair Random Numbers(Cyberworlds)
• A Scheme for Partial Disclosure of Transaction Log(Application)(Cryptography and Information Security)
• Blind Channel Estimation for Time-Varying Freauency-Selective Fading Channels(Special Section on Information Theory and Its Applications)
• Tag-KEM from Set Partial Domain One-Way Permutations
• Small Secret Key Attack on a Takagi's Variant of RSA
• Towards Secure and Fast Hash Functions (Special Section on Cryptography and Information Security)
• Towards Secure and Fast Hash Functions
• Security of the Five-Round KASUMI Type Permutation
• On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
• The Feasibility Study of the Dynamic Zone Configuration Technique with a Developed Circular Array Antenna (Special Section on Multi-dimensional Mobile Information Networks)
• Between Hashed DH and Computational DH : Compact Encryption from Weaker Assumption
• How to Construct Super-Pseudorandom Permutations with Short Keys(Symmetric Cryptography,Cryptography and Information Security)
• An Electronic Voting Protocol Preserving Voter's Privacy(Applications of Information Security Techniques)
• How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model
• Undeniable and Unpretendable Signatures

もっと見る 閉じる

スポンサーリンク