Accelerating Pollard's rho algorithm on finite fields (Q431795): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 9 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-010-9093-7 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11T71 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11Y16 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6052394 / rank
 
Normal rank
Property / zbMATH Keywords
 
discrete logarithm problem
Property / zbMATH Keywords: discrete logarithm problem / rank
 
Normal rank
Property / zbMATH Keywords
 
Pollard's rho
Property / zbMATH Keywords: Pollard's rho / rank
 
Normal rank
Property / zbMATH Keywords
 
\(r\)-adding walk
Property / zbMATH Keywords: \(r\)-adding walk / rank
 
Normal rank
Property / zbMATH Keywords
 
distinguished point
Property / zbMATH Keywords: distinguished point / rank
 
Normal rank
Property / zbMATH Keywords
 
finite field
Property / zbMATH Keywords: finite field / rank
 
Normal rank
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-010-9093-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011765981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Monte Carlo factorization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding Up the Pollard Rho Method on Prime Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of logarithms in fields of characteristic two / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502491 / 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: Q3973158 / 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: Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle detection using a stack / 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: Monte Carlo Methods for Index Computation (mod p) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kangaroos, monopoly and discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802307 / 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: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Cycles in Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840196 / 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: Computing discrete logarithms with the parallelized kangaroo method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel collision search with cryptanalytic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and normal bases for finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250816 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-010-9093-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Accelerating Pollard's rho algorithm on finite fields
scientific article

    Statements

    Accelerating Pollard's rho algorithm on finite fields (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2012
    0 references
    discrete logarithm problem
    0 references
    Pollard's rho
    0 references
    \(r\)-adding walk
    0 references
    distinguished point
    0 references
    finite field
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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