Show HN: Exact integer LLL lattice basis reduction in C99

LLL, also known as Lenstra–Lenstra–Lovász lattice basis reduction algorithm, is an important algorithm in mathematics and cryptography. clll is an implementation of LLL in C99, which is small, is based on formally verified algorithm, and uses integer arithmetic only (GMP). Claim. clll is also high performant, based on the private benchmarks I have run comparing LLL implementations with exact arithmetic. Comments URL: https://news.ycombinator.com/item?id=50373689 Points: 2 # Comments: 0