1.
Nestor T. Theoretical Approaches to Solving the Shortest Vector Problem in NP-Hard Lattice-Based Cryptography with Post-SUSY Theories of Quantum Gravity in Polynomial Time by Orch-Or. IPI Letters [Internet]. 2025 Mar. 10 [cited 2025 Apr. 4];3(2):O1-O62. Available from: https://ipipublishing.org/index.php/ipil/article/view/171