The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences (Q3644209): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167334956 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0803.0728 / 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: Memoir on Elliptic Divisibility Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity mod \(q\) of elliptic sequences and \(S\)-integral points on elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common divisors of elliptic divisibility sequences over function fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-adic properties of division polynomials and elliptic divisibility sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive divisors of elliptic divisibility sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic nets and elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tate Pairing Via Elliptic Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\) / rank
 
Normal rank

Latest revision as of 03:21, 2 July 2024

scientific article
Language Label Description Also known as
English
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
scientific article

    Statements

    The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences (English)
    0 references
    0 references
    0 references
    3 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references