Counting Points in Medium Characteristic Using Kedlaya's Algorithm (Q4651432): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NTL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006720508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting points on curves and Abelian varieties over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing zeta functions of Kummer curves via multiplicative characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of canonical lifts of elliptic curves and its application to point counting. / 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: Satoh's algorithm in characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank

Latest revision as of 18:17, 7 June 2024

scientific article; zbMATH DE number 2135720
Language Label Description Also known as
English
Counting Points in Medium Characteristic Using Kedlaya's Algorithm
scientific article; zbMATH DE number 2135720

    Statements

    Counting Points in Medium Characteristic Using Kedlaya's Algorithm (English)
    0 references
    0 references
    0 references
    21 February 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cryptography
    0 references
    hyperelliptic curves
    0 references
    Kedlaya's algorithm
    0 references
    \(p\)-adic cohomology
    0 references
    point counting
    0 references
    0 references
    0 references
    0 references