Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Finding Hash Collisions

Finding Hash Collisions

Schäge, Sven

Paperback

General Computers

ISBN10: 3639066138
ISBN13: 9783639066135
Publisher: Blues Kids Of Amer
Published: Aug 4 2008
Pages: 104
Weight: 0.33
Height: 0.22 Width: 6.00 Depth: 9.00
Language: English
Hash functions play an important role in information technology. They are incorporated in many security protocols and security-critical applications and ensure essential security properties for the overall systems. To verify their current status of security, hash functions are regularly exposed to new attacks from the scientific community. Almost all of these attacks are executed on standard PCs. However, the relevance of such attacks is limited: real attackers are not confined to the use of standard PCs. Instead they could develop specialized hardware that executes attacks much faster or cost-efficient. In this book we examine which alternative hardware technologies are suited for developing specialized architectures for the execution of attacks on hash functions. As a proof-of-concept, we develop a very cost-efficient microprocessor with a specialized instruction set and corresponding assembler software. Based on this, we implement a full hardware unit to search for collisions in hash functions. We show that executing attacks on our architecture is, given a fixed amount of money, multiple times faster than on standard PCs.

Also in

General Computers

View All