A low-memory algorithm for point counting on Picard curves (Q2491278): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-005-1598-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075598124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point counting on Picard curves in large characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel collision search with cryptanalytic applications / rank
 
Normal rank

Latest revision as of 15:10, 24 June 2024

scientific article
Language Label Description Also known as
English
A low-memory algorithm for point counting on Picard curves
scientific article

    Statements

    Identifiers

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