Paper 2019/1117
NP-completeness Reduction for Semiprimes Factorization Problem
Yen-Lung Lai
Abstract
We show a reduction of integer (semiprimes) factorization problem to a $NP$-complete problem related to coding. Our results rigorously imply the existence of a quantum computer could possibly devastate existing security system relies on NP-hard problem.
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Applications
- Publication info
- Preprint. MINOR revision.
- Keywords
- Integer FactorizationNP-complete ProblemsComplexity Theory
- Contact author(s)
- yenlung lai @ monash edu
- History
- 2019-10-03: withdrawn
- 2019-10-01: received
- See all versions
- Short URL
- https://ia.cr/2019/1117
- License
-
CC BY
