Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-011-9599-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041584779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte Carlo Factoring Algorithm With Linear Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo Methods for Index Computation (mod p) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Distributions Related to Random Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Binary Edwards / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Correct Use of the Negation Map in the Pollard rho Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Use of the Negation Map in the Pollard Rho Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of the Eighth Fermat Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random walks for Pollard's rho method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the parallelized Pollard lambda search on anomalous binary curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monte carlo method for factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel collision search with cryptanalytic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250816 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:35, 6 July 2024

scientific article
Language Label Description Also known as
English
Speeding up elliptic curve discrete logarithm computations with point halving
scientific article

    Statements

    Speeding up elliptic curve discrete logarithm computations with point halving (English)
    0 references
    0 references
    0 references
    3 April 2013
    0 references
    Pollard rho method
    0 references
    elliptic curve discrete logarithm
    0 references
    point halving
    0 references
    random walk
    0 references

    Identifiers

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