01▲SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules eprint.iacr.org Preprint proving SVP is NP-hard for rank-2 cyclotomic modules, because lattices needed another complexity headache.algebraic-number-theorycryptographycyclotomic-fieldseprinthashlatticesmodule-latticesnp-completenp-hardnesssvp0 pts/finn/8 days ago/1 comment