Welcome to the resource topic for 2011/483
Title:
Adaption of Pollard’s kangaroo algorithm to the FACTOR problem
Authors: Mario Romsy
Abstract:In \cite{BKT11} Baba, Kotyada and Teja introduced the FACTOR problem over non-abelian groups as base of an ElGamal-like cryptosystem. They conjectured that there is no better method than the naive one to solve the FACTOR problem in a general group. Shortly afterwards Stanek published an extension of the baby-step giant-step algorithm disproving this conjecture \cite{Sta11}. Since baby-step giant-step methods are limited in practice because of memory requirements we present a modification of Pollard’s kangaroo algorithm that solves the FACTOR problem requiring only negligible memory.
ePrint: https://eprint.iacr.org/2011/483
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .