Collision Search of a Hash Function by Using Random Mapping (Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper proposes to apply random mapping methods of a pseudo random function to find collisions of a hash function. We test a hash function including a block cipher (see ISO/IEC 10118-2[6]) with computers, where users can select its initial vector. In particular, the paper shows that a hash function with multiple stages generates a lot of collision hash values,so our probabilistic consideration of a small model for the hash function well explains the computational results. We show that it's feasible to find collisions between the selected messages in advance for 64-bit-size hash functions with WSs linked via an ordinary LAN (Local Area Network). Thus, it is dangerous to use the hasb function, single block mode, defined in [6] and [7].

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

著者

• OHTA Kazuo

  NTT Laboratories

• Morita Hikaru

  Ntt Laboratories Ntt Corporation

• Morita H

  Ntt Corp. Yokosuka‐shi Jpn

• ODAGI Hideki

  The Graduate School of Information Systems, University of Electro-Communications

• Odagi Hideki

  The Graduate School Of Information Systems University Of Electro-communications:yamaha Corporation

関連論文

• E2-A New 128-Bit Block Cipher(Special Section on Cryptography and Information Security)
• Strict Evaluation of the Maximum Average of Differential Probability and the Maximum Average of Linear Probability (Special Section on Cryptography and Information Security)
• Linear Cryptanalysis of FEAL (Special Section on Cryptography and Information Security)
• Key-Dependency of Linear Probability of RC5 (Special Section on Cryptography and Information Security)
• The Best Linear Expression Search of FEAL (Special Section on Cryptography and Information Security)
• Security and Performance Evaluation of ESIGN and RSA on IC Cards by Using Byte-Unit Modular Algorithms(Fundamental Theories for Communications)
• One-Time Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash (Special Section on Cryptography and Information Security)
• Multiple Scalar-Multiplication Algorithm over Elliptic Curve
• Efficient Sealed-Bit Auction by Using One-Way Functions : Special Section on Cryptography and Information Security
• An Electronic Soccer Lottery System that Uses Bit Commitment(Special Issue on Next Generation Internet Technologies and Their Applications)
• Collision Search of a Hash Function by Using Random Mapping (Special Section on Cryptography and Information Security)
• Multi-Signature Schemes Secure against Active Insider Attacks (Special Section on Cryptography and Information Security)
• Security of the Extended Fiat-Shamir Schemes (Special Section on Cryptography and Information Security)

もっと見る 閉じる

スポンサーリンク