Skip to content
#

complex-multiplication

Here are 9 public repositories matching this topic...

GPU-accelerated elliptic curve cycle search over p = 2^255 - 19 using CUDA-parallel Cornacchia solving, Jacobi filtering, and full twist order

  • Updated Apr 12, 2026
  • Rust

Manuscript, certified computations and data for "Recovering the level of distribution x^{1/2} for the orders of y² = x³ − x modulo p": the Iwaniec–Jiménez Urroz P₂ theorem holds as stated, and Xie's prime-power bounds improve to P₃ and ⌊2.05(ℓ−1)+1.2⌋.

  • Updated Oct 17, 2026
  • TeX

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

  • Updated Apr 13, 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."

Learn more