Scripts that illustrate basic cryptography concepts based on Coursera Standford Cryptography I course and more.

Cracking 2DES using a meet-in-the-middle attack implemented in python 3.

World record fastest exact subset sum solver. Breakthrough discovery -- solves NP-complete subset sum problem up to n=70 with 1 quadrillion values. Open source.

my solutions for the HW in the symmetric cipher breaking course, all the HW are exercises from the https://cryptanex.hideinplainsight.io/ website

Explicación, problemas y soluciones relacionados con el algoritmo meet in the middle.

From basic algorithms like Sieve, Bitwise-sieve, Segmnted-sieve, Modular Arithmetic, Big Mod to Primality test, CRT etc. all other advance number theory algorithms.

Go Meet in The Middle Key Cracker

Meet in the middle attack on textbook RSA

C implementation of a SHA-1 cracker with various optimizations

Official code for 'Galois Invariants in Cyclotomic Lattice Enumeration'. Proves deterministic collapse of the SVP search space via modular pruning and MitM architecture. Demonstrates non-ergodicity of LWE noise, reducing complexity by the product of oracle primes. Supporting material for SEMA Journal (Springer Nature).

Aplikasi optimasi pemilihan komponen PC menggunakan algoritma 0/1 Knapsack dengan pendekatan Brute Force dan Dynamic Programming.

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'.

Browser-based HiAE threat model case study — AESL, Theorem 1 candidate enumeration, MITM state recovery, byte decomposition, guess-and-determine key recovery. Security claims are contracts. The threat model is the fine print. No backends. No simulated math.

Implementation and linear cryptanalysis of a simplified AES-like cipher

Find fair meeting points for N participants — isochrone intersection, venue search, fairness scoring