Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation (Q2971023): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular polynomials via isogeny volcanoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing elliptic curve isogenies in quantum subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the endomorphism ring of an ordinary elliptic curve over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing endomorphism rings of elliptic curves under the GRH / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sieve algorithm for the shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting points on elliptic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quaternion -isogeny path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing residue class rings and Picard groups of orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Algorithm for Evaluating Large Degree Isogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs based on GRH with an application to elliptic curve cryptography / rank
 
Normal rank

Latest revision as of 14:43, 13 July 2024

scientific article
Language Label Description Also known as
English
Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
scientific article

    Statements

    Identifiers

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