Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2012.03.019 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2012.03.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058130972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient signature generation by smart cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718617 / 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: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short signatures from the Weil pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474195 / 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: Improving the parallelized Pollard lambda search on anomalous binary curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel collision search with cryptanalytic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Distributions Related to Random Mappings / 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: Q3840196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of the Eighth Fermat Number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2012.03.019 / rank
 
Normal rank

Latest revision as of 17:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Improved Pollard rho method for computing discrete logarithms over finite extension fields
scientific article

    Statements

    Improved Pollard rho method for computing discrete logarithms over finite extension fields (English)
    0 references
    0 references
    0 references
    3 August 2012
    0 references
    Pollard rho method
    0 references
    normal basis representation
    0 references
    discrete logarithm
    0 references

    Identifiers