"NP-completeness Reduction for Semiprimes Factorization Problem."

> Home

Details and statistics

DOI: —

access: open

type: Withdrawn Item

metadata version: 2023-04-01

- view
  - electronic edition @ iacr.org (open access)
- export record
  dblp key:
  - journals/iacr/Lai19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/Lai19
(Withdrawn) NP-completeness Reduction for Semiprimes Factorization Problem. IACR Cryptol. ePrint Arch. 2019: 1117 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.