Crates.io | ecm |
lib.rs | ecm |
version | 1.0.1 |
source | src |
created_at | 2023-06-19 18:09:51.112776 |
updated_at | 2024-06-25 21:01:45.020928 |
description | Lenstra's Elliptic Curve Factorization Implementation with Big Integers |
homepage | |
repository | https://github.com/skyf0l/ecm-rs |
max_upload_size | |
id | 894288 |
size | 39,709 |
Lenstra's Elliptic Curve Factorization Implementation with Big Integers.
The code is based on the sympy implementation and translated to Rust.
Using a Intel(R) Core(TM) i7-8750H CPU @ 2.20GHz
CPU, the following results were obtained:
Number | sympy | ecm-rs | sympy / ecm-rs |
---|---|---|---|
398883434337287 | 0.074s | 0.057s | 1.23x faster |
46167045131415113 | 0.148s | 0.039s | 3.8x faster |
64211816600515193 | 0.552s | 0.017s | 32.47x faster |
168541512131094651323 | 0.071s | 0.038s | 1.87x faster |
631211032315670776841 | 0.081s | 0.128s | 0.63x faster |
4132846513818654136451 | 0.266s | 0.038s | 7.0x faster |
4516511326451341281684513 | 0.495s | 0.038s | 13.03x faster |
3146531246531241245132451321 | 1.22s | 0.22s | 5.55x faster |
4269021180054189416198169786894227 | 1.916s | 0.018s | 106.44x faster |
7060005655815754299976961394452809 | 13.555s | 3.467s | 3.91x faster |
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.