crypto-primes
| Crates.io | crypto-primes |
| lib.rs | crypto-primes |
| version | |
| source | src |
| created_at | 2023-01-21 04:51:48.871695+00 |
| updated_at | 2025-03-07 19:35:16.466138+00 |
| description | Random prime number generation and primality checking library |
| homepage | |
| repository | https://github.com/entropyxyz/crypto-primes |
| max_upload_size | |
| id | 763976 |
| Cargo.toml error: | TOML parse error at line 18, column 1 | 18 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
| size | 0 |
David (dvdplm)
documentation
README
Prime number tools for crypto-bigint
This library implements prime number generation and primality checking for crypto-bigint integers.
In particular:
-
Generating random primes and safe primes of given bit size;
-
Sieving iterator;
-
Miller-Rabin test;
-
Strong and extra strong Lucas tests, and Lucas-V test.
The library is no-std compatible and contains no unsafe code.
Most users will be using the small set of functions exported from the top level, providing "pre-packaged" prime finding functionality with sane defaults.
Example
Find a 196 bit prime returned in a 256-bit long crypto_bigint::U256:
use crypto_bigint::U256;
let prime = crypto_primes::generate_prime::<U256>(196);
assert!(crypto_primes::is_prime(&prime));
Find a 64 bit safe prime returned in a crypto_bigint::U1024:
use crypto_bigint::U1024;
let prime = crypto_primes::generate_safe_prime::<U1024>(64);
assert!(crypto_primes::is_safe_prime(&prime));
Advanced
Advanced users can use the hazmat module in the library to build a custom prime finding solution that best fit their needs, e.g. by picking different Lucas bases or running Miller-Rabin tests with particular bases.
Features
The following features are available:
-
default-rng: Use the OS default CSPRNG,OsRng. Enabled by default. -
multicore: Enables additional parallel prime finding functions. Disabled by default.