Complex multiplication based factorization
-
Updated
Feb 21, 2022 - Jupyter Notebook
#
complex-multiplication
Here are 7 public repositories matching this topic...
classpoly build for the Hilber class polynomial computation in Z and mod P
elliptic-curves crt ec complex-multiplication class-polynomial hilbert-class-polynomial hilbert-polynomial classpoly sutherland hilbert-polynomial-modulo
-
Updated
Feb 13, 2019 - C
Empirical CM detector for elliptic curves — 100% accuracy on secp256k1/BN254/BLS12-381/P-256/Brainpool
cryptography cryptanalysis statistical-analysis elliptic-curves secp256k1 complex-multiplication ecdlp
-
Updated
Apr 30, 2026 - TeX
GPU-accelerated elliptic curve cycle search over p = 2^255 - 19 using CUDA-parallel Cornacchia solving, Jacobi filtering, and full twist order
rust cryptography parallel-computing cuda curve25519 modular-arithmetic elliptic-curves gpu-computing number-theory pollard-rho miller-rabin complex-multiplication tonelli-shanks prime-sieve jacobi-symbol montgomery-multiplication curve-cycles cornacchia-algorithm twist-security crandall-primes
-
Updated
Apr 12, 2026 - Rust
Anonymous paper on certified continuation methods for Mahler measure identities at CM points, proving twelve conjectures of Samart with rigorous interval arithmetic.
interval-arithmetic number-theory complex-multiplication modular-forms l-functions special-values mahler-measure cm-points heegner-points
-
Updated
Sep 21, 2026
Elliptic curve 2-cycle realize pipeline: constructs CM-method curve pairs over p = 2^255-19 for recursive proof composition (IVC/SNARK/FCMP++). Finds polynomial roots over finite fields, converts class invariants to j-invariants, and emits short Weierstrass parameters with twist security analysis
cryptography cmake curve25519 finite-fields cpp17 elliptic-curves gmp number-theory ntl polynomial-roots snark complex-multiplication weierstrass-curves ivc fcmp recursive-proofs class-polynomials modular-polynomials twist-security proof-composition
-
Updated
Apr 13, 2026 - C++
A low-level C implementation of the algorithms to compute class polynomials. Mirrored from Andrew Sutherland's MIT page with additional functionality bolted on.
c cryptography cmake parallel-computing mathematics arbitrary-precision finite-fields elliptic-curves gmp number-theory chinese-remainder-theorem isogeny computational-number-theory complex-multiplication hilbert-class-polynomial algebraic-number-theory class-field-theory imaginary-quadratic-fields class-polynomials modular-polynomials
-
Updated
Apr 3, 2026 - C
Add this topic to your repo
To associate your repository with the complex-multiplication topic, visit your repo's landing page and select "manage topics."