Nestor, T. (2025). 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, 3(2), O1-O62. https://doi.org/10.59973/ipil.171 (Original work published March 10, 2025)