% Bibliography of the 2877 items from 1989 counted in the Cryptanalytic Effort study.
% Generated 2026-10-11 by pipeline/build_bibliography.py from data/export/combined_included.csv.
% Custom fields: classes, category, rationale, vetted, peerreviewed, quantum, sources, studyid.

@article{zbmath:0684.10005,
  author       = {te Riele, Herman J. J. and Lioen, Walter and Winter, Dik},
  title        = {{Factoring with the quadratic sieve on large vector computers}},
  journal      = {Journal of Computational and Applied Mathematics},
  year         = {1989},
  doi          = {10.1016/0377-0427(89)90370-1},
  url          = {https://doi.org/10.1016/0377-0427(89)90370-1},
  classes      = {Factoring/FF-DLP 1},
  category     = {E},
  rationale    = {Quadratic sieve on vector supercomputers; factored a 93-digit number.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {zbmath},
  studyid      = {zb:0684.10005},
  countyear    = {1989},
  venuenote    = {published venue resolved from crossref 10.1016/0377-0427(89)90370-1 [+crossref,zbmath] (confidence 0.98)}
}

@article{zbmath:0692.10009,
  author       = {Vallée, Brigitte},
  title        = {{Factorisation entière par génération quasi-uniforme de petits résidus quadratiques. (Integer factorization with quasi-uniform generation of small quadratic residues)}},
  journal      = {Comptes Rendus de l'Académie des Sciences. Série I},
  year         = {1989},
  url          = {https://zbmath.org/?q=an:0692.10009},
  classes      = {Factoring/FF-DLP 1},
  category     = {A},
  rationale    = {Rigorous L(n)\^{}sqrt(4/3) factoring via small quadratic residues.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {zbmath},
  studyid      = {zb:0692.10009},
  countyear    = {1989},
  venuenote    = {published venue resolved from zbmath 0692.10009 (confidence 0.90)}
}

@inproceedings{zbmath:0692.10005,
  author       = {Vallée, Brigitte and Girault, Marc and Toffin, Philippe},
  title        = {{How to guess \textbackslash{}(\textbackslash{}ell\textbackslash{})-th roots modulo n by reducing lattice bases}},
  booktitle    = {AAECC},
  year         = {1988},
  doi          = {10.1007/3-540-51083-4_78},
  url          = {https://doi.org/10.1007/3-540-51083-4_78},
  classes      = {},
  category     = {A},
  rationale    = {Lattice reduction recovers l-th roots mod n given approximation; attacks Okamoto cryptosystem.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {zbmath},
  studyid      = {zb:0692.10005},
  countyear    = {1989},
  venuenote    = {published venue resolved from dblp conf/aaecc/ToffinGV88 (retitled? sim 0.84: -th Roots Modulo n by Reducing Lattice Bases) (confidence 0.85)}
}

@inproceedings{openalex:W2027157239,
  author       = {Johan Håstad and Bettina Just and Jeffrey C. Lagarias and Claus Peter Schnorr},
  title        = {{Polynomial Time Algorithms for Finding Integer Relations among Real Numbers}},
  booktitle    = {STACS 1986},
  year         = {1986},
  doi          = {10.1137/0218059},
  url          = {https://doi.org/10.1137/0218059},
  classes      = {Lattices 1},
  category     = {A},
  rationale    = {HJLS integer relation algorithms linked to LLL; generic reduction machinery.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {openalex_snowball},
  studyid      = {W2027157239},
  countyear    = {1989},
  venuenote    = {published venue resolved from dblp conf/stacs/HastadHLS86 (confidence 0.95)}
}