@misc{accs-arxiv-2022,
  author = {Divesh Aggarwal and Yanlin Chen and Rajendra Kumar and Yixin Shen},
  title = {{Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding}},
  booktitle = {SIAM Journal on Computing 54(2):233–278 (2025)},
  year = {2025},
  url = {https://arxiv.org/abs/2002.07955v5},
  keywords = {SVP, BDD, quantum, time-space tradeoffs},
  cr_date = {2022-05-10},
  cr_status = {published},
  cr_venue = {SIAM Journal on Computing 54(2):233–278 (2025)},
  cr_author_ids = {divesh-aggarwal; yanlin-chen; rajendra-kumar; yixin-shen}
}

@inproceedings{accs-stacs-2021,
  author = {Divesh Aggarwal and Yanlin Chen and Rajendra Kumar and Yixin Shen},
  title = {{Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding}},
  booktitle = {STACS 2021},
  year = {2021},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.4},
  keywords = {SVP, BDD, quantum, no QRAM},
  cr_date = {2021-03-10},
  cr_status = {published},
  cr_venue = {STACS 2021},
  cr_author_ids = {divesh-aggarwal; yanlin-chen; rajendra-kumar; yixin-shen}
}

@inproceedings{aggarwal-mukhopadhyay-2018-infinity,
  author = {Divesh Aggarwal and Priyanka Mukhopadhyay},
  title = {{Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm}},
  booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
  year = {2018},
  url = {https://arxiv.org/abs/1801.02358},
  cr_date = {2018-01-08},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {ISAAC 2018},
  cr_author_ids = {divesh-aggarwal; priyanka-mukhopadhyay},
  note = {arXiv:1801.02358; checked version v2, 15 May 2018}
}

@misc{aggarwal-morolia-stephens-davidowitz-2026-spherical,
  author = {Divesh Aggarwal and Aditya Morolia and Noah Stephens-Davidowitz},
  title = {{Faster Provable Lattice Sieving with Spherical Codes}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/2388},
  howpublished = {Cryptology {ePrint} Archive, Paper 2026/2388},
  keywords = {SVP, approximation, provable sieving, spherical codes},
  cr_date = {2026-10-07},
  cr_date_precision = {day},
  cr_status = {preprint},
  cr_venue = {Cryptology ePrint Archive 2026/2388},
  cr_author_ids = {divesh-aggarwal; aditya-morolia; noah-stephens-davidowitz}
}

@inproceedings{aggarwal-stephens-davidowitz-2017-average,
  author = {Divesh Aggarwal and Noah Stephens-Davidowitz},
  title = {{Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP)}},
  booktitle = {Symposium on Simplicity in Algorithms (SOSA 2018)},
  year = {2018},
  url = {https://arxiv.org/abs/1709.01535},
  cr_date = {2017-09-05},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {SOSA 2018},
  cr_author_ids = {divesh-aggarwal; noah-stephens-davidowitz},
  note = {arXiv:1709.01535, first submitted 5 September 2017}
}

@article{aharonov-regev-2005,
  author = {Dorit Aharonov and Oded Regev},
  title = {{Lattice Problems in NP ∩ coNP}},
  year = {2005},
  doi = {10.1145/1089023.1089025},
  url = {https://cims.nyu.edu/~regev/papers/cvpconp.pdf},
  keywords = {CVP, lattice algorithms},
  cr_date = {2005-09-08},
  cr_status = {published},
  cr_venue = {Journal of the ACM},
  cr_author_ids = {dorit-aharonov; oded-regev},
  howpublished = {Journal of the ACM}
}

@inproceedings{ajtai-kumar-sivakumar-2001,
  author = {Miklós Ajtai and Ravi Kumar and Dandapani Sivakumar},
  title = {{A sieve algorithm for the shortest lattice vector problem}},
  booktitle = {Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing},
  year = {2001},
  pages = {601--610},
  doi = {10.1145/380752.380857},
  url = {https://doi.org/10.1145/380752.380857},
  cr_date = {2001-07-06},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {STOC 2001},
  cr_author_ids = {miklos-ajtai; ravi-kumar; dandapani-sivakumar}
}

@inproceedings{ajtai-kumar-sivakumar-2002,
  author = {Miklós Ajtai and Ravi Kumar and D. Sivakumar},
  title = {{Sampling short lattice vectors and the closest lattice vector problem}},
  year = {2002},
  doi = {10.1109/CCC.2002.1004339},
  url = {https://doi.org/10.1109/CCC.2002.1004339},
  keywords = {CVP, lattice algorithms},
  cr_date = {2002-05-21},
  cr_status = {published},
  cr_venue = {CCC 2002},
  cr_author_ids = {miklos-ajtai; ravi-kumar; d-sivakumar},
  howpublished = {CCC 2002}
}

@misc{albrecht-cid-faugere-perret2014-algebraic,
  author = {Martin R. Albrecht and Carlos Cid and Jean-Charles Faugère and Ludovic Perret},
  title = {{Algebraic Algorithms for LWE}},
  year = {2014},
  url = {https://eprint.iacr.org/2014/1018},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2015-02-26},
  cr_date_precision = {day},
  cr_status = {preprint},
  cr_venue = {Cryptology ePrint Archive, Paper 2014/1018},
  cr_author_ids = {martin-r-albrecht; carlos-cid; jean-charles-faugere; ludovic-perret},
  note = {Cryptology ePrint Archive, Paper 2014/1018}
}

@misc{albrecht-fitzpatrick-goepfert2013-usvp,
  author = {Martin R. Albrecht and Robert Fitzpatrick and Florian Göpfert},
  title = {{On the Efficacy of Solving LWE by Reduction to Unique-SVP}},
  year = {2014},
  url = {https://eprint.iacr.org/2013/602},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2013-09-23},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {ICISC 2013 revised selected papers, LNCS 8565, pp. 293–310; DOI 10.1007/978-3-319-12160-4_18},
  cr_author_ids = {martin-r-albrecht; robert-fitzpatrick; florian-gopfert},
  note = {ICISC 2013 revised selected papers, LNCS 8565, pp. 293–310; DOI 10.1007/978-3-319-12160-4_18}
}

@misc{albrecht-player-scott2015-concrete,
  author = {Martin R. Albrecht and Rachel Player and Sam Scott},
  title = {{On the concrete hardness of Learning with Errors}},
  year = {2015},
  url = {https://eprint.iacr.org/2015/046},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2015-01-20},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Journal of Mathematical Cryptology 9(3), pp. 169–203; DOI 10.1515/jmc-2015-0016},
  cr_author_ids = {martin-r-albrecht; rachel-player; sam-scott},
  note = {Journal of Mathematical Cryptology 9(3), pp. 169–203; DOI 10.1515/jmc-2015-0016}
}

@inproceedings{albrecht2014-lazy-modulus,
  author = {Martin R. Albrecht and Jean-Charles Faugère and Robert Fitzpatrick and Ludovic Perret},
  title = {{Lazy Modulus Switching for the BKW Algorithm on LWE}},
  booktitle = {Public-Key Cryptography -- PKC 2014},
  year = {2014},
  volume = {8383},
  pages = {429--445},
  publisher = {Springer},
  url = {https://eprint.iacr.org/2014/019},
  keywords = {LWE, BKW, lazy modulus switching},
  cr_date = {2014-01-08},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Public-Key Cryptography — PKC 2014, LNCS 8383},
  cr_author_ids = {martin-r-albrecht; jean-charles-faugere; robert-fitzpatrick; ludovic-perret},
  series = {Lecture Notes in Computer Science}
}

@misc{albrecht2017-dual-small-secret,
  author = {Martin R. Albrecht},
  title = {{On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL}},
  year = {2017},
  url = {https://eprint.iacr.org/2017/047},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2017-05-06},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {EUROCRYPT 2017, LNCS 10210, pp. 103–129; DOI 10.1007/978-3-319-56614-6_4},
  cr_author_ids = {martin-r-albrecht},
  note = {EUROCRYPT 2017, LNCS 10210, pp. 103–129; DOI 10.1007/978-3-319-56614-6_4}
}

@misc{apon2026,
  author = {Daniel Apon},
  title = {{An Algebraic-Geometry Lower Bound against the ePrint:2026/1747 McEliece Key-Recovery Attack}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1810},
  cr_date = {2026-08-26},
  cr_status = {preprint},
  cr_author_ids = {daniel-apon}
}

@misc{arora-ge2010-eccc,
  author = {Sanjeev Arora and Rong Ge},
  title = {{New Algorithms for Learning in Presence of Errors}},
  year = {2011},
  url = {https://eccc.weizmann.ac.il/report/2010/066/},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2010-12-13},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {ICALP 2011, Part I, LNCS 6755, pp. 403–415; DOI 10.1007/978-3-642-22006-7_34},
  cr_author_ids = {sanjeev-arora; rong-ge},
  note = {ICALP 2011, Part I, LNCS 6755, pp. 403–415; DOI 10.1007/978-3-642-22006-7_34}
}

@misc{bai-galbraith2013-binary-lwe,
  author = {Shi Bai and Steven D. Galbraith},
  title = {{Lattice Decoding Attacks on Binary LWE}},
  year = {2014},
  url = {https://eprint.iacr.org/2013/839},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2013-12-16},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {ACISP 2014, LNCS 8544, pp. 322–337; DOI 10.1007/978-3-319-08344-5_21},
  cr_author_ids = {shi-bai; steven-d-galbraith},
  note = {ACISP 2014, LNCS 8544, pp. 322–337; DOI 10.1007/978-3-319-08344-5_21}
}

@article{bai-laarhoven-stehle-2016,
  author = {Shi Bai and Thijs Laarhoven and Damien Stehlé},
  title = {{Tuple lattice sieving}},
  journal = {LMS Journal of Computation and Mathematics},
  year = {2016},
  doi = {10.1112/S1461157016000292},
  url = {https://eprint.iacr.org/2016/713},
  keywords = {SVP, lattice sieving},
  cr_date = {2016-07-21},
  cr_status = {published},
  cr_venue = {LMS Journal of Computation and Mathematics},
  cr_author_ids = {shi-bai; thijs-laarhoven; damien-stehle}
}

@misc{bbhl20,
  author = {Gustavo Banegas and Daniel J. Bernstein and Iggy van Hoof and Tanja Lange},
  title = {{Concrete quantum cryptanalysis of binary elliptic curves}},
  journal = {IACR Transactions on Cryptographic Hardware and Embedded Systems 2021(1)},
  year = {2021},
  url = {https://eprint.iacr.org/2020/1296},
  keywords = {quantum, elliptic curves, binary fields, logical resources},
  cr_date = {2020-10-19},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {IACR Transactions on Cryptographic Hardware and Embedded Systems 2021(1)},
  cr_author_ids = {gustavo-banegas; daniel-j-bernstein; iggy-van-hoof; tanja-lange}
}

@misc{bfss11,
  author = {Magali Bardet and Jean-Charles Faugère and Bruno Salvy and Pierre-Jean Spaenlehauer},
  title = {{On the Complexity of Solving Quadratic Boolean Systems}},
  year = {2013},
  doi = {10.1016/j.jco.2012.07.001},
  url = {https://arxiv.org/abs/1112.6263},
  keywords = {MQ, BooleanSolve, Boolean systems},
  cr_date = {2011-12-29},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Journal of Complexity 29(1):53–75},
  cr_author_ids = {magali-bardet; jean-charles-faugere; bruno-salvy; pierre-jean-spaenlehauer}
}

@misc{bgjt13,
  author = {Razvan Barbulescu and Pierrick Gaudry and Antoine Joux and Emmanuel Thomé},
  title = {{A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic}},
  journal = {EUROCRYPT 2014 (published as A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic)},
  year = {2014},
  doi = {10.1007/978-3-642-55220-5_1},
  url = {https://arxiv.org/abs/1306.4244},
  keywords = {discrete logarithms, small characteristic, quasi-polynomial},
  cr_date = {2013-06-18},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {EUROCRYPT 2014 (published as A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic)},
  cr_author_ids = {razvan-barbulescu; pierrick-gaudry; antoine-joux; emmanuel-thome}
}

@misc{bjs14,
  author = {Jean-François Biasse and David Jao and Anirudh Sankar},
  title = {{A quantum algorithm for computing isogenies between supersingular elliptic curves}},
  year = {2014},
  doi = {10.1007/978-3-319-13039-2_25},
  url = {https://cacr.uwaterloo.ca/techreports/2014/cacr2014-24.pdf},
  keywords = {supersingular isogenies, quantum, GRH},
  cr_date = {2014-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {INDOCRYPT 2014},
  cr_author_ids = {jean-francois-biasse; david-jao; anirudh-sankar}
}

@misc{bkw19-mq,
  author = {Andreas Björklund and Petteri Kaski and Ryan Williams},
  title = {{Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction}},
  year = {2019},
  doi = {10.4230/LIPIcs.ICALP.2019.26},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.26},
  keywords = {MQ, parity counting, polynomial method},
  cr_date = {2019-07-04},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {ICALP 2019},
  cr_author_ids = {andreas-bjorklund; petteri-kaski; ryan-williams}
}

@inproceedings{bkw2000-noise-tolerant,
  author = {Avrim Blum and Adam Kalai and Hal Wasserman},
  title = {{Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model}},
  booktitle = {Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing},
  year = {2000},
  pages = {435--440},
  publisher = {ACM},
  url = {https://arxiv.org/abs/cs/0010022},
  keywords = {LPN, BKW, subexponential algorithms},
  cr_date = {2000-10-15},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {STOC 2000; Journal of the ACM 50(4), 2003},
  cr_author_ids = {avrim-blum; adam-kalai; hal-wasserman},
  archiveprefix = {arXiv},
  eprint = {cs/0010022},
  note = {Journal version: Journal of the ACM 50(4):506--519, 2003, doi:10.1145/792538.792543}
}

@inproceedings{blomer-2000,
  author = {Johannes Blömer},
  title = {{Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices}},
  year = {2000},
  doi = {10.1007/3-540-45022-X_22},
  url = {https://doi.org/10.1007/3-540-45022-X_22},
  keywords = {CVP, lattice algorithms},
  cr_date = {2000-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {ICALP 2000},
  cr_author_ids = {johannes-blomer},
  howpublished = {ICALP 2000}
}

@misc{blomer-naewe-2011,
  author = {Johannes Blömer and Stefanie Naewe},
  title = {{Solving the Closest Vector Problem with respect to ℓp Norms}},
  year = {2011},
  url = {https://arxiv.org/abs/1104.3720},
  keywords = {CVP, lattice algorithms},
  cr_date = {2011-04-19},
  cr_status = {preprint},
  cr_venue = {arXiv:1104.3720},
  cr_author_ids = {johannes-blomer; stefanie-naewe},
  howpublished = {arXiv:1104.3720}
}

@misc{blp2010,
  author = {Daniel J. Bernstein and Tanja Lange and Christiane Peters},
  title = {{Smaller decoding exponents: ball-collision decoding}},
  year = {2011},
  url = {https://eprint.iacr.org/2010/585},
  cr_date = {2010-11-18},
  cr_status = {published},
  cr_venue = {CRYPTO 2011},
  cr_author_ids = {daniel-j-bernstein; tanja-lange; christiane-peters}
}

@incollection{blp93,
  author = {Joe P. Buhler and Hendrik W. Lenstra Jr. and Carl Pomerance},
  title = {{Factoring integers with the number field sieve}},
  booktitle = {The Development of the Number Field Sieve},
  year = {1993},
  doi = {10.1007/BFb0091539},
  url = {https://doi.org/10.1007/BFb0091539},
  keywords = {factoring, general number field sieve},
  cr_date = {1993-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {The Development of the Number Field Sieve},
  cr_author_ids = {joe-p-buhler; hendrik-w-lenstra-jr; carl-pomerance}
}

@misc{both-may2017-high-error,
  author = {Leif Both and Alexander May},
  title = {{Decoding Linear Codes with High Error Rate and its Impact for LPN Security}},
  year = {2018},
  url = {https://eprint.iacr.org/2017/1139},
  cr_date = {2017-11-27},
  cr_status = {published},
  cr_venue = {PQCrypto 2018},
  cr_author_ids = {leif-both; alexander-may}
}

@misc{buchmann-goepfert-player-wunderer2016-hybrid,
  author = {Johannes Buchmann and Florian Göpfert and Rachel Player and Thomas Wunderer},
  title = {{On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack}},
  year = {2016},
  url = {https://eprint.iacr.org/2016/089},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2016-04-13},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {AFRICACRYPT 2016, LNCS 9646, pp. 24–43},
  cr_author_ids = {johannes-buchmann; florian-gopfert; rachel-player; thomas-wunderer},
  note = {AFRICACRYPT 2016, LNCS 9646, pp. 24–43}
}

@misc{by17-mq,
  author = {Daniel J. Bernstein and Bo-Yin Yang},
  title = {{Asymptotically faster quantum algorithms to solve multivariate quadratic equations}},
  year = {2018},
  doi = {10.1007/978-3-319-79063-3_23},
  url = {https://eprint.iacr.org/2017/1206},
  keywords = {MQ, quantum mesh, area-time},
  cr_date = {2017-12-18},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {PQCrypto 2018},
  cr_author_ids = {daniel-j-bernstein; bo-yin-yang}
}

@misc{cd22,
  author = {Wouter Castryck and Thomas Decru},
  title = {{An efficient key recovery attack on SIDH}},
  year = {2023},
  doi = {10.1007/978-3-031-30589-4_15},
  url = {https://eprint.iacr.org/2022/975},
  keywords = {SIDH, SIKE, torsion images},
  cr_date = {2022-07-30},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {EUROCRYPT 2023},
  cr_author_ids = {wouter-castryck; thomas-decru}
}

@misc{ch12,
  author = {Edgar Costa and David Harvey},
  title = {{Faster deterministic integer factorization}},
  journal = {Mathematics of Computation 83, 339–345},
  year = {2014},
  doi = {10.1090/S0025-5718-2013-02707-X},
  url = {https://arxiv.org/abs/1201.2116},
  keywords = {factoring, deterministic},
  cr_date = {2012-01-10},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Mathematics of Computation 83, 339–345},
  cr_author_ids = {edgar-costa; david-harvey}
}

@inproceedings{chailloux-loyer-tuple-2023,
  author = {André Chailloux and Johanna Loyer},
  title = {{Classical and quantum 3 and 4-sieves to solve SVP with low memory}},
  booktitle = {Post-Quantum Cryptography – PQCrypto 2023},
  year = {2023},
  doi = {10.1007/978-3-031-40003-2_9},
  url = {https://eprint.iacr.org/2023/200},
  keywords = {SVP, lattice sieving},
  cr_date = {2023-02-15},
  cr_status = {published},
  cr_venue = {Post-Quantum Cryptography – PQCrypto 2023},
  cr_author_ids = {andre-chailloux; johanna-loyer}
}

@article{chen-chung-lai-2017,
  author = {Yanlin Chen and Kai-Min Chung and Ching-Yi Lai},
  title = {{Space-efficient classical and quantum algorithms for the shortest vector problem}},
  journal = {Quantum Information and Computation},
  year = {2018},
  volume = {18},
  number = {3--4},
  pages = {285--307},
  url = {https://arxiv.org/abs/1709.00378},
  cr_date = {2017-08-31},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Quantum Information and Computation},
  cr_author_ids = {yanlin-chen; kai-min-chung; ching-yi-lai},
  note = {arXiv:1709.00378, first submitted 31 August 2017}
}

@misc{chevignard-fouque-schrottenloher2024,
  author = {Clémence Chevignard and Pierre-Alain Fouque and André Schrottenloher},
  title = {{Reducing the Number of Qubits in Quantum Information Set Decoding}},
  year = {2024},
  url = {https://eprint.iacr.org/2024/907},
  cr_date = {2024-06-06},
  cr_status = {published},
  cr_venue = {ASIACRYPT 2024},
  cr_author_ids = {clemence-chevignard; pierre-alain-fouque; andre-schrottenloher}
}

@misc{cjs10,
  author = {Andrew M. Childs and David Jao and Vladimir Soukharev},
  title = {{Constructing elliptic curve isogenies in quantum subexponential time}},
  year = {2014},
  doi = {10.1515/jmc-2012-0016},
  url = {https://arxiv.org/abs/1012.4019},
  keywords = {ordinary isogenies, quantum hidden shift, GRH},
  cr_date = {2010-12-17},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Journal of Mathematical Cryptology 8(1):1–29},
  cr_author_ids = {andrew-m-childs; david-jao; vladimir-soukharev}
}

@article{coppersmith93,
  author = {Don Coppersmith},
  title = {{Modifications to the Number Field Sieve}},
  journal = {Journal of Cryptology 6, 169–180},
  year = {1993},
  doi = {10.1007/BF00198464},
  url = {https://research.ibm.com/publications/modifications-to-the-number-field-sieve},
  keywords = {factoring, multiple number fields, number field sieve},
  cr_date = {1993-03-31},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {Journal of Cryptology 6, 169–180},
  cr_author_ids = {don-coppersmith}
}

@inproceedings{dadush-bonifas-2014,
  author = {Daniel Dadush and Nicolas Bonifas},
  title = {{Short Paths on the Voronoi Graph and the Closest Vector Problem with Preprocessing}},
  year = {2015},
  url = {https://arxiv.org/abs/1412.6168},
  keywords = {CVP, lattice algorithms},
  cr_date = {2014-12-18},
  cr_status = {published},
  cr_venue = {SODA 2015},
  cr_author_ids = {daniel-dadush; nicolas-bonifas},
  howpublished = {SODA 2015}
}

@inproceedings{dadush-regev-stephens-davidowitz-2014,
  author = {Daniel Dadush and Oded Regev and Noah Stephens-Davidowitz},
  title = {{On the Closest Vector Problem with a Distance Guarantee}},
  booktitle = {CCC 2014},
  year = {2014},
  url = {https://arxiv.org/abs/1409.8063},
  keywords = {BDD, CVPP, preprocessing, distance guarantee},
  cr_date = {2014-09-29},
  cr_status = {published},
  cr_venue = {CCC 2014},
  cr_author_ids = {daniel-dadush; oded-regev; noah-stephens-davidowitz}
}

@misc{deek2023,
  author = {Léo Ducas and Andre Esser and Simona Etinski and Elena Kirshanova},
  title = {{Asymptotics and Improvements of Sieving for Codes}},
  year = {2024},
  url = {https://eprint.iacr.org/2023/1577},
  cr_date = {2023-10-12},
  cr_status = {published},
  cr_venue = {EUROCRYPT 2024},
  cr_author_ids = {leo-ducas; andre-esser; simona-etinski; elena-kirshanova}
}

@misc{delgado26-unconditional-isogeny,
  author = {José Luis Delgado},
  title = {{The Supersingular Isogeny Problem in Time and Memory $p^{1/3+o(1)}$, Unconditionally}},
  year = {2026},
  url = {https://arxiv.org/abs/2609.22018},
  keywords = {supersingular isogenies, unconditional, OneEnd, Las Vegas},
  cr_date = {2026-09-18},
  cr_date_precision = {day},
  cr_status = {preprint},
  cr_venue = {arXiv:2609.22018},
  cr_author_ids = {jose-luis-delgado},
  archiveprefix = {arXiv},
  eprint = {2609.22018},
  primaryclass = {cs.CR}
}

@misc{dg13,
  author = {Christina Delfs and Steven D. Galbraith},
  title = {{Computing isogenies between supersingular elliptic curves over F_p}},
  year = {2016},
  url = {https://arxiv.org/abs/1310.7789},
  keywords = {supersingular isogenies, F_p, random walks},
  cr_date = {2013-10-29},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Designs, Codes and Cryptography 78(2):425–440},
  cr_author_ids = {christina-delfs; steven-d-galbraith}
}

@misc{dhkw24,
  author = {Holger Dell and Anselm Haak and Melvin Kallmayer and Leo Wennmann},
  title = {{Solving Polynomial Equations Over Finite Fields}},
  year = {2025},
  url = {https://arxiv.org/abs/2410.20162},
  keywords = {MQ, finite fields, polynomial method},
  cr_date = {2024-10-26},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {SODA 2025},
  cr_author_ids = {holger-dell; anselm-haak; melvin-kallmayer; leo-wennmann}
}

@misc{dinur20-mq,
  author = {Itai Dinur},
  title = {{Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting}},
  year = {2021},
  url = {https://arxiv.org/abs/2005.04800},
  keywords = {MQ, parity counting, worst-case},
  cr_date = {2020-05-10},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {SODA 2021},
  cr_author_ids = {itai-dinur}
}

@inproceedings{ducas-2017-dimensions-free,
  author = {Léo Ducas},
  title = {{Shortest Vector from Lattice Sieving: a Few Dimensions for Free}},
  booktitle = {EUROCRYPT 2018},
  year = {2018},
  doi = {10.1007/978-3-319-78381-9_5},
  url = {https://eprint.iacr.org/2017/999},
  keywords = {SVP, lattice sieving, dimensions for free, subexponential improvement},
  cr_date = {2017-10-11},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {EUROCRYPT 2018},
  cr_author_ids = {leo-ducas}
}

@misc{eg23,
  author = {Martin Ekerå and Joel Gärtner},
  title = {{Extending Regev's factoring algorithm to compute discrete logarithms}},
  journal = {PQCrypto 2024, LNCS 14772, 211–242},
  year = {2024},
  doi = {10.1007/978-3-031-62746-0_10},
  url = {https://arxiv.org/abs/2311.05545},
  keywords = {quantum, discrete logarithms, prime fields},
  cr_date = {2023-11-09},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {PQCrypto 2024, LNCS 14772, 211–242},
  cr_author_ids = {martin-ekera; joel-gartner}
}

@inproceedings{eisenbrand-venzin-2020,
  author = {Friedrich Eisenbrand and Moritz Venzin},
  title = {{Approximate CVP_p in time 2^(0.802 n)}},
  year = {2020},
  doi = {10.4230/LIPIcs.ESA.2020.43},
  url = {https://arxiv.org/abs/2005.04957},
  keywords = {CVP, lattice algorithms},
  cr_date = {2020-06-16},
  cr_status = {published},
  cr_venue = {ESA 2020},
  cr_author_ids = {friedrich-eisenbrand; moritz-venzin},
  howpublished = {ESA 2020}
}

@misc{elbro-santini2025,
  author = {Freja Elbro and Paolo Santini},
  title = {{Decoupling Support Enumeration and Value Discovery in Non-Binary ISD}},
  year = {2025},
  url = {https://eprint.iacr.org/2025/1523},
  cr_date = {2025-08-25},
  cr_status = {preprint},
  cr_author_ids = {freja-elbro; paolo-santini}
}

@inproceedings{engelberts-et-al-2025,
  author = {Lynn Engelberts and Yanlin Chen and Amin Shiraz Gilani and Maya-Iggy van Hoof and Stacey Jeffery and Ronald de Wolf},
  title = {{An Improved Quantum Algorithm for 3-Tuple Lattice Sieving}},
  booktitle = {CRYPTO 2026},
  year = {2026},
  url = {https://arxiv.org/abs/2510.08473},
  keywords = {SVP, quantum, triple sieving, QCRAM},
  cr_date = {2025-10-09},
  cr_status = {published},
  cr_venue = {CRYPTO 2026},
  cr_author_ids = {lynn-engelberts; yanlin-chen; amin-shiraz-gilani; maya-iggy-van-hoof; stacey-jeffery; ronald-de-wolf}
}

@misc{engelberts-etinski-loyer2024,
  author = {Lynn Engelberts and Simona Etinski and Johanna Loyer},
  title = {{Quantum Sieving for Code-Based Cryptanalysis and Its Limitations for ISD}},
  year = {2024},
  url = {https://eprint.iacr.org/2024/1358},
  cr_date = {2024-08-29},
  cr_status = {preprint},
  cr_author_ids = {lynn-engelberts; simona-etinski; johanna-loyer}
}

@misc{esser-verbel-villanueva2026,
  author = {Andre Esser and Javier Verbel and Ricardo Villanueva-Polanco},
  title = {{Rank Syndrome Decoding Estimator - An Asymptotic and Concrete Analysis}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/082},
  cr_date = {2026-01-19},
  cr_status = {preprint},
  cr_author_ids = {andre-esser; javier-verbel; ricardo-villanueva-polanco}
}

@inproceedings{esser2018-dissection-bkw,
  author = {Andre Esser and Felix Heuer and Robert Kübler and Alexander May and Christian Sohler},
  title = {{Dissection-BKW}},
  booktitle = {Advances in Cryptology -- CRYPTO 2018},
  year = {2018},
  volume = {10992},
  pages = {638--666},
  publisher = {Springer},
  doi = {10.1007/978-3-319-96881-0_22},
  url = {https://eprint.iacr.org/2018/569},
  keywords = {LPN, time-memory tradeoffs, quantum, BKW},
  cr_date = {2018-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {Advances in Cryptology — CRYPTO 2018, LNCS 10992},
  cr_author_ids = {andre-esser; felix-heuer; robert-kubler; alexander-may; christian-sohler},
  series = {Lecture Notes in Computer Science}
}

@misc{feng-gao-liu-2026,
  author = {Yansong Feng and Yiming Gao and Jiaqi Liu},
  title = {{Faster SVP in Polynomial Space}},
  year = {2026},
  url = {https://arxiv.org/abs/2609.21612},
  keywords = {SVP, polynomial space, collision search},
  cr_date = {2026-09-18},
  cr_status = {preprint},
  cr_author_ids = {yansong-feng; yiming-gao; jiaqi-liu}
}

@misc{fhkkkp17,
  author = {Jean-Charles Faugère and Kelsey Horan and Delaram Kahrobaei and Marc Kaplan and Elham Kashefi and Ludovic Perret},
  title = {{Fast Quantum Algorithm for Solving Multivariate Quadratic Equations}},
  year = {2017},
  url = {https://arxiv.org/abs/1712.07211},
  keywords = {MQ, quantum gates, BooleanSolve},
  cr_date = {2017-12-19},
  cr_date_precision = {day},
  cr_status = {preprint},
  cr_venue = {arXiv:1712.07211},
  cr_author_ids = {jean-charles-faugere; kelsey-horan; delaram-kahrobaei; marc-kaplan; elham-kashefi; ludovic-perret}
}

@inproceedings{gentry-peikert-vaikuntanathan-2008,
  author = {Craig Gentry and Chris Peikert and Vinod Vaikuntanathan},
  title = {{Trapdoors for Hard Lattices and New Cryptographic Constructions}},
  booktitle = {Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC 2008)},
  year = {2008},
  pages = {197--206},
  doi = {10.1145/1374376.1374407},
  url = {https://doi.org/10.1145/1374376.1374407},
  cr_date = {2008-05-31},
  cr_status = {published},
  cr_venue = {Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC 2008)},
  cr_author_ids = {craig-gentry; chris-peikert; vinod-vaikuntanathan}
}

@article{gordon93,
  author = {Daniel M. Gordon},
  title = {{Discrete Logarithms in GF(P) Using the Number Field Sieve}},
  journal = {SIAM Journal on Discrete Mathematics 6(1), 124–138},
  year = {1993},
  doi = {10.1137/0406010},
  url = {https://epubs.siam.org/doi/10.1137/0406010},
  keywords = {prime fields, discrete logarithms, number field sieve},
  cr_date = {1993-02-28},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {SIAM Journal on Discrete Mathematics 6(1), 124–138},
  cr_author_ids = {daniel-m-gordon}
}

@misc{gs11-isogeny,
  author = {Steven Galbraith and Anton Stolbunov},
  title = {{Improved Algorithm for the Isogeny Problem for Ordinary Elliptic Curves}},
  year = {2013},
  url = {https://arxiv.org/abs/1105.6331},
  keywords = {ordinary isogenies, random walks, horizontal isogenies},
  cr_date = {2011-05-31},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Applicable Algebra in Engineering, Communication and Computing 24(2):107–131},
  cr_author_ids = {steven-galbraith; anton-stolbunov}
}

@inproceedings{guo2015-coded-bkw,
  author = {Qian Guo and Thomas Johansson and Paul Stankovski},
  title = {{Coded-BKW: Solving LWE Using Lattice Codes}},
  booktitle = {Advances in Cryptology -- CRYPTO 2015},
  year = {2015},
  volume = {9215},
  pages = {23--42},
  publisher = {Springer},
  doi = {10.1007/978-3-662-47989-6_2},
  url = {https://doi.org/10.1007/978-3-662-47989-6_2},
  keywords = {LWE, BKW, lattice codes},
  cr_date = {2015-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {Advances in Cryptology — CRYPTO 2015, LNCS 9215},
  cr_author_ids = {qian-guo; thomas-johansson; paul-stankovski},
  series = {Lecture Notes in Computer Science}
}

@misc{gwz15,
  author = {Steven D. Galbraith and Ping Wang and Fangguo Zhang},
  title = {{Computing Elliptic Curve Discrete Logarithms with Improved Baby-step Giant-step Algorithm}},
  journal = {Advances in Mathematics of Communications 11(3), 453–469},
  year = {2017},
  doi = {10.3934/amc.2017038},
  url = {https://eprint.iacr.org/2015/605},
  keywords = {elliptic curves, baby-step giant-step, negation map},
  cr_date = {2015-06-28},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Advances in Mathematics of Communications 11(3), 453–469},
  cr_author_ids = {steven-d-galbraith; ping-wang; fangguo-zhang}
}

@inproceedings{hanrot-pujol-stehle-2011,
  author = {Guillaume Hanrot and Xavier Pujol and Damien Stehlé},
  title = {{Algorithms for the Shortest and Closest Lattice Vector Problems}},
  booktitle = {Coding and Cryptology: IWCC 2011},
  year = {2011},
  volume = {6639},
  pages = {159--190},
  doi = {10.1007/978-3-642-20901-7_10},
  url = {https://perso.ens-lyon.fr/damien.stehle/downloads/SVPCVP.pdf},
  cr_date = {2011-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {IWCC 2011},
  cr_author_ids = {guillaume-hanrot; xavier-pujol; damien-stehle},
  note = {Author PDF headed Corrected version -- 02/01/2013},
  series = {Lecture Notes in Computer Science}
}

@inproceedings{hanrot-stehle-2007,
  author = {Guillaume Hanrot and Damien Stehlé},
  title = {{Improved Analysis of Kannan's Shortest Lattice Vector Algorithm}},
  booktitle = {CRYPTO 2007},
  year = {2007},
  url = {https://arxiv.org/abs/0705.0965},
  keywords = {SVP, enumeration, polynomial space},
  cr_date = {2007-05-07},
  cr_status = {published},
  cr_venue = {CRYPTO 2007},
  cr_author_ids = {guillaume-hanrot; damien-stehle}
}

@misc{harvey20,
  author = {David Harvey},
  title = {{An exponent one-fifth algorithm for deterministic integer factorisation}},
  journal = {Mathematics of Computation 90, 2937–2950},
  year = {2021},
  doi = {10.1090/mcom/3658},
  url = {https://arxiv.org/abs/2010.05450},
  keywords = {factoring, deterministic},
  cr_date = {2020-10-12},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Mathematics of Computation 90, 2937–2950},
  cr_author_ids = {david-harvey}
}

@misc{heiser-2021,
  author = {Max Heiser},
  title = {{Improved Quantum Hypercone Locality Sensitive Filtering in Lattice Sieving}},
  year = {2021},
  url = {https://eprint.iacr.org/2021/1295},
  keywords = {SVP, lattice sieving},
  cr_date = {2021-09-27},
  cr_status = {preprint},
  cr_author_ids = {max-heiser},
  howpublished = {Cryptology ePrint Archive}
}

@article{helfrich-1985,
  author = {Bettina Helfrich},
  title = {{Algorithms to construct Minkowski reduced and Hermite reduced lattice bases}},
  journal = {Theoretical Computer Science},
  year = {1985},
  volume = {41},
  number = {2--3},
  pages = {125--139},
  doi = {10.1016/0304-3975(85)90067-2},
  url = {https://doi.org/10.1016/0304-3975(85)90067-2},
  cr_date = {1985-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {Theoretical Computer Science},
  cr_author_ids = {bettina-helfrich}
}

@inproceedings{herold-kirshanova-2017,
  author = {Gottfried Herold and Elena Kirshanova},
  title = {{Improved Algorithms for the Approximate k-List Problem in Euclidean Norm}},
  booktitle = {Public-Key Cryptography – PKC 2017},
  year = {2017},
  doi = {10.1007/978-3-662-54365-8_2},
  url = {https://eprint.iacr.org/2017/017},
  keywords = {SVP, lattice sieving},
  cr_date = {2017-01-11},
  cr_status = {published},
  cr_venue = {Public-Key Cryptography – PKC 2017},
  cr_author_ids = {gottfried-herold; elena-kirshanova}
}

@inproceedings{herold-kirshanova-laarhoven-2017,
  author = {Gottfried Herold and Elena Kirshanova and Thijs Laarhoven},
  title = {{Speed-ups and time-memory trade-offs for tuple lattice sieving}},
  booktitle = {PKC 2018},
  year = {2018},
  url = {https://eprint.iacr.org/2017/1228},
  keywords = {SVP, tuple sieving, time-memory tradeoffs},
  cr_date = {2017-12-22},
  cr_status = {published},
  cr_venue = {PKC 2018},
  cr_author_ids = {gottfried-herold; elena-kirshanova; thijs-laarhoven}
}

@misc{hh21,
  author = {David Harvey and Markus Hittmeir},
  title = {{A log-log speedup for exponent one-fifth deterministic integer factorisation}},
  journal = {Mathematics of Computation 91, 1367–1379},
  year = {2022},
  doi = {10.1090/mcom/3708},
  url = {https://arxiv.org/abs/2105.11105},
  keywords = {factoring, deterministic},
  cr_date = {2021-05-24},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Mathematics of Computation 91, 1367–1379},
  cr_author_ids = {david-harvey; markus-hittmeir}
}

@misc{hirose2016,
  author = {Shoichi Hirose},
  title = {{May-Ozerov Algorithm for Nearest-Neighbor Problem over $\mathbb{F}_{q}$ and Its Application to Information Set Decoding}},
  year = {2016},
  url = {https://eprint.iacr.org/2016/237},
  cr_date = {2016-03-03},
  cr_status = {published},
  cr_venue = {SECITC 2016},
  cr_author_ids = {shoichi-hirose}
}

@misc{hittmeir20,
  author = {Markus Hittmeir},
  title = {{A time-space tradeoff for Lehman's deterministic integer factorization method}},
  journal = {Mathematics of Computation 90, 1999–2010},
  year = {2021},
  doi = {10.1090/mcom/3623},
  url = {https://arxiv.org/abs/2006.16729},
  keywords = {factoring, deterministic, time-space tradeoff},
  cr_date = {2020-06-30},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Mathematics of Computation 90, 1999–2010},
  cr_author_ids = {markus-hittmeir}
}

@article{hkm2015-asymptotic,
  author = {Gottfried Herold and Elena Kirshanova and Alexander May},
  title = {{On the Asymptotic Complexity of Solving LWE}},
  journal = {Designs, Codes and Cryptography},
  year = {2018},
  volume = {86},
  number = {1},
  pages = {55--83},
  doi = {10.1007/s10623-016-0326-0},
  url = {https://elenakirshanova.github.io/Papers/on_the_asymptotic_complexity.pdf},
  keywords = {LWE, BKW, sample amplification, asymptotic analysis},
  cr_date = {2018-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {Designs, Codes and Cryptography 86(1)},
  cr_author_ids = {gottfried-herold; elena-kirshanova; alexander-may},
  note = {First preprint: IACR ePrint 2015/1222; checked author manuscript is undated}
}

@article{hunkenschroder-reuland-schymura-2018,
  author = {Christoph Hunkenschröder and Gina Reuland and Matthias Schymura},
  title = {{On compact representations of Voronoi cells of lattices}},
  journal = {Mathematical Programming},
  year = {2020},
  doi = {10.1007/s10107-019-01463-3},
  url = {https://arxiv.org/abs/1811.08532},
  keywords = {CVPP, Voronoi cells, compact representation, polynomial space},
  cr_date = {2018-11-20},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Mathematical Programming (2020)},
  cr_author_ids = {christoph-hunkenschroder; gina-reuland; matthias-schymura}
}

@misc{jllr20,
  author = {David Jao and Jason LeGrow and Christopher Leonardi and Luis Ruiz-Lopez},
  title = {{A subexponential-time, polynomial quantum space algorithm for inverting the CM group action}},
  year = {2020},
  doi = {10.1515/jmc-2015-0057},
  url = {https://www.degruyterbrill.com/document/doi/10.1515/jmc-2015-0057/html},
  keywords = {CSIDH, CM group action, polynomial quantum space, BKW},
  cr_date = {2020-06-14},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Journal of Mathematical Cryptology 14(1):129–138},
  cr_author_ids = {david-jao; jason-legrow; christopher-leonardi; luis-ruiz-lopez}
}

@misc{joux13,
  author = {Antoine Joux},
  title = {{A new index calculus algorithm with complexity $L(1/4+o(1))$ in very small characteristic}},
  journal = {Selected Areas in Cryptography – SAC 2013},
  year = {2014},
  url = {https://eprint.iacr.org/2013/095},
  keywords = {discrete logarithms, small characteristic, index calculus},
  cr_date = {2013-02-21},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Selected Areas in Cryptography – SAC 2013},
  cr_author_ids = {antoine-joux}
}

@inproceedings{kannan-1983,
  author = {Ravi Kannan},
  title = {{Improved algorithms for integer programming and related lattice problems}},
  booktitle = {Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing},
  year = {1983},
  pages = {193--206},
  doi = {10.1145/800061.808749},
  url = {https://doi.org/10.1145/800061.808749},
  cr_date = {1983-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {STOC 1983},
  cr_author_ids = {ravi-kannan}
}

@article{kannan-1987,
  author = {Ravi Kannan},
  title = {{Minkowski’s convex body theorem and integer programming}},
  journal = {Mathematics of Operations Research},
  year = {1987},
  month = {August},
  volume = {12},
  number = {3},
  pages = {415--440},
  doi = {10.1287/moor.12.3.415},
  url = {https://doi.org/10.1287/moor.12.3.415},
  cr_date = {1987-08-31},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {Mathematics of Operations Research},
  cr_author_ids = {ravi-kannan}
}

@misc{kim-2026-one-dgs,
  author = {Jiseung Kim},
  title = {{One Discrete Gaussian Sample in 2^{n/2+o(n)} Time}},
  year = {2026},
  url = {https://arxiv.org/abs/2608.03220},
  cr_date = {2026-08-04},
  cr_status = {preprint},
  cr_author_ids = {jiseung-kim},
  archiveprefix = {arXiv},
  eprint = {2608.03220}
}

@inproceedings{kirshanova-et-al-2019,
  author = {Elena Kirshanova and Erik Mårtensson and Eamonn W. Postlethwaite and Subhayan Roy Moulik},
  title = {{Quantum Algorithms for the Approximate $k$-List Problem and their Application to Lattice Sieving}},
  booktitle = {ASIACRYPT 2019},
  year = {2019},
  url = {https://eprint.iacr.org/2019/1016},
  keywords = {SVP, quantum, tuple sieving, QRAM},
  cr_date = {2019-09-10},
  cr_status = {published},
  cr_venue = {ASIACRYPT 2019},
  cr_author_ids = {elena-kirshanova; erik-martensson; eamonn-w-postlethwaite; subhayan-roy-moulik}
}

@misc{kirshanova2018,
  author = {Elena Kirshanova},
  title = {{Improved Quantum Information Set Decoding}},
  year = {2018},
  url = {https://arxiv.org/abs/1808.00714},
  cr_date = {2018-08-02},
  cr_status = {published},
  cr_venue = {PQCrypto 2018; corrected full version on arXiv},
  cr_author_ids = {elena-kirshanova}
}

@inproceedings{klein-2000,
  author = {Philip Klein},
  title = {{Finding the closest lattice vector when it's unusually close}},
  booktitle = {Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000)},
  year = {2000},
  pages = {937--941},
  doi = {10.1145/338219.338661},
  url = {https://doi.org/10.1145/338219.338661},
  cr_date = {2000-12-31},
  cr_status = {published},
  cr_venue = {Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000)},
  cr_author_ids = {philip-klein}
}

@misc{kw19,
  author = {Thorsten Kleinjung and Benjamin Wesolowski},
  title = {{Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic}},
  journal = {Journal of the American Mathematical Society 35, 581–624},
  year = {2022},
  doi = {10.1090/jams/985},
  url = {https://arxiv.org/abs/1906.10668},
  keywords = {discrete logarithms, fixed characteristic, quasi-polynomial, unconditional},
  cr_date = {2019-06-25},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Journal of the American Mathematical Society 35, 581–624},
  cr_author_ids = {thorsten-kleinjung; benjamin-wesolowski}
}

@inproceedings{laarhoven-cvp-2016,
  author = {Thijs Laarhoven},
  title = {{Sieving for closest lattice vectors (with preprocessing)}},
  booktitle = {Selected Areas in Cryptography (SAC 2016)},
  year = {2016},
  url = {https://arxiv.org/abs/1607.04789},
  keywords = {CVP, CVPP, BDD, sieving},
  cr_date = {2016-07-16},
  cr_status = {published},
  cr_venue = {Selected Areas in Cryptography (SAC 2016)},
  cr_author_ids = {thijs-laarhoven}
}

@phdthesis{laarhoven-thesis-2016,
  author = {Thijs Laarhoven},
  title = {{Search problems in cryptography: from fingerprinting to lattice sieving}},
  school = {Technische Universiteit Eindhoven},
  year = {2016},
  url = {https://research.tue.nl/en/publications/search-problems-in-cryptography-from-fingerprinting-to-lattice-si/},
  keywords = {SVP, quantum sieving, nearest neighbors},
  cr_date = {2016-02-16},
  cr_status = {published},
  cr_venue = {Technische Universiteit Eindhoven},
  cr_author_ids = {thijs-laarhoven}
}

@misc{laarhoven-tuple-2017,
  author = {Thijs Laarhoven},
  title = {{Faster tuple lattice sieving using spherical locality-sensitive filters}},
  year = {2017},
  url = {https://arxiv.org/abs/1705.02828},
  keywords = {SVP, lattice sieving},
  cr_date = {2017-05-08},
  cr_status = {preprint},
  cr_author_ids = {thijs-laarhoven},
  howpublished = {arXiv}
}

@article{lagarias-lenstra-schnorr-1990,
  author = {Jeffrey C. Lagarias and {Hendrik W. Lenstra, Jr.} and Claus-Peter Schnorr},
  title = {{Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice}},
  year = {1990},
  doi = {10.1007/BF02128669},
  url = {https://doi.org/10.1007/BF02128669},
  keywords = {CVP, lattice algorithms},
  cr_date = {1990-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {Combinatorica},
  cr_author_ids = {jeffrey-c-lagarias; hendrik-w-lenstra-jr; claus-peter-schnorr},
  howpublished = {Combinatorica}
}

@article{lenstra87,
  author = {Hendrik W. Lenstra Jr.},
  title = {{Factoring integers with elliptic curves}},
  journal = {Annals of Mathematics 126(3), 649–673},
  year = {1987},
  doi = {10.2307/1971363},
  url = {https://annals.math.princeton.edu/1987/126-3/p09},
  keywords = {factoring, elliptic curve method, small prime factors},
  cr_date = {1987-11-30},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {Annals of Mathematics 126(3), 649–673},
  cr_author_ids = {hendrik-w-lenstra-jr}
}

@inproceedings{levieil2006-improved-lpn,
  author = {Éric Levieil and Pierre-Alain Fouque},
  title = {{An Improved LPN Algorithm}},
  booktitle = {Security and Cryptography for Networks -- SCN 2006},
  year = {2006},
  volume = {4116},
  pages = {348--359},
  publisher = {Springer},
  doi = {10.1007/11832072_24},
  url = {https://www.di.ens.fr/~fouque/pub/scn06.pdf},
  keywords = {LPN, BKW, LF1, LF2},
  cr_date = {2006-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {Security and Cryptography for Networks — SCN 2006, LNCS 4116},
  cr_author_ids = {eric-levieil; pierre-alain-fouque},
  series = {Lecture Notes in Computer Science}
}

@misc{li-wang-pan2026,
  author = {Yu Li and Li-Ping Wang and Xiangyu Pan},
  title = {{A novel improved information set decoding algorithm via nearest neighbor search}},
  year = {2026},
  url = {https://link.springer.com/article/10.1186/s42400-025-00469-z},
  cr_date = {2026-06-11},
  cr_status = {published},
  cr_venue = {Cybersecurity 9, article 85},
  cr_author_ids = {yu-li; li-ping-wang; xiangyu-pan}
}

@misc{li2025-ternary,
  author = {Yang Li},
  title = {{From Subset-Sum to Decoding: Improved Classical and Quantum Algorithms via Ternary Representation Technique}},
  year = {2025},
  url = {https://doi.org/10.3390/info16100887},
  cr_date = {2025-10-12},
  cr_status = {published},
  cr_venue = {Information 16(10), 887},
  cr_author_ids = {yang-li}
}

@misc{lido22,
  author = {Guido Lido},
  title = {{A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic}},
  journal = {Finite Fields and Their Applications 111, 102753},
  year = {2026},
  doi = {10.1016/j.ffa.2025.102753},
  url = {https://arxiv.org/abs/2206.10327},
  keywords = {discrete logarithms, small characteristic, quasi-polynomial, elliptic presentations},
  cr_date = {2022-06-13},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Finite Fields and Their Applications 111, 102753},
  cr_author_ids = {guido-lido}
}

@misc{lindner-peikert2010-lwe,
  author = {Richard Lindner and Chris Peikert},
  title = {{Better Key Sizes (and Attacks) for LWE-Based Encryption}},
  year = {2011},
  url = {https://eprint.iacr.org/2010/613},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2010-11-30},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {CT-RSA 2011, LNCS 6558, pp. 319–339},
  cr_author_ids = {richard-lindner; chris-peikert},
  note = {CT-RSA 2011, LNCS 6558, pp. 319–339}
}

@inproceedings{liu-lyubashevsky-micciancio-2006,
  author = {Yi-Kai Liu and Vadim Lyubashevsky and Daniele Micciancio},
  title = {{On Bounded Distance Decoding for General Lattices}},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2006)},
  year = {2006},
  pages = {450--461},
  doi = {10.1007/11830924_41},
  url = {https://doi.org/10.1007/11830924_41},
  cr_date = {2006-08-31},
  cr_status = {published},
  cr_venue = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2006)},
  cr_author_ids = {yi-kai-liu; vadim-lyubashevsky; daniele-micciancio}
}

@incollection{llmp90,
  author = {Arjen K. Lenstra and Hendrik W. Lenstra Jr. and Mark S. Manasse and John M. Pollard},
  title = {{The number field sieve}},
  booktitle = {STOC 1990},
  year = {1990},
  doi = {10.1145/100216.100295},
  url = {https://wstein.org/129/references/Lenstra-Lenstra-Manasse-Pollard-The%20number%20field%20sieve.pdf},
  keywords = {factoring, number field sieve, special number field sieve},
  cr_date = {1990-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {STOC 1990},
  cr_author_ids = {arjen-k-lenstra; hendrik-w-lenstra-jr; mark-s-manasse; john-m-pollard}
}

@article{lp92,
  author = {Hendrik W. Lenstra Jr. and Carl Pomerance},
  title = {{A rigorous time bound for factoring integers}},
  journal = {Journal of the American Mathematical Society 5(3), 483–516},
  year = {1992},
  doi = {10.1090/S0894-0347-1992-1137100-0},
  url = {https://doi.org/10.1090/S0894-0347-1992-1137100-0},
  keywords = {factoring, class groups, unconditional, randomized},
  cr_date = {1992-07-31},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {Journal of the American Mathematical Society 5(3), 483–516},
  cr_author_ids = {hendrik-w-lenstra-jr; carl-pomerance}
}

@misc{lptwy17,
  author = {Daniel Lokshtanov and Ramamohan Paturi and Suguru Tamaki and Ryan Williams and Huacheng Yu},
  title = {{Beating Brute Force for Systems of Polynomial Equations over Finite Fields}},
  year = {2017},
  doi = {10.1137/1.9781611974782.143},
  url = {https://epubs.siam.org/doi/abs/10.1137/1.9781611974782.143},
  keywords = {MQ, polynomial method, finite fields},
  cr_date = {2017-01-04},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {SODA 2017},
  cr_author_ids = {daniel-lokshtanov; ramamohan-paturi; suguru-tamaki; ryan-williams; huacheng-yu}
}

@inproceedings{lyubashevsky2005-parity-noise,
  author = {Vadim Lyubashevsky},
  title = {{The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem}},
  booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques},
  year = {2005},
  volume = {3624},
  pages = {378--389},
  publisher = {Springer},
  doi = {10.1007/11538462_32},
  url = {https://doi.org/10.1007/11538462_32},
  keywords = {LPN, sample amplification, polynomial samples},
  cr_date = {2005-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {APPROX/RANDOM 2005, LNCS 3624},
  cr_author_ids = {vadim-lyubashevsky},
  series = {Lecture Notes in Computer Science}
}

@article{matyukhin03,
  author = {D. V. Matyukhin},
  title = {{On the asymptotic complexity of computing discrete logarithms in the field GF(p)}},
  journal = {Diskretnaya Matematika 15(1), 28–49; English translation Discrete Mathematics and Applications 13(1), 27–50},
  year = {2003},
  doi = {10.4213/dm184},
  url = {https://www.mathnet.ru/eng/dm184},
  keywords = {discrete logarithms, multiple number fields, prime fields},
  cr_date = {2003-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {Diskretnaya Matematika 15(1), 28–49; English translation Discrete Mathematics and Applications 13(1), 27–50},
  cr_author_ids = {d-v-matyukhin}
}

@misc{micciancio-regev2008-lbc,
  author = {Daniele Micciancio and Oded Regev},
  title = {{Lattice-based Cryptography}},
  year = {2009},
  url = {https://cseweb.ucsd.edu/~daniele/papers/PostQuantum.pdf},
  keywords = {LWE, algorithmic complexity, historical literature},
  cr_date = {2008-11-07},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Post-Quantum Cryptography, pp. 147–191; DOI 10.1007/978-3-540-88702-7_5},
  cr_author_ids = {daniele-micciancio; oded-regev},
  note = {Post-Quantum Cryptography, pp. 147–191; DOI 10.1007/978-3-540-88702-7_5}
}

@inproceedings{micciancio-voulgaris-sieve-2009,
  author = {Daniele Micciancio and Panagiotis Voulgaris},
  title = {{Faster exponential time algorithms for the shortest vector problem}},
  booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms},
  year = {2010},
  pages = {1468--1480},
  doi = {10.1137/1.9781611973075.119},
  url = {https://eccc.weizmann.ac.il/report/2009/065/},
  cr_date = {2009-08-10},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {SODA 2010},
  cr_author_ids = {daniele-micciancio; panagiotis-voulgaris},
  note = {ECCC TR09-065, published 10 August 2009}
}

@misc{mmt2011,
  author = {Alexander May and Alexander Meurer and Enrico Thomae},
  title = {{Decoding Random Linear Codes in Õ(2^{0.054n})}},
  year = {2011},
  url = {https://www.iacr.org/archive/asiacrypt2011/70730106/70730106.pdf},
  cr_date = {2011-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {ASIACRYPT 2011},
  cr_author_ids = {alexander-may; alexander-meurer; enrico-thomae}
}

@article{mukhopadhyay-2019-lp-sieving,
  author = {Priyanka Mukhopadhyay},
  title = {{Faster provable sieving algorithms for the Shortest Vector Problem and the Closest Vector Problem on lattices in ℓ_p norm}},
  journal = {Algorithms},
  year = {2021},
  volume = {14},
  number = {12},
  pages = {362},
  doi = {10.3390/a14120362},
  url = {https://arxiv.org/abs/1907.04406},
  cr_date = {2019-07-09},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Algorithms},
  cr_author_ids = {priyanka-mukhopadhyay},
  note = {arXiv:1907.04406; v1 9 July 2019, v3 19 December 2021}
}

@article{naszodi-venzin-2019,
  author = {Márton Naszódi and Moritz Venzin},
  title = {{Covering Convex Bodies and the Closest Vector Problem}},
  journal = {Discrete & Computational Geometry},
  volume = {67},
  pages = {1191--1210},
  year = {2022},
  doi = {10.1007/s00454-022-00392-x},
  url = {https://arxiv.org/abs/1908.08384},
  keywords = {CVP, approximation, covering, modulus of smoothness},
  cr_date = {2019-08-22},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Discrete & Computational Geometry 67 (2022)},
  cr_author_ids = {marton-naszodi; moritz-venzin}
}

@misc{ouyang-wei-xu26-frobenius-smoothness,
  author = {Yi Ouyang and Wei Wei and Zheng Xu},
  title = {{Smoothness of Shortest Isogenies to Frobenius Conjugates}},
  year = {2026},
  url = {https://arxiv.org/abs/2610.21488},
  keywords = {supersingular isogenies, Frobenius conjugates, smoothness, unconditional},
  cr_date = {2026-10-15},
  cr_date_precision = {day},
  cr_status = {preprint},
  cr_venue = {arXiv:2610.21488; Cryptology ePrint Archive 2026/2677},
  cr_author_ids = {yi-ouyang; wei-wei; zheng-xu},
  archiveprefix = {arXiv},
  eprint = {2610.21488},
  primaryclass = {math.NT}
}

@misc{paper-0cb7a1aa50d2,
  author = {Yiming Gao and Yansong Feng and Honggang Hu},
  title = {{Solving the Shortest Vector Problem in 2^(0.7314n+o(n)) Time via Discrete Gaussian Sampling on Superlattices}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1587},
  cr_date = {2026-08-03},
  cr_status = {preprint},
  cr_author_ids = {yiming-gao; yansong-feng; honggang-hu},
  howpublished = {Cryptology ePrint Archive, Paper 2026/1587}
}

@misc{paper-0d12f3e7f365,
  author = {Xiaoyun Wang and Mingjie Liu and Chengliang Tian and Jingguo Bi},
  title = {{Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem}},
  year = {2011},
  url = {https://eprint.iacr.org/2010/647},
  cr_date = {2010-12-21},
  cr_status = {published},
  cr_author_ids = {xiaoyun-wang; mingjie-liu; chengliang-tian; jingguo-bi},
  howpublished = {Cryptology {ePrint} Archive, Paper 2010/647},
  cr_venue = {AsiaCCS 2011},
  booktitle = {Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security},
  doi = {10.1145/1966913.1966915}
}

@misc{paper-0f3a0f011219,
  author = {Minki Hhan},
  title = {{Finding a Shortest Vector and More in 2^(n/2+o(n)) Time using q-ary Coset Difference Tree}},
  year = {2026},
  url = {https://arxiv.org/abs/2609.02764},
  cr_date = {2026-09-02},
  cr_status = {preprint},
  cr_author_ids = {minki-hhan},
  howpublished = {arXiv:2609.02764; also Cryptology ePrint Archive, Paper 2026/1859}
}

@inproceedings{paper-1121d4329e21,
  author = {Daniel J. Bernstein},
  title = {{Grover vs. McEliece}},
  booktitle = {Post-Quantum Cryptography 2010},
  year = {2010},
  volume = {6061},
  pages = {73--80},
  publisher = {Springer},
  doi = {10.1007/978-3-642-12929-2_6},
  url = {https://cr.yp.to/papers.html#grovercode},
  cr_date = {2009-11-23},
  cr_status = {published},
  cr_venue = {Post-Quantum Cryptography 2010},
  cr_author_ids = {daniel-j-bernstein},
  series = {Lecture Notes in Computer Science}
}

@misc{paper-1156d8d47edf,
  author = {Thijs Laarhoven},
  title = {{Sieving for shortest vectors in lattices using angular locality-sensitive hashing}},
  year = {2015},
  url = {https://eprint.iacr.org/2014/744},
  cr_date = {2014-09-26},
  cr_status = {published},
  cr_author_ids = {thijs-laarhoven},
  howpublished = {Cryptology {ePrint} Archive, Paper 2014/744},
  cr_venue = {CRYPTO 2015}
}

@misc{paper-11d2e4157eb4,
  author = {Xavier Pujol and Damien Stehlé},
  title = {{Solving the Shortest Lattice Vector Problem in Time 2^(2.465n)}},
  year = {2009},
  url = {https://eprint.iacr.org/2009/605},
  cr_date = {2009-12-09},
  cr_status = {published},
  cr_author_ids = {xavier-pujol; damien-stehle},
  howpublished = {Cryptology ePrint Archive, Paper 2009/605},
  cr_venue = {ePrint 2009/605},
  cr_venue_short = {ePrint 2009/605},
  note = {The ePrint archive reports published elsewhere but gives no publication venue; the linked author publication list identifies this work as ePrint 2009/605.}
}

@inproceedings{paper-1873724e57d1,
  author = {Thijs Laarhoven and Michele Mosca and Joop van de Pol},
  title = {{Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search}},
  booktitle = {Post-Quantum Cryptography},
  year = {2013},
  pages = {83--101},
  doi = {10.1007/978-3-642-38616-9_6},
  url = {https://arxiv.org/abs/1301.6176},
  cr_date = {2013-01-25},
  cr_status = {published},
  cr_venue = {Post-Quantum Cryptography},
  cr_author_ids = {thijs-laarhoven; michele-mosca; joop-van-de-pol}
}

@misc{paper-1bcb4e64b5f3,
  author = {Anja Becker and Léo Ducas and Nicolas Gama and Thijs Laarhoven},
  title = {{New directions in nearest neighbor searching with applications to lattice sieving}},
  year = {2016},
  url = {https://eprint.iacr.org/2015/1128},
  cr_date = {2015-11-23},
  cr_status = {published},
  cr_author_ids = {anja-becker; leo-ducas; nicolas-gama; thijs-laarhoven},
  howpublished = {Cryptology {ePrint} Archive, Paper 2015/1128},
  cr_venue = {SODA 2016}
}

@misc{paper-2b6476ef7d09,
  author = {Thijs Laarhoven and Benne de Weger},
  title = {{Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing}},
  year = {2015},
  doi = {10.1007/978-3-319-22174-8_6},
  url = {https://eprint.iacr.org/2015/211},
  cr_date = {2015-03-06},
  cr_status = {published},
  cr_author_ids = {thijs-laarhoven; benne-de-weger},
  howpublished = {Cryptology {ePrint} Archive, Paper 2015/211},
  cr_venue = {LATINCRYPT 2015}
}

@misc{paper-2f67f6ebf8c0,
  author = {Anja Becker and Nicolas Gama and Antoine Joux},
  title = {{Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search}},
  year = {2015},
  url = {https://eprint.iacr.org/2015/522},
  cr_date = {2015-05-31},
  cr_status = {preprint},
  cr_author_ids = {anja-becker; nicolas-gama; antoine-joux},
  howpublished = {Cryptology {ePrint} Archive, Paper 2015/522}
}

@misc{paper-2fcc11c09e6a,
  author = {Minki Hhan},
  title = {{Solving the Shortest Vector Problem in 2^(0.6039n) Time via Mid-point Hessian}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1597},
  cr_date = {2026-08-03},
  cr_status = {preprint},
  cr_author_ids = {minki-hhan},
  howpublished = {Cryptology ePrint Archive, Paper 2026/1597}
}

@misc{paper-3219d85db441,
  author = {André Chailloux and Johanna Loyer},
  title = {{Lattice sieving via quantum random walks}},
  year = {2021},
  url = {https://arxiv.org/abs/2105.05608},
  cr_date = {2021-05-12},
  cr_status = {published},
  cr_author_ids = {andre-chailloux; johanna-loyer},
  howpublished = {ASIACRYPT 2021; arXiv:2105.05608},
  cr_venue = {ASIACRYPT 2021},
  doi = {10.1007/978-3-030-92068-5_3}
}

@inproceedings{paper-46a7c73ed460,
  author = {Qian Guo and Thomas Johansson and Erik Mårtensson and Paul Stankovski},
  title = {{Coded-BKW with Sieving}},
  booktitle = {Advances in Cryptology -- ASIACRYPT 2017},
  year = {2017},
  volume = {10624},
  pages = {323--346},
  publisher = {Springer},
  doi = {10.1007/978-3-319-70694-8_12},
  url = {https://www.iacr.org/archive/asiacrypt2017/106240219/106240219.pdf},
  cr_date = {2017-12-03},
  cr_status = {published},
  cr_venue = {Advances in Cryptology -- ASIACRYPT 2017},
  cr_author_ids = {qian-guo; thomas-johansson; erik-martensson; paul-stankovski},
  series = {Lecture Notes in Computer Science}
}

@misc{paper-57677bda59d7,
  author = {Feng Zhang and Yanbin Pan and Gengran Hu},
  title = {{A Three-Level Sieve Algorithm for the Shortest Vector Problem}},
  year = {2014},
  doi = {10.1007/978-3-662-43414-7_2},
  url = {https://eprint.iacr.org/2013/536},
  cr_date = {2014-10-22},
  cr_status = {published},
  cr_author_ids = {feng-zhang; yanbin-pan; gengran-hu},
  howpublished = {Cryptology {ePrint} Archive, Paper 2013/536},
  cr_venue = {SAC 2013}
}

@article{paper-601546f46af3,
  author = {Phong Q. Nguyen and Thomas Vidick},
  title = {{Sieve Algorithms for the Shortest Vector Problem are Practical}},
  journal = {Journal of Mathematical Cryptology},
  year = {2008},
  volume = {2},
  number = {2},
  pages = {181--207},
  doi = {10.1515/jmc.2008.009},
  url = {https://people.csail.mit.edu/vidick/JoMC08.pdf},
  cr_date = {2008-09-11},
  cr_status = {published},
  cr_venue = {Journal of Mathematical Cryptology},
  cr_author_ids = {phong-q-nguyen; thomas-vidick}
}

@misc{paper-777c2d2d89d5,
  author = {Anja Becker and Thijs Laarhoven},
  title = {{Efficient (ideal) lattice sieving using cross-polytope LSH}},
  year = {2016},
  doi = {10.1007/978-3-319-31517-1_1},
  url = {https://eprint.iacr.org/2015/823},
  cr_date = {2015-08-24},
  cr_status = {published},
  cr_author_ids = {anja-becker; thijs-laarhoven},
  howpublished = {Cryptology {ePrint} Archive, Paper 2015/823},
  cr_venue = {AFRICACRYPT 2016}
}

@misc{paper-86925aff6e6c,
  author = {Divesh Aggarwal and Daniel Dadush and Oded Regev and Noah Stephens-Davidowitz},
  title = {{Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling}},
  year = {2015},
  url = {https://arxiv.org/abs/1412.7994},
  cr_date = {2014-12-26},
  cr_status = {published},
  cr_author_ids = {divesh-aggarwal; daniel-dadush; oded-regev; noah-stephens-davidowitz},
  howpublished = {STOC 2015; arXiv:1412.7994},
  cr_venue = {STOC 2015}
}

@article{paper-87fab2296b57,
  author = {Martin R. Albrecht and Carlos Cid and Jean-Charles Faugère and Robert Fitzpatrick and Ludovic Perret},
  title = {{On the Complexity of the BKW Algorithm on LWE}},
  journal = {Designs, Codes and Cryptography},
  year = {2015},
  volume = {74},
  number = {2},
  pages = {325--354},
  url = {https://eprint.iacr.org/2012/636},
  cr_date = {2012-11-11},
  cr_status = {published},
  cr_venue = {Designs, Codes and Cryptography},
  cr_author_ids = {martin-r-albrecht; carlos-cid; jean-charles-faugere; robert-fitzpatrick; ludovic-perret}
}

@misc{paper-8837c0491680,
  author = {Xavier Bonnetain and André Chailloux and André Schrottenloher and Yixin Shen},
  title = {{Finding many Collisions via Reusable Quantum Walks}},
  year = {2023},
  url = {https://eprint.iacr.org/2022/676},
  cr_date = {2022-05-27},
  cr_status = {published},
  cr_author_ids = {xavier-bonnetain; andre-chailloux; andre-schrottenloher; yixin-shen},
  howpublished = {EUROCRYPT 2023; full version Cryptology ePrint Archive, Paper 2022/676},
  cr_venue = {EUROCRYPT 2023}
}

@misc{paper-90fa5a162759,
  author = {Amaury Pouly and Yixin Shen},
  title = {{Solving the Shortest Vector Problem in 2^(0.63269n+o(n)) time on Random Lattices}},
  year = {2026},
  url = {https://eprint.iacr.org/2024/1805},
  cr_date = {2024-11-04},
  cr_status = {published},
  cr_author_ids = {amaury-pouly; yixin-shen},
  howpublished = {EUROCRYPT 2026; full version Cryptology ePrint Archive, Paper 2024/1805},
  cr_venue = {EUROCRYPT 2026}
}

@misc{paper-9617f5d3fa09,
  author = {Anja Becker and Nicolas Gama and Antoine Joux},
  title = {{Solving shortest and closest vector problems: The decomposition approach}},
  year = {2014},
  url = {https://eprint.iacr.org/2013/685},
  cr_date = {2013-10-24},
  cr_status = {published},
  cr_author_ids = {anja-becker; nicolas-gama; antoine-joux},
  howpublished = {Cryptology {ePrint} Archive, Paper 2013/685},
  cr_venue = {ANTS 2014},
  note = {The main part appeared at ANTS 2014 under the title A Sieve Algorithm Based on Overlattices; this linked full version retains its original title and an additional section.}
}

@misc{paper-a68a0bb5d70f,
  author = {Daniele Micciancio and Panagiotis Voulgaris},
  title = {{A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations}},
  year = {2013},
  url = {https://eccc.weizmann.ac.il/report/2010/014/},
  cr_date = {2012-03-03},
  cr_status = {published},
  cr_author_ids = {daniele-micciancio; panagiotis-voulgaris},
  howpublished = {SIAM Journal on Computing; ECCC TR10-014, revised 3 March 2012},
  cr_venue = {SIAM Journal on Computing},
  journal = {SIAM Journal on Computing},
  doi = {10.1137/100811970}
}

@misc{paper-b05644e2a691,
  author = {Emmanouil Doulgerakis and Thijs Laarhoven},
  title = {{Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time 2^(0.292n)}},
  year = {2026},
  url = {https://arxiv.org/abs/2609.37482},
  cr_date = {2026-09-26},
  cr_status = {preprint},
  cr_author_ids = {emmanouil-doulgerakis; thijs-laarhoven},
  howpublished = {arXiv:2609.37482}
}

@misc{paper-bb2a5c84c79d,
  author = {Alexander May and Ilya Ozerov},
  title = {{On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes}},
  year = {2015},
  url = {https://www.iacr.org/archive/eurocrypt2015/90560136/90560136.pdf},
  cr_date = {2015-04-26},
  cr_status = {published},
  cr_author_ids = {alexander-may; ilya-ozerov},
  howpublished = {EUROCRYPT 2015}
}

@article{paper-c64ff7d0568b,
  author = {Qian Guo and Thomas Johansson and Erik Mårtensson and Paul Stankovski Wagner},
  title = {{On the Asymptotics of Solving the LWE Problem Using Coded-BKW with Sieving}},
  journal = {IEEE Transactions on Information Theory},
  year = {2019},
  volume = {65},
  number = {8},
  pages = {5243--5259},
  doi = {10.1109/TIT.2019.2906233},
  url = {https://eprint.iacr.org/2019/009},
  cr_date = {2019-01-09},
  cr_status = {published},
  cr_venue = {IEEE Transactions on Information Theory},
  cr_author_ids = {qian-guo; thomas-johansson; erik-martensson; paul-stankovski-wagner}
}

@misc{paper-c70730f20075,
  author = {Minki Hhan and Jiseung Kim and Sunyeop Kim and Thijs Laarhoven},
  title = {{Superlattice methods for the shortest vector problem and discrete Gaussian sampling}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/2761},
  cr_date = {2026-11-04},
  cr_status = {preprint},
  cr_author_ids = {minki-hhan; jiseung-kim; sunyeop-kim; thijs-laarhoven},
  howpublished = {Cryptology ePrint Archive, Paper 2026/2761}
}

@misc{paper-c95c0e507206,
  author = {Ghazal Kachigar and Jean-Pierre Tillich},
  title = {{Quantum Information Set Decoding Algorithms}},
  year = {2017},
  url = {https://arxiv.org/abs/1703.00263},
  cr_date = {2017-03-01},
  cr_status = {published},
  cr_author_ids = {ghazal-kachigar; jean-pierre-tillich},
  howpublished = {Post-Quantum Cryptography 2017; arXiv:1703.00263},
  cr_venue = {PQCrypto 2017}
}

@article{paper-caa5f6c38871,
  author = {Thijs Laarhoven and Michele Mosca and Joop van de Pol},
  title = {{Finding shortest lattice vectors faster using quantum search}},
  journal = {Designs, Codes and Cryptography},
  year = {2015},
  volume = {77},
  pages = {375--400},
  doi = {10.1007/s10623-015-0067-5},
  url = {https://doi.org/10.1007/s10623-015-0067-5},
  cr_date = {2015-04-14},
  cr_status = {published},
  cr_venue = {Designs, Codes and Cryptography},
  cr_author_ids = {thijs-laarhoven; michele-mosca; joop-van-de-pol}
}

@inproceedings{paper-e014be9a6925,
  author = {Paul Kirchner and Pierre-Alain Fouque},
  title = {{An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices}},
  booktitle = {Advances in Cryptology -- CRYPTO 2015},
  year = {2015},
  volume = {9215},
  pages = {43--62},
  publisher = {Springer},
  doi = {10.1007/978-3-662-47989-6_3},
  url = {https://arxiv.org/abs/1506.02717},
  cr_date = {2015-06-08},
  cr_status = {published},
  cr_venue = {Advances in Cryptology -- CRYPTO 2015},
  cr_author_ids = {paul-kirchner; pierre-alain-fouque},
  series = {Lecture Notes in Computer Science}
}

@misc{paper-eb07a87a7ce7,
  author = {Divesh Aggarwal and Daniel Dadush and Noah Stephens-Davidowitz},
  title = {{Solving the Closest Vector Problem in 2^n Time---The Discrete Gaussian Strikes Again!}},
  year = {2015},
  url = {https://arxiv.org/abs/1504.01995},
  cr_date = {2015-04-08},
  cr_status = {published},
  cr_author_ids = {divesh-aggarwal; daniel-dadush; noah-stephens-davidowitz},
  howpublished = {FOCS 2015; arXiv:1504.01995},
  cr_venue = {FOCS 2015}
}

@misc{paper-f1a990a4cd6f,
  author = {Anja Becker and Antoine Joux and Alexander May and Alexander Meurer},
  title = {{Decoding Random Binary Linear Codes in 2^(n/20): How 1+1=0 Improves Information Set Decoding}},
  year = {2012},
  url = {https://eprint.iacr.org/2012/026},
  cr_date = {2012-01-20},
  cr_status = {published},
  cr_author_ids = {anja-becker; antoine-joux; alexander-may; alexander-meurer},
  howpublished = {EUROCRYPT 2012; full version Cryptology ePrint Archive, Paper 2012/026}
}

@inproceedings{paper-f792611a7feb,
  author = {Erik Mårtensson},
  title = {{The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors}},
  booktitle = {2019 IEEE International Symposium on Information Theory (ISIT)},
  year = {2019},
  pages = {2579--2583},
  publisher = {IEEE},
  doi = {10.1109/ISIT.2019.8849218},
  url = {https://arxiv.org/abs/1901.06558},
  cr_date = {2019-01-19},
  cr_status = {published},
  cr_venue = {2019 IEEE International Symposium on Information Theory (ISIT)},
  cr_author_ids = {erik-martensson},
  archiveprefix = {arXiv},
  eprint = {1901.06558}
}

@misc{paper-fd038bb9c63f,
  author = {Yiming Gao and Xuyuan Han and Honggang Hu},
  title = {{Gaussian Difference Dynamics: Breaking the 2^(n/2) Barrier for the Shortest Vector Problem and Discrete Gaussian Sampling}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/2690},
  cr_date = {2026-10-30},
  cr_status = {preprint},
  cr_author_ids = {yiming-gao; xuyuan-han; honggang-hu},
  howpublished = {Cryptology ePrint Archive, Paper 2026/2690}
}

@inproceedings{peikert-2010-gaussian,
  author = {Chris Peikert},
  title = {{An Efficient and Parallel Gaussian Sampler for Lattices}},
  booktitle = {Advances in Cryptology -- CRYPTO 2010},
  year = {2010},
  pages = {80--97},
  doi = {10.1007/978-3-642-14623-7_5},
  url = {https://doi.org/10.1007/978-3-642-14623-7_5},
  cr_date = {2010-12-31},
  cr_status = {published},
  cr_venue = {Advances in Cryptology -- CRYPTO 2010},
  cr_author_ids = {chris-peikert}
}

@misc{pilatte24,
  author = {Cédric Pilatte},
  title = {{Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms}},
  journal = {Forum of Mathematics, Pi 14, e5},
  year = {2026},
  doi = {10.1017/fmp.2025.10023},
  url = {https://arxiv.org/abs/2404.16450},
  keywords = {quantum, factoring, discrete logarithms, unconditional},
  cr_date = {2024-04-25},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Forum of Mathematics, Pi 14, e5},
  cr_author_ids = {cedric-pilatte}
}

@article{pollard78,
  author = {John M. Pollard},
  title = {{Monte Carlo methods for index computation (mod p)}},
  journal = {Mathematics of Computation 32(143), 918–924},
  year = {1978},
  doi = {10.1090/S0025-5718-1978-0491431-9},
  url = {https://www.ams.org/mcom/1978-32-143/S0025-5718-1978-0491431-9/S0025-5718-1978-0491431-9.pdf},
  keywords = {discrete logarithms, rho, generic groups, interval discrete logarithms},
  cr_date = {1978-07-31},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {Mathematics of Computation 32(143), 918–924},
  cr_author_ids = {john-m-pollard}
}

@misc{prange1962,
  author = {Eugene Prange},
  title = {{The use of information sets in decoding cyclic codes}},
  year = {1962},
  url = {https://doi.org/10.1109/TIT.1962.1057777},
  cr_date = {1962-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {IRE Transactions on Information Theory},
  cr_author_ids = {eugene-prange}
}

@article{regev-2004-cvpp,
  author = {Oded Regev},
  title = {{Improved Inapproximability of Lattice and Coding Problems with Preprocessing}},
  year = {2004},
  doi = {10.1109/TIT.2004.833350},
  url = {https://cims.nyu.edu/~regev/papers/cvpp.pdf},
  keywords = {CVP, lattice algorithms},
  cr_date = {2004-09-30},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {IEEE Transactions on Information Theory},
  cr_author_ids = {oded-regev},
  howpublished = {IEEE Transactions on Information Theory}
}

@unpublished{regev-2004-svp-lecture,
  author = {Oded Regev and Michael Khanevsky},
  title = {{2^{O(n)}-time algorithm for SVP}},
  year = {2004},
  url = {https://cims.nyu.edu/~regev/teaching/lattices_fall_2004/ln/svpalg.pdf},
  cr_date = {2004-12-31},
  cr_date_precision = {year},
  cr_status = {preprint},
  cr_venue = {Lattices in Computer Science, Lecture 8},
  cr_author_ids = {oded-regev; michael-khanevsky},
  note = {Lattices in Computer Science, Lecture 8. Lecturer: Oded Regev; scribe: Michael Khanevsky}
}

@misc{regev23,
  author = {Oded Regev},
  title = {{An Efficient Quantum Factoring Algorithm}},
  journal = {Journal of the ACM 72(1), Article 10},
  year = {2025},
  doi = {10.1145/3708471},
  url = {https://arxiv.org/abs/2308.06572},
  keywords = {quantum, factoring, lattices},
  cr_date = {2023-08-12},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Journal of the ACM 72(1), Article 10},
  cr_author_ids = {oded-regev}
}

@misc{rnsl17,
  author = {Martin Roetteler and Michael Naehrig and Krysta M. Svore and Kristin Lauter},
  title = {{Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms}},
  journal = {ASIACRYPT 2017},
  year = {2017},
  doi = {10.1007/978-3-319-70697-9_9},
  url = {https://eprint.iacr.org/2017/598},
  keywords = {quantum, elliptic curves, prime fields, logical resources},
  cr_date = {2017-06-21},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {ASIACRYPT 2017},
  cr_author_ids = {martin-roetteler; michael-naehrig; krysta-m-svore; kristin-lauter}
}

@misc{robert22,
  author = {Damien Robert},
  title = {{Breaking SIDH in polynomial time}},
  year = {2023},
  doi = {10.1007/978-3-031-30589-4_17},
  url = {https://eprint.iacr.org/2022/1038},
  keywords = {SIDH, polynomial time, torsion images},
  cr_date = {2022-08-10},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {EUROCRYPT 2023},
  cr_author_ids = {damien-robert}
}

@inproceedings{rothvoss-venzin-2021,
  author = {Thomas Rothvoss and Moritz Venzin},
  title = {{Approximate CVP in time 2^(0.802 n) -- now in any norm!}},
  year = {2022},
  url = {https://arxiv.org/abs/2110.02387},
  keywords = {CVP, lattice algorithms},
  cr_date = {2021-10-05},
  cr_status = {published},
  cr_venue = {IPCO 2022},
  cr_author_ids = {thomas-rothvoss; moritz-venzin},
  howpublished = {IPCO 2022}
}

@misc{saarinen2026-holdout,
  author = {Markku-Juhani O. Saarinen},
  title = {{Bit Operation Cost of ``Holdout'' Key-Recovery Attacks Against Classic McEliece}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1786},
  cr_date = {2026-08-24},
  cr_status = {preprint},
  cr_author_ids = {markku-juhani-o-saarinen}
}

@article{schirokauer00,
  author = {Oliver Schirokauer},
  title = {{Using number fields to compute logarithms in finite fields}},
  journal = {Mathematics of Computation 69(231), 1267–1283},
  year = {2000},
  doi = {10.1090/S0025-5718-99-01137-0},
  url = {https://doi.org/10.1090/S0025-5718-99-01137-0},
  keywords = {discrete logarithms, number field sieve, fixed extension degree},
  cr_date = {1999-05-24},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Mathematics of Computation 69(231), 1267–1283},
  cr_author_ids = {oliver-schirokauer}
}

@article{schirokauer02,
  author = {Oliver Schirokauer},
  title = {{The Special Function Field Sieve}},
  journal = {SIAM Journal on Discrete Mathematics 16(1), 81–98},
  year = {2002},
  doi = {10.1137/S0895480100372668},
  url = {https://epubs.siam.org/doi/10.1137/S0895480100372668},
  keywords = {discrete logarithms, function field sieve, special primes},
  cr_date = {2002-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {SIAM Journal on Discrete Mathematics 16(1), 81–98},
  cr_author_ids = {oliver-schirokauer}
}

@article{schirokauer93,
  author = {Oliver Schirokauer},
  title = {{Discrete Logarithms and Local Units}},
  journal = {Philosophical Transactions of the Royal Society A 345(1676), 409–423},
  year = {1993},
  doi = {10.1098/rsta.1993.0139},
  url = {https://doi.org/10.1098/rsta.1993.0139},
  keywords = {discrete logarithms, number field sieve, local units},
  cr_date = {1993-11-15},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Philosophical Transactions of the Royal Society A 345(1676), 409–423},
  cr_author_ids = {oliver-schirokauer}
}

@misc{shor95,
  author = {Peter W. Shor},
  title = {{Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer}},
  journal = {SIAM Journal on Computing 26(5), 1484–1509},
  year = {1997},
  doi = {10.1137/S0097539795293172},
  url = {https://arxiv.org/abs/quant-ph/9508027},
  keywords = {quantum, factoring, discrete logarithms},
  cr_date = {1995-08-30},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {SIAM Journal on Computing 26(5), 1484–1509},
  cr_author_ids = {peter-w-shor}
}

@article{smart97,
  author = {Nigel P. Smart},
  title = {{The Discrete Logarithm Problem on Elliptic Curves of Trace One}},
  journal = {Journal of Cryptology 12(3), 193–196; earlier report HPL-97-128},
  year = {1999},
  doi = {10.1007/s001459900052},
  url = {https://research-information.bris.ac.uk/en/publications/the-discrete-logarithm-problem-on-elliptic-curves-of-trace-one/},
  keywords = {elliptic curves, anomalous curves, trace one},
  cr_date = {1997-10-31},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {Journal of Cryptology 12(3), 193–196; earlier report HPL-97-128},
  cr_author_ids = {nigel-p-smart}
}

@inproceedings{stephens-davidowitz-2016-dgs,
  author = {Noah Stephens-Davidowitz},
  title = {{Discrete Gaussian Sampling Reduces to CVP and SVP}},
  booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)},
  year = {2016},
  url = {https://arxiv.org/abs/1506.07490},
  cr_date = {2015-06-24},
  cr_status = {published},
  cr_venue = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)},
  cr_author_ids = {noah-stephens-davidowitz}
}

@misc{udovenko26-isogeny,
  author = {Aleksei Udovenko},
  title = {{Solving the supersingular isogeny problem in time $p^{2/5+o(1)}$ using bivariate multipoint evaluation}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1575},
  keywords = {supersingular isogenies, unconditional, multipoint evaluation},
  cr_date = {2026-08-03},
  cr_date_precision = {day},
  cr_status = {preprint},
  cr_venue = {Cryptology ePrint Archive 2026/1575},
  cr_author_ids = {aleksei-udovenko}
}

@misc{vedenev2026,
  author = {Kirill Vedenev},
  title = {{Extending Distinguishing to Key Recovery for Subfield Subcodes of GRS codes}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1747},
  cr_date = {2026-08-20},
  cr_status = {preprint},
  cr_author_ids = {kirill-vedenev}
}

@misc{wang2026-goppa,
  author = {Yongge Wang},
  title = {{Projective Jet Geometry and Hold-Out Rank of Binary Goppa Codes}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/2769},
  cr_date = {2026-11-04},
  cr_status = {preprint},
  cr_author_ids = {yongge-wang}
}

@misc{wesolowski26-isogeny,
  author = {Benjamin Wesolowski},
  title = {{The supersingular isogeny problem in time and memory $p^{1/3+o(1)}$}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1486},
  keywords = {supersingular isogenies, smoothness heuristic, endomorphism rings},
  cr_date = {2026-07-23},
  cr_date_precision = {day},
  cr_status = {preprint},
  cr_venue = {Cryptology ePrint Archive 2026/1486},
  cr_author_ids = {benjamin-wesolowski}
}

@misc{wz11,
  author = {Ping Wang and Fangguo Zhang},
  title = {{Computing Elliptic Curve Discrete Logarithms with the Negation Map}},
  journal = {Information Sciences 195},
  year = {2012},
  url = {https://eprint.iacr.org/2011/008},
  keywords = {elliptic curves, rho, negation map, fruitless cycles},
  cr_date = {2011-01-05},
  cr_date_precision = {day},
  cr_status = {published},
  cr_venue = {Information Sciences 195},
  cr_author_ids = {ping-wang; fangguo-zhang}
}

@misc{yu-et-al2026-sieving,
  author = {Tong Yu and Haodong Jiang and Hong Wang and Rongmao Chen and Qingfeng Cheng and Xinyi Huang and Yuefei Zhu},
  title = {{Progressive Sieving-Style Information-Set Decoding Algorithm}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/633},
  cr_date = {2026-04-01},
  cr_status = {preprint},
  cr_author_ids = {tong-yu; haodong-jiang; hong-wang; rongmao-chen; qingfeng-cheng; xinyi-huang; yuefei-zhu}
}