The optimal LLL algorithm is still polynomial in fixed dimension
Theoretical Computer Science - Latin American theoretical informatics
Low-dimensional lattice basis reduction revisited
ACM Transactions on Algorithms (TALG)
Analyzing blockwise lattice algorithms using dynamical systems
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Hi-index | 0.00 |