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, [S. l.], v. 3, n. 2, p. O1-O62, 2025. DOI: 10.59973/ipil.171. Disponível em: https://ipipublishing.org/index.php/ipil/article/view/171. Acesso em: 3 apr. 2025.