[1]
T. Nestor, “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, vol. 3, no. 2, pp. O1-O62, Mar. 2025.