Matasano crypto challenges (http://cryptopals.com/) implemented mostly in C.

This is a serie of 56 technical challenges around software programming and cryptography made by some people at Matasano. Every solution can be built either on Windows or on Linux (Mint and Arch tested).

The tools folder contains implementations of several standard cryptographic protocols and utilities : do not use them in production.

• You need to have access to the gcc toochain and basic shell commands (make, cd, sed, awk, etc.). On Windows, every challenge has been tested against the mingw32 compiler.
• Some challenges use pythons scripts : everything has been written for Python 3xx. Older versions may or may not work.
• pip requirements :
  • On Linux, install pip3 : sudo (apt-get install | yum install | pacman -S) python3-pip to prevent name clashing with the system-wide pip binary.
  • bottle web framework for challenges 31 & 32
  • tkinter for challenge 20
• libcurl : challenge 31 & 32 use libcurl to make requests to a remote webpage.
  • Libcurl isn't installed by default on Windows, so you will need to download the static library compatible with your compiler (or build it yourself) and placing it in the corresponding's lib folder. Download page : http://curl.haxx.se/download.html
  • On Unix systems, you can either use libcurl statically of dynamically (modify the Makefile to your needs). Don't forget to add the installed lib folder (something like /usr/lib/x86_64-linux-gnu ) in the LDFLAGS.

The Makefile located in the root folder contains every useful commands, while global.mk has every project-wide variables.

Ex :

• make 01 all will build all the targets in first challenge.
• make tools will build all the necessary libraries and bins in the tools folder.
• make exos clean will run make clean on every challenges.
• make exos build will run make build on every challenges, building the binary. (make whill aslo do the same)
• make exos solve will run make solve on every challenges, building the binary and running it.
• make 01 07 09 solve will run make solve on challenge 01, 07 and 09.

Caveat : challenge #31 & #32 can't be called from the top-level Makefile since you need to fire up a websever. To test the challenge , you need to type :

• cd "[$ex]_..."
• make webserver on one terminal
• make solve on an another terminal

• Convert hex to base64
• Fixed XOR
• Single-byte XOR cipher
• Detect single-character XOR
• Implement repeating-key XOR
• Break repeating-key XOR
• AES in ECB mode
• Detect AES in ECB mode

• Implement PKCS#7 padding
• Implement CBC mode
• An ECB/CBC detection oracle
• Byte-at-a-time ECB decryption (Simple)
• ECB cut-and-paste
• Byte-at-a-time ECB decryption (Harder)
• PKCS#7 padding validation
• CBC bitflipping attacks

• The CBC padding oracle
• Implement CTR, the stream cipher mode
• Break fixed-nonce CTR mode using substitions
• Break fixed-nonce CTR statistically
• Implement the MT19937 Mersenne Twister RNG
• Crack an MT19937 seed
• Clone an MT19937 RNG from its output
• Create the MT19937 stream cipher and break it

• Break "random access read/write" AES CTR
• CTR bitflipping
• Recover the key from CBC with IV=Key
• Implement a SHA-1 keyed MAC
• Break a SHA-1 keyed MAC using length extension
• Break an MD4 keyed MAC using length extension
• Implement and break HMAC-SHA1 with an artificial timing leak
• Break HMAC-SHA1 with a slightly less artificial timing leak
  • This challenge works only on Linux (Arch Linux & Mint tested).

• Implement Diffie-Hellman
• Implement a MITM key-fixing attack on Diffie-Hellman with parameter injection
• Implement DH with negotiated groups, and break with malicious "g" parameters
  • Done on paper only
• Implement Secure Remote Password (SRP)
• Break SRP with a zero key
• Offline dictionary attack on simplified SRP
• Implement RSA
• Implement an E=3 RSA Broadcast attack

• Implement unpadded message recovery oracle
• Bleichenbacher's e=3 RSA Attack
• DSA key recovery from nonce
• DSA nonce recovery from repeated nonce
• DSA parameter tampering
• RSA parity oracle
• Bleichenbacher's PKCS 1.5 Padding Oracle (Simple Case)
• Bleichenbacher's PKCS 1.5 Padding Oracle (Complete Case)

• CBC-MAC Message Forgery
• Hashing with CBC-MAC
• Compression Ratio Side-Channel Attacks
• Iterated Hash Function Multicollisions
• Kelsey and Schneier's Expandable Messages
• Kelsey and Kohno's Nostradamus Attack
• MD4 Collisions
• RC4 Single-Byte Biases

My own code is free to use (attribution is nice, but not mandatory). Other licenses :

• curl : libcurl has a fairy complicated license mix. Since I only link against the lib, my work is not derivative and is not subject to libcurl's licenses.
• mini-gmp is doubly licensed GPL and LGPL.
• sha1 is copied from polarSSL/mbed is GPL also.
• sha256 is copied from Brad conte crypto-algorithms and is copyleft.
• rsa prime generation is adapted from SSH 1.2.0, found in MIT Athena's project (Copyright 1995 SSH Communications Security).