swMATH41341MaRDI QIDQ1353858FDOQ1353858
Author name not available (Why is that?)
Official website: https://link.springer.com/chapter/10.1007/978-3-030-17656-3_25
Source code repository: https://github.com/fplll/g6k
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
- Jasmin
- Approximate Voronoi cells for lattices, revisited
- Attacking ECDSA leaking discrete bits with a more efficient lattice
- Predicting the concrete security of LWE against the dual attack using binary search
- NTL
- CADO-NFS
- Learning strikes again: the case of the DRS signature scheme
- HElib
- BKZ
- DeepLLL
- PotLLL
- fpLLL
- FALCONN
- Falcon
- fpylll
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- BIKE
- FROST
- MuSig2
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Towards faster polynomial-time lattice reduction
- Solving the search-LWE problem over projected lattices
- Lower bounds on lattice sieving and information set decoding
This page was built for software: G6K
