Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MPC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MPFR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0502097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distinguishing prime numbers from composite numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curves and Primality Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Points S-entiers des courbes elliptiques. (S-integral points of elliptic curves) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharpening ``Primes is in P'' for a large family of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curves with a Given Number of Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality Testing and Jacobi Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of class polynomial computation via floating point approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decomposition of Polynomials with Known Galois Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular curves of composite level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class invariants by Shimura's reciprocity law / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality testing using elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvability by radicals from an algorithmic point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of class numbers of quadratic number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast convolutions meet Montgomery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4831122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4402415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cornacchia's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weber's class invariants revisited / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56059199 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060377935 / rank
 
Normal rank

Latest revision as of 08:30, 30 July 2024

scientific article
Language Label Description Also known as
English
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
scientific article

    Statements

    Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (English)
    0 references
    0 references
    2 February 2007
    0 references
    primality proving
    0 references
    ECPP algorithm
    0 references
    complex multiplication
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references