On the Ultimate Paradox of P=NP and the Architectural Collapse of Cryptographic Generation Mechanisms — Paradigm Reconstruction Based on Potential-Infinity Topological Dimension Reduction and Pre-Cognitive Packet Causal Collision
This work re-examines the foundational assumptions of modern asymmetric cryptography, including RSA and elliptic curve cryptography (ECC), as well as the classical framing of the P versus NP problem. It puts forward a self-referential collision trap inherent to deterministic, open cryptographic generation rules. Using the framework of potential-infinity topology and pre-cognitive packets, this paper analyzes the geometric symmetry property of elliptic curves in finite fields and discusses the paradigm shift of complexity boundaries. The argument is purely theoretical and focuses on the internal logical paradox of existing cryptographic complexity hypotheses.
Authors
- Liu Yi-chuan
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.5281/zenodo.24154039
- Primary Topic
- Cryptography and Data Security
- Type
- preprint