Difference between revisions of "Deep Crack / EFF DES Cracker"

From Embedded Lab Vienna for IoT & Security
Jump to navigation Jump to search
Line 37: Line 37:
Pictures:
Pictures:
<references>
<references>
<ref name="Deep-Crack"> prey project.com. 2021. [https://preyproject.com/blog/types-of-encryption-symmetric-or-asymmetric-rsa-or-aes Types of Encryption: Symmetric or Asymmetric? RSA or AES?].</ref>
<ref name="Deep-Crack"> Deep[https://crack.sh].</ref>


[[Category:Documentation]]
[[Category:Documentation]]

Revision as of 23:34, 2 January 2024

Summary

In 1998, the Electronic Frontier Foundation (EFF) developed the hardware machine Deep Crack, which executed a brute-force attack against DES in 56 hours.

Architecture

The EFF DES Cracker's architecture is straightforward, comprising a standard personal computer connected to custom chips. The software instructs the chips to search, running independently until a potentially interesting key is found or new search directions are given. The hardware's role is to eliminate incorrect answers, leaving the software to efficiently search remaining potential keys. The machine's strength lies in replicating a useful search circuit, enabling the software to explore a small portion of the key space. The highly parallelizable nature of the DES key search problem allows multiple machines to work simultaneously, significantly reducing search time. DES Cracker incorporates 1536 chips, employing a brute-force search strategy with variations in key order.


  • Deep-Crack

Description

DES (DATA ENCRYPTION STANDARD)

DES, the first encryption algorithm published by the National Institute of Standards and Technology (NIST), was designed by IBM based on their Lucifer cipher. Established as a standard in 1974, DES was a widely utilized data encryption method employing a private key. It applies a 56-bit key to each 64-bit data block, mapping input blocks to 64-bit output blocks through a process of 16 rounds or operations. Despite its widespread use, DES was deemed insecure due to its vulnerability to brute-force attacks and its relatively small key size.

BRUTE FORCE ATTACK

A brute force attack systematically cycles through all possible keys to decrypt information, persistently trying each key until the correct one is found. The security in this method relies on the immense number of possible keys, with 2^n options for a key of n bits, making the attack practically infeasible even with years of computational effort. To expedite the process from years to mere hours, dedicated hardware, like Deep Cracker, can be employed for efficient implementation of the attack.

Related

References

Pictures: <references> [1]

  1. Deep[1].