awesome-password-cracking

Awesome Password Cracking In cryptanalysis and computer security, password cracking is the process of recovering passwords from data that has been stored in or transmitted by a computer system in scrambled form. A common approach brute-force attack is to repeatedly try guesses for the password an...

mfcuk

README Compiling: autoreconf -is ./configure make Running most basic: ./mfcuk -C -R 0:A -v 2 PACKAGE MiFare Classic Universal toolKit MFCUK TOOLS Mifare Classic DarkSide Key Recovery Tool mfcukkeyrecoverydarkside.c previously known as zvmfdarkside ... LICENSE GPL. See MFCUKLICENSE for more...

Bluetooth-Attacks-CVE-2025-27840

This paper discusses how an attacker can introduce a hidden list of vulnerabilities through module updates, which can lead to compromise of ESP32 devices and gaining unauthorized access to private keys, affecting billions of devices using this microcontroller. One of the key issues is the...

bLaCk-eye-RSA-Attacking-Toolkit-v0.1f-compiled

bLaCk-eye RSA Attacking Toolkit v0.1f Description RAT v0.1f compiled for Windows Since from the official site you can only download source and no executable. If you don't have time to waste with the compiler and miracl library this is ready to go...

quantum-zk-proof-poc

PoC for breaking Google's zero-knowledge proof of quantum cryptanalysis This repository contains resources for the Trail of Bits blog post detailing how we beat Google's zero-knowledge proof that they have a high-efficiency quantum circuit for elliptic curve cryptanalysis. It includes our forged...

break-golf

break-golf A board for cryptanalysis results that are proved , not run. A challenge fixes two worlds and the statement you must prove. You write an adversary and a proof that it distinguishes them. The win is the proof: nothing is executed, sampled, or replayed, and no human reads the submission ...

lab

Lab Public code artifacts from research work. Papers Implementations and supporting code for specific research papers. alife Anchor| Description ---|--- gupta2026lenia| Collision-based logic in Lenia and its composition boundary — an emergent INHIBIT gate and AND-NOT cascade from Orbium glider...

Measuring Human Cryptanalysis Effort

Matthew Green has a new site that tries to estimate the number of cryptanalyst-hours that have been spent analyzing different public-key algorithms: Abstract: We estimate how much public cryptanalysis each public-key assumption has received, using the literature itself as the instrument. From...

The Future of AI Cryptanalysis

Matthew Green has been writing a rather pessimistic series of posts about the potential for AI systems to vastly outperform humans in cryptanalysis of both symmetric and public-key ciphers. I am more optimistic than he is. That is, I have stronger faith in the over-engineering cryptographers tend...

xortool

xortool.py Una herramienta para hacer análisis xor: adivinar la longitud de la clave basado en conteo de caracteres iguales adivinar la clave basado en conocimiento del carácter más frecuente Aviso: xortool ahora solo funciona en Python 3. La versión antigua de Python 2 está disponible en la rama...

cryptovenom

CryptoVenom CryptoVenom: La navaja suiza de la criptografía ¿Qué es CryptoVenom? CryptoVenom es una herramienta OpenSource que contiene una gran cantidad de criptosistemas y métodos de criptoanálisis en una sola, incluyendo algoritmos clásicos, algoritmos hash, algoritmos de codificación, puertas...

featherduster

FeatherDuster e Cryptanalib FeatherDuster è uno strumento scritto principalmente da Daniel "unicornfurnace" Crowley, con contributi della community, per violare la crittografia; cerca di rendere il più semplice possibile il processo di identificazione e sfruttamento di sistemi crittografici debol...

Cryptanalysis of a Class of Ideal Secret Sharing Schemes Based on the CRT for Polynomial Rings

Based on the CRT for polynomial rings, Yang, Zhu, Fu and Xia ISIT 2026 proposed a compartmented secret sharing scheme for the compartmented access structure with lower bounds, claiming it can be ideal. We exhibit three families of unauthorized subsets that reconstruct the secret. The scheme is...

Claude Fable Solves a Historical Cipher

Claude Fable 5.1 solved a 370-year-old cipher in forty-four minutes. This tracks with what I wrote about AIs doing mathematics: It's good at things that involve lots of searching and testing. EDITED TO ADD 9/14: I'm not sure if this result is correct. The blog comments have more discussion...

CVE-2026-6217

Use of a One-Way hash without a salt vulnerability in Pik Online Software Solutions Inc. Pik Online Portal allows Cryptanalysis. This issue affects Pik Online Portal: through 3.5.1...

EUVD-2026-70952

Use of a One-Way hash without a salt vulnerability in Pik Online Software Solutions Inc. Pik Online Portal allows Cryptanalysis. This issue affects Pik Online Portal: through 3.5.1...

CVE-2026-6217 Information Disclosure in Pik Online Software's Portal

Use of a One-Way hash without a salt vulnerability in Pik Online Software Solutions Inc. Pik Online Portal allows Cryptanalysis. This issue affects Pik Online Portal: through 3.5.1...

CVE-2026-6217 Information Disclosure in Pik Online Software's Portal

Use of a One-Way hash without a salt vulnerability in Pik Online Software Solutions Inc. Pik Online Portal allows Cryptanalysis. This issue affects Pik Online Portal: through 3.5.1...

CVE-2026-6217

Pik Online Portal (by Pik Online Software Solutions Inc.) is vulnerable to information disclosure via use of a one-way hash without a salt , allowing cryptanalysis of hashed data. The issue affects versions through 3.5.1 . The CVSS 3.1 score is 6.3 (MEDIUM) , with a network attack vector, low com...

CVE-2026-6217: Use of a One-Way Hash without a Salt

Use of a One-Way hash without a salt vulnerability in Pik Online Software Solutions Inc. Pik Online Portal allows Cryptanalysis. This issue affects Pik Online Portal: through 3.5.1...