Cryptology ePrint Archive: Report 2019/1117

Available versions in chronological order


NP-completeness Reduction for Semiprimes Factorization Problem
Yen-Lung Lai

NP-completeness Reduction for Semiprimes Factorization Problem
Yen-Lung Lai


[ Cryptology ePrint archive ]