Paper 2009/108
Further Results on Implicit Factoring in Polynomial Time
Santanu Sarkar and Subhamoy Maitra
Abstract
In PKC 2009, May and Ritzenhofen presented interesting problems related to factoring large integers with some implicit hints. One
of the problems is as follows. Consider
Note: Substantial Revision
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Implicit InformationPrime Factorization.
- Contact author(s)
- subho @ isical ac in
- History
- 2009-03-30: last of 3 revisions
- 2009-03-11: received
- See all versions
- Short URL
- https://ia.cr/2009/108
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/108, author = {Santanu Sarkar and Subhamoy Maitra}, title = {Further Results on Implicit Factoring in Polynomial Time}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/108}, year = {2009}, url = {https://eprint.iacr.org/2009/108} }