Kangaroos, monopoly and discrete logarithms
From MaRDI portal
Publication:1590361
DOI10.1007/s001450010010zbMath0979.11057OpenAlexW1966714372WikidataQ127011553 ScholiaQ127011553MaRDI QIDQ1590361
Publication date: 19 February 2002
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001450010010
Related Items
Adaptive Simulation Security for Inner Product Functional Encryption ⋮ On index calculus algorithms for subfield curves ⋮ Tightly secure signatures from lossy identification schemes ⋮ Bad Directions in Cryptographic Hash Functions ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Computing discrete logarithms with the parallelized kangaroo method. ⋮ A non-uniform birthday problem with applications to discrete logarithms ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates ⋮ Computing low-weight discrete logarithms ⋮ Computing discrete logarithms in an interval ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Elliptic curve cryptosystems in the presence of permanent and transient faults ⋮ The parallelized Pollard kangaroo method in real quadratic function fields ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ Improvement of FPPR method to solve ECDLP ⋮ Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Computing Interval Discrete Logarithm Problem with Restricted Jump Method ⋮ Quantifying the security cost of migrating protocols to practice
