C implementation of a SHA-1 cracker with various optimizations
-
Updated
Dec 19, 2018 - C
C implementation of a SHA-1 cracker with various optimizations
Go Meet in The Middle Key Cracker
Implementation and linear cryptanalysis of a simplified AES-like cipher
Explicación, problemas y soluciones relacionados con el algoritmo meet in the middle.
my solutions for the HW in the symmetric cipher breaking course, all the HW are exercises from the https://cryptanex.hideinplainsight.io/ website
From basic algorithms like Sieve, Bitwise-sieve, Segmnted-sieve, Modular Arithmetic, Big Mod to Primality test, CRT etc. all other advance number theory algorithms.
Implémentation du chiffrement PRESENT24, de son déchiffrement et d'une attaque par le milieu sur Double-PRESENT24.
SubsetSum: a study on 'The Subset-Sum Problem'.
Cracking 2DES using a meet-in-the-middle attack implemented in python 3.
Scripts that illustrate basic cryptography concepts based on Coursera Standford Cryptography I course and more.
Add a description, image, and links to the meet-in-the-middle topic page so that developers can more easily learn about it.
To associate your repository with the meet-in-the-middle topic, visit your repo's landing page and select "manage topics."