Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Cryptol

Search In Journal Title:

Abbravation: Journal of Cryptology

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1007/s004420050495

Search In DOI:

ISSN

1432-1378

Search In ISSN:
Search In Title Of Papers:

Accelerating Pollard’s Rho Algorithm on Finite Fie

Authors: Jung Hee Cheon Jin Hong Minkyu Kim
Publish Date: 2010/11/12
Volume: 25, Issue: 2, Pages: 195-242
PDF Link

Abstract

In this work we develop a technique for traveling through the random graph without fully computing each node and also provide an extension to the distinguished point collision detection method that is suitable for this new situation Concrete constructions of this technique for multiplicative subgroups of the finite fields are given Our implementations confirm that the proposed technique provides practical speedup over existing algorithms

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
  2. Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation
  3. Formal Proofs for the Security of Signcryption
  4. Concurrent Knowledge Extraction in Public-Key Models
  5. Jacobian Coordinates on Genus 2 Curves
  6. On the Amortized Complexity of Zero-Knowledge Protocols
  7. On the Efficient Generation of Prime-Order Elliptic Curves
  8. Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
  9. The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm
  10. Constant-Round Oblivious Transfer in the Bounded Storage Model
  11. The Discrete Logarithm Problem on Elliptic Curves of Trace One
  12. Short Signatures from Diffie–Hellman: Realizing Almost Compact Public Key
  13. Integral Cryptanalysis on Full MISTY1
  14. Integral Cryptanalysis on Full MISTY1
  15. Universally Composable Symbolic Security Analysis
Search Result: