https://github.com/crocs-muni/cm_factorization
Complex multiplication based factorization
https://github.com/crocs-muni/cm_factorization
complex-multiplication elliptic-curves factorization secrypt-2019
Last synced: 26 days ago
JSON representation
Complex multiplication based factorization
- Host: GitHub
- URL: https://github.com/crocs-muni/cm_factorization
- Owner: crocs-muni
- License: mit
- Created: 2018-12-19T21:01:29.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2022-02-21T15:19:12.000Z (about 4 years ago)
- Last Synced: 2025-09-10T06:17:22.815Z (6 months ago)
- Topics: complex-multiplication, elliptic-curves, factorization, secrypt-2019
- Language: Jupyter Notebook
- Homepage: https://crocs.fi.muni.cz/public/papers/Secrypt2019
- Size: 1.26 MB
- Stars: 38
- Watchers: 5
- Forks: 5
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# CM-based factorization
Complex multiplication based factorization.
This repository contains proof of concept factorization code and scripts used in experiments.
## Proof of concept script usage
Generating CM primes:
```bash
sage cm_factor.sage --action generate --prime-bits 64
16344322632527439553
```
CM factorization:
```bash
sage cm_factor.sage -N 158697752795669080171615843390068686677 -D 11
Factorization of N: 158697752795669080171615843390068686677 is:
14793660019451035033 * 10727416514034371869
```
## Advanced usage script
More complex script that was used to run experiments covered in the paper is `experiments.sage`.
It covers distributed computation of the factorization, class number sampling, batch BCD computation,
Hilbert polynomial generation, primorial D computation, benchmarking.
## Dependencies
Sage 8 is required. Included packages `coloredlogs`, `humanfriendly` are optional.