Security of Modified Counter Modes(HISC2006)
スポンサーリンク
概要
- 論文の詳細を見る
Iwata has shown the method for building a pseudorandom function from a random permutation. Unlike previous building methods, his method provides the pseudorandom function such that the output size is larger than that of the underlying random permutation. If his method is secure, then his method is applicable to construct the efficient counter mode. In this paper we discuss the security of his method by using the security analysis of a previous building method. We show that it is not easy to improve the security of pseudorandom functions built by similar methods substantially.
- 社団法人電子情報通信学会の論文
- 2006-05-17
著者
-
Morii Masakatu
Faculty of Engineering, Ehime University
-
Morii Masakatu
Faculty Of Engineering Kobe University
-
KUWAKADO Hidenori
Faculty of Engineering, Kobe University
-
Kuwakado Hidenori
Faculty Of Engineering Kobe University
関連論文
- The Efficient GMD Decoders for BCH Codes (Special Issue on Multiple-Valued Logic)
- Image Size Invariant Visual Cryptography (Special Section on Information Theory and Its Applications)
- Fingerprinting Protocol Based on Distributed Providers Using Oblivious Transfer(Cryptography,Information Theory and Its Applications)
- Security of Modified Counter Modes(HISC2006)
- New Weakness in the Key-Scheduling Algorithm of RC4
- Size-Reduced Visual Secret Sharing Scheme(Discrete Mathematics and Its Applications)
- Transitive Signature Scheme for Directed Trees
- Polynomial Representation of a Visual Secret Sharing Scheme and Its Application
- Collision Resistance of Hash Functions in a Weak Ideal Cipher Model
- Visual Commitment Using the Trusted Initializer
- Multilane Hashing Mode Suitable for Parallel Processing
- On the Security of the ElGamal-Type Signature Scheme with Small Parameters (Special Section on Cryptography and Information Security)
- On the Security of the Improved Knapsack Cryptosystem (Special Section on Information Theory and Its Applications)