Improved lattice enumeration algorithms by primal and dual reordering methods
Abstract The security of lattice‐based cryptosystems is generally based on the hardness of the Shortest Vector Problem (SVP). The original enumeration (ENUM) algorithm solving SVP runs in exponential time due to the exhaustive search, which is used as a subroutine for the block Korkin–Zolotarev (BKZ...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-IET
2023-01-01
|
| Series: | IET Information Security |
| Online Access: | https://doi.org/10.1049/ise2.12083 |