(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 2025, 3, O1-O62.