Paper 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
Published elsewhere. Unknown where it was published
Contact author(s)
stanek @ dcs fmph uniba sk
History
2011-02-01: received
Short URL
https://ia.cr/2011/059
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2011/059}},
      url = {https://eprint.iacr.org/2011/059}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.