Towards Secure and Fast Hash Functions (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
We analyze the security of iterated 2m-bit hash functions with rate 1 whose round functions use a block cipher with an m-bit input (output) and a 2m-bit key. We first show a preimage attack with O(2^m) complexity on Yi and Lam's hash function of this type. This means that their claim is wrong and it is less secure than MDC-2. Next, it is shown that a very wide class of such functions is also less secure than MDC-2. More precisely, we prove that there exist a preimage attack and a 2nd preimage attack with O(2^m) complexity and a collision attack with O(2^<3m/4>) complexity, respectively. Finally, we suggest a class of hash functions with a 2m-bit hashed value which seem to be as secure as MDC-2.
- 社団法人電子情報通信学会の論文
- 1999-01-25
著者
-
黒沢 馨
The Authors Are With The Department Of Communication And Integrated Systems Tokyo Institute Of Techn
-
黒沢 馨
Tokyo Institute Of Technology
-
Satoh T
Tokyo Institute Of Technology
-
Satoh Takashi
Network Laboratories Ntt Docomo Inc.
-
Satoh Takashi
Tokyo Institute Of Technology
-
Satoh Takashi
Tokyo Electric Power Company
-
KUROSAWA Kaoru
Tokyo Institute of Technology
-
HAGA Mio
Tokyo Institute of Technology
-
Satoh T
Network Laboratories Ntt Docomo Inc.
関連論文
- 秘密分散共有法とその応用
- 秘密分散共有法 (特集 ネツトワ-クシステムと暗号--電子化社会の危機管理)
- 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
- ゼロ知識証明とマルチパーティプロトコル (<小特集>ゼロ知識証明とその応用)
- B-6-57 Collecting and distributing context for a ubiquitous service
- B-7-9 Context distribution network for ubiquitous services
- A Network Game Based on Fair Random Numbers(Cyberworlds)
- A Scheme for Partial Disclosure of Transaction Log(Application)(Cryptography and Information Security)
- Communication Complexity of Perfect ZKIP for a Promise Problem (Special Section on Cryptography and Information Security)
- Information Theoretic Approach to Privacy for Multi-party protocols (Special Section on Cryptography and Information Security)
- ICONE11-36528 DEVELOPMENT OF ADVANCED CONCEPT FOR SHORTENING CONSTRUCTION PERIOD OF ABWR PLANT (PART2)
- Towards Secure and Fast Hash Functions (Special Section on Cryptography and Information Security)
- Towards Secure and Fast Hash Functions
- On Construction of Signature Scheme over a Certain Non-Commutative Ring (Special Section on Cryptography and Information Security)
- Security of the Five-Round KASUMI Type Permutation
- On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
- Highly Nonlinear Vector Boolean Functions (Special Section on Discrete Mathematics and Its Applications)
- Reshufflable and Laziness Tolerant Mental Card Game Protocol (Special Section on Cryptography and Information Security)
- Generalization of Higher Order SAC to Vector Output Boolean Functions (Special Section on Cryptography and Information Security)