Pollard's kangaroo algorithm
Semantic Scholar uses AI to extract papers important to this topic.
- Adv. in Math. of Comm.
The negation map can be used to speed up the computation of elliptic curve discrete logarithms using either the baby-step giant… (More)
The interval discrete logarithm problem is defined as follows: Given some g, h in a group G, and some N ∈ N such that gz = h for… (More)
Side-channel attacks are a powerful tool to discover the cryptographic secrets of a chip or other device but only too often do… (More)
Even if the asynchronous machine is widely used in industrial process under speed variable, we have to monitor the process which… (More)
- IACR Cryptology ePrint Archive
In [BKT11] Baba, Kotyada and Teja introduced the FACTOR problem over non-abelian groups as base of an ElGamal-like cryptosystem… (More)
The discrete logarithm problem in an interval of size N in a group G is: Given g, h ∈ G and an integer N to find an integer 0 ≤ n… (More)
The Boneh-Boyen signature scheme is a pairing based short signature scheme which is provably secure in the standard model under… (More)
This paper presents a discrete optimization system implementing a parallel hybrid metaheuristic. This is obtained by joining a… (More)
In this paper we present the first lattice attack on an authenticated key agreement protocol, which does not use a digital… (More)
We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we… (More)