How to Construct Super-Pseudorandom Permutations with Short Keys(Symmetric Cryptography,<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• It is known that a super-pseudorandom permutation can be constructed from a pseudorandom function f and two universal hash functions, h and h'. It is a four round Feistel permutation denoted by φ(h_k,f,f,h'_<k'>). In this paper, we show how to re-use the secret key for f in this construction. Specifically, we show that (1) the same key can be used for both h and h', and (2) the key for h and h' can be derived from f. As a result, our construction requires only the key for f as a secret key, and it preserves computational efficiency and security. We show the full security proof of our construction. Also, we derive a similar result for a five round MISTY-type permutation.

• 社団法人電子情報通信学会の論文
• 2007-01-01

著者

• Iwata Tetsu

  Dept. Of Computational Science And Engineering Nagoya University

• Iwata Tetsu

  Nagoya Univ. Nagoya‐shi Jpn

• Kurosawa Kaoru

  Ibaraki Univ. Hitachi‐shi Jpn

• KUROSAWA Kaoru

  Dept. of Computer and Information Sciences, Ibaraki University

• Kurosawa Kaoru

  Dept. Of Computer And Information Sciences Ibaraki University

関連論文

• Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• Tag-KEM from Set Partial Domain One-Way Permutations
• Small Secret Key Attack on a Takagi's Variant of RSA
• Side Channel Attacks on Message Authentication Codes (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
• Security of the Five-Round KASUMI Type Permutation
• 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
• Further More on Key Wrapping
• Improving the Permutation Layer of Type 1, Type 3, Source-Heavy, and Target-Heavy Generalized Feistel Structures
• Cryptanalysis of 249-, 250-, ..., 256-Bit Key HyRAL via Equivalent Keys
• Security of Hash-then-CBC Key Wrapping Revisited
• Side Channel Attacks on Message Authentication Codes
• Side Channel Attacks on Message Authentication Codes

もっと見る 閉じる

スポンサーリンク