2025-05-18 23:01:41 +02:00
2025-05-18 19:26:14 +02:00
2025-05-18 23:01:41 +02:00
2025-05-18 23:01:41 +02:00
2025-04-11 09:25:22 +02:00
2025-03-28 08:57:21 +01:00
2025-04-11 09:25:22 +02:00
2025-04-30 14:22:28 +02:00

Rust implementation for the approximate greatest common divisor (AGCD) problem using LLL algorithm.

commands

use the provided Makefile to compile the release version

approximate-gcd agcd <path to input file>

Input file must have the following format:

  • first non-comment line: number of noise bits (written in decimal)
  • all the other lines, one per line: the numbers Xi (written in decimal) to find the approximate GCD of
  • // can be used to comment a line, MUST be used at the begining of a new line and not at the end of a line containing a number

generating values

The script gen_values can be used to generate test values

python gen_values.py [--noise-bits <number of noise bits>] [--number <number of values to generate>]

the output can be directly written to a file

python gen_values.py [options] > input.txt
Description
No description provided
Readme BSD-3-Clause-Attribution 58 KiB
Languages
Rust 66.2%
Python 33.2%
Makefile 0.6%