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 verif…
以下正文同步自 Hacker News 最新，版权归原站所有，已转换为易读排版。
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: 1
Comments: 0
正文由 探How 从来源站点 RSS 同步，内容未经改写；遇到排版缺失或需要图片、视频时请以原文为准。