Cited in
(26)- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- Approximate Voronoi cells for lattices, revisited
- NTL
- CADO-NFS
- HElib
- BKZ
- DeepLLL
- PotLLL
- fpLLL
- FALCONN
- Falcon
- fpylll
- BIKE
- Attacking ECDSA leaking discrete bits with a more efficient lattice
- Predicting the concrete security of LWE against the dual attack using binary search
- Learning strikes again: the case of the DRS signature scheme
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Towards faster polynomial-time lattice reduction
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Solving the search-LWE problem over projected lattices
- Lower bounds on lattice sieving and information set decoding
- FROST
- MuSig2
- Jasmin
This page was built for software: G6K
