bkz

High-performance integer factorization suite implementing GNFS, MPQS, and QS algorithms with optimized lattice reduction, vectorization, GPU acceleration, and tensor-based linear algebra. Features automatic algorithm selection, NUMA-aware scheduling, and checkpoint/restore for computational number theory research and cryptanalytic analysis.

Python implementation of GGH and GGH-HNF lattice-based cryptosystems for research and educational purposes, featuring cryptanalysis tools and a hybrid variant.

Reproducible benchmark comparing BKZ vs SD-BKZ using Li-Nguyen Rankin profile distance (d(LN)) on LWE-Kannan lattices

Sage/Python toolkit for attacking and solving truncated Fibonacci LFSRs over integer residue rings, with demos, CTF examples, and Vietnamese notes.

ECDSA private-key recovery from biased nonces via the Hidden Number Problem — lattice reduction (LLL/BKZ) over secp256k1 with independent ECDSA verification.

Browser demo of approximate-hint LWE secret recovery on sparse ternary secrets. Computes hint counts; runs no attack. ePrint 2026/1081.

Browser-based LLL and BKZ lattice reduction demo — Gram-Schmidt orthogonalization, Lovász condition, step-by-step basis reduction animation, toy LWE primal attack, parameter explorer showing why Kyber's n=256 q=3329 survives while toy parameters fail instantly. The hardness assumption, made tangible. No backends. No simulated math.