Welcome to the resource topic for 2011/059
Title:
Extending Baby-step Giant-step algorithm for FACTOR problem
Authors: Martin Stanek
Abstract:Recently, a non-abelian factorization problem together with an associated asymmetric encryption scheme were introduced in [1]. We show how a classical baby-step giant-step algorithm for discrete logarithm can be extended to this problem. This contradicts the claims regarding the complexity of the proposed problem.
ePrint: https://eprint.iacr.org/2011/059
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 .