Extending Baby-step Giant-step algorithm for FACTOR problem

Martin Stanek

Paper 2011/059 Original: eprint.iacr.org/2011/059 ↗

Extending Baby-step Giant-step algorithm for FACTOR problem

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.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2011-02-01: last updated; 2011-02-01: published
Short URL: https://ia.cr/2011/059
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2011/059,
      author = {Martin Stanek},
      title = {Extending Baby-step Giant-step algorithm for FACTOR problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/059},
      year = {2011},
      url = {https://eprint.iacr.org/2011/059}
}