% Bibliography of the 2877 items from 1994 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.

@misc{openalex:W2302994590,
  author       = {Anne Canteaut and Hervé Chabanne},
  title        = {{A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem}},
  howpublished = {INRIA a CCSD electronic archive server},
  year         = {1994},
  url          = {https://openalex.org/W2302994590},
  classes      = {Syndrome decoding 1},
  category     = {A},
  rationale    = {Improved ISD work factor for attacking McEliece.},
  vetted       = {no},
  peerreviewed = {no},
  quantum      = {no},
  sources      = {openalex_snowball},
  studyid      = {W2302994590},
  countyear    = {1994},
  venuenote    = {published venue resolved from openalex W2302994590 S4406922276 (confidence 0.80)}
}

@article{zbmath:0813.14045,
  author       = {Frey, Gerhard and Rück, Hans-Georg},
  title        = {{A remark concerning \textbackslash{}(m\textbackslash{})-divisibility and the discrete logarithm in the divisor class group of curves}},
  journal      = {Mathematics of Computation},
  year         = {1994},
  doi          = {10.2307/2153546},
  url          = {https://doi.org/10.2307/2153546},
  classes      = {ECDLP 1},
  category     = {C},
  rationale    = {Frey-Ruck pairing reduction of curve DLP to finite field DLP.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {zbmath},
  studyid      = {zb:0813.14045},
  countyear    = {1994},
  venuenote    = {published venue resolved from crossref 10.2307/2153546 [+crossref,zbmath] (confidence 0.98)}
}

@article{openalex:W4253109663,
  author       = {Gerhard Frey and Hans-Georg Rück},
  title        = {{A remark concerning 𝑚-divisibility and the discrete logarithm in the divisor class group of curves}},
  journal      = {Mathematics of Computation},
  year         = {1994},
  doi          = {10.1090/s0025-5718-1994-1218343-6},
  url          = {https://doi.org/10.1090/s0025-5718-1994-1218343-6},
  classes      = {ECDLP 1},
  category     = {C},
  rationale    = {Frey-Rück Tate-pairing reduction of curve DLP to finite-field DLP.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {openalex_snowball},
  studyid      = {W4253109663},
  countyear    = {1994},
  venuenote    = {published venue resolved from crossref 10.1090/s0025-5718-1994-1218343-6 [+crossref,openalex] (confidence 0.98)}
}

@inproceedings{dblp:conf-ants-AdlemanDH94,
  author       = {Leonard M. Adleman and Jonathan DeMarrais and Ming-Deh A. Huang},
  title        = {{A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields}},
  booktitle    = {ANTS (Algorithmic Number Theory Symposium) 1994},
  year         = {1994},
  doi          = {10.1007/3-540-58691-1_39},
  url          = {https://doi.org/10.1007/3-540-58691-1_39},
  classes      = {ECDLP 1},
  category     = {A},
  rationale    = {Subexponential DLP algorithm in large-genus hyperelliptic Jacobians.},
  vetted       = {yes},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {dblp, openalex_phrase, zbmath},
  studyid      = {dblp:conf/ants/AdlemanDH94},
  countyear    = {1994},
  venuenote    = {published venue resolved from dblp conf/ants/AdlemanDH94 [+crossref,dblp-self] (confidence 1.00)}
}

@article{dblp:journals-tcs-DaudeV94,
  author       = {Hervé Daudé and Brigitte Vallée},
  title        = {{An Upper Bound on the Average Number of Iterations of the LLL Algorithm}},
  journal      = {Theoretical Computer Science},
  year         = {1994},
  doi          = {10.1016/0304-3975(94)90071-x},
  url          = {https://doi.org/10.1016/0304-3975(94)90071-x},
  classes      = {Lattices 1},
  category     = {A},
  rationale    = {Average-case analysis of LLL iteration count (v0.3.4: reduction analyses are yes).},
  vetted       = {yes},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {dblp, openalex_snowball},
  studyid      = {dblp:journals/tcs/DaudeV94},
  countyear    = {1994},
  venuenote    = {published venue resolved from dblp journals/tcs/DaudeV94 [+crossref,dblp-self] (confidence 1.00)}
}

@article{openalex:W2116916711,
  author       = {Claus Peter Schnorr},
  title        = {{Block Reduced Lattice Bases and Successive Minima}},
  journal      = {Combinatorics, Probability and Computing},
  year         = {1994},
  doi          = {10.1017/s0963548300001371},
  url          = {https://doi.org/10.1017/s0963548300001371},
  classes      = {Lattices 1},
  category     = {A},
  rationale    = {Block-reduced bases bounds and improved nearby-lattice-point (CVP) algorithm.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {openalex},
  studyid      = {W2116916711},
  countyear    = {1994},
  venuenote    = {published venue resolved from crossref 10.1017/s0963548300001371 (confidence 0.95)}
}

@article{openalex:W1970209803,
  author       = {V. I. Nechaev},
  title        = {{Complexity of a determinate algorithm for the discrete logarithm}},
  journal      = {Mathematical Notes},
  year         = {1994},
  doi          = {10.1007/bf02113297},
  url          = {https://doi.org/10.1007/bf02113297},
  classes      = {ECDLP 0.5, Factoring/FF-DLP 0.5},
  category     = {F},
  rationale    = {Nechaev's generic lower bound: optimality of baby-step giant-step for DL.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {openalex, zbmath},
  studyid      = {W1970209803},
  countyear    = {1994},
  venuenote    = {published venue resolved from crossref 10.1007/bf02113297 [+crossref,openalex] (confidence 0.98)}
}

@inproceedings{dblp:conf-ants-GolliverLM94,
  author       = {Roger A. Golliver and Arjen K. Lenstra and Kevin S. McCurley},
  title        = {{Lattice sieving and trial division}},
  booktitle    = {ANTS (Algorithmic Number Theory Symposium) 1994},
  year         = {1994},
  doi          = {10.1007/3-540-58691-1_38},
  url          = {https://doi.org/10.1007/3-540-58691-1_38},
  classes      = {Factoring/FF-DLP 1},
  category     = {A},
  rationale    = {Lattice sieving and trial division for NFS relation collection.},
  vetted       = {yes},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {dblp, openalex_phrase, zbmath},
  studyid      = {dblp:conf/ants/GolliverLM94},
  countyear    = {1994},
  venuenote    = {published venue resolved from dblp conf/ants/GolliverLM94 [+crossref,dblp-self] (confidence 1.00)}
}

@inproceedings{dblp:conf-ccs-OorschotW94,
  author       = {Paul C. van Oorschot and Michael J. Wiener},
  title        = {{Parallel Collision Search with Application to Hash Functions and Discrete Logarithms}},
  booktitle    = {ACM CCS 1994},
  year         = {1994},
  doi          = {10.1145/191177.191231},
  url          = {https://doi.org/10.1145/191177.191231},
  classes      = {ECDLP 0.6, Factoring/FF-DLP 0.2},
  category     = {A},
  rationale    = {Parallel collision search for discrete logs (rho/lambda) with EC cost estimates.},
  vetted       = {yes},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {dblp, openalex_snowball},
  studyid      = {dblp:conf/ccs/OorschotW94},
  countyear    = {1994},
  venuenote    = {published venue resolved from dblp conf/ccs/OorschotW94 [+crossref,dblp-self] (confidence 1.00)}
}

@article{zbmath:0802.11058,
  author       = {Sorenson, Jonathan},
  title        = {{Polylog depth circuits for integer factoring and discrete logarithms}},
  journal      = {Information and Computation},
  year         = {1994},
  doi          = {10.1006/inco.1994.1021},
  url          = {https://doi.org/10.1006/inco.1994.1021},
  classes      = {Factoring/FF-DLP 1},
  category     = {A},
  rationale    = {Polylog-depth parallel circuits for factoring and prime-field discrete logs.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {zbmath},
  studyid      = {zb:0802.11058},
  countyear    = {1994},
  venuenote    = {published venue resolved from dblp journals/iandc/Sorenson94 [+crossref,dblp-title,zbmath] (confidence 1.00)}
}

@inproceedings{zbmath:1005.11506,
  author       = {Shor, Peter W.},
  title        = {{Polynomial time algorithms for discrete logarithms and factoring on a quantum computer. (Abstract)}},
  booktitle    = {ANTS (Algorithmic Number Theory Symposium) 1994},
  year         = {1994},
  doi          = {10.1007/3-540-58691-1_68},
  url          = {https://doi.org/10.1007/3-540-58691-1_68},
  classes      = {},
  category     = {B},
  rationale    = {Shor's quantum polynomial-time factoring and discrete log algorithms (abstract).},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {yes},
  version      = {same work as dblp:conf-ants-Shor94; counted there, weight 0 here},
  sources      = {zbmath},
  studyid      = {zb:1005.11506},
  countyear    = {1994},
  venuenote    = {published venue resolved from crossref 10.1007/3-540-58691-1\_68 [+crossref,dblp-fuzzy] (confidence 0.98)}
}

@inproceedings{dblp:conf-ants-Shor94,
  author       = {Peter W. Shor},
  title        = {{Polynominal time algorithms for discrete logarithms and factoring on a quantum computer}},
  booktitle    = {ANTS (Algorithmic Number Theory Symposium) 1994},
  year         = {1994},
  doi          = {10.1007/3-540-58691-1_68},
  url          = {https://doi.org/10.1007/3-540-58691-1_68},
  classes      = {ECDLP 0.25, Factoring/FF-DLP 0.75},
  category     = {B},
  rationale    = {Shor's quantum polynomial-time factoring and discrete log algorithms.},
  vetted       = {yes},
  peerreviewed = {yes},
  quantum      = {yes},
  sources      = {dblp},
  studyid      = {dblp:conf/ants/Shor94},
  countyear    = {1994},
  venuenote    = {published venue resolved from dblp conf/ants/Shor94 [+crossref,dblp-self] (confidence 1.00)}
}

@misc{zbmath:0813.94010,
  author       = {van Tilburg, Johan},
  title        = {{Security-analysis of a class of cryptosystems based on linear error- correcting codes}},
  year         = {1994},
  url          = {https://zbmath.org/?q=an:0813.94010},
  classes      = {Syndrome decoding 1},
  category     = {A},
  rationale    = {Thesis with new probabilistic syndrome decoding algorithm and McEliece security analysis.},
  vetted       = {no},
  peerreviewed = {no},
  quantum      = {no},
  sources      = {zbmath},
  studyid      = {zb:0813.94010},
  countyear    = {1994}
}

@article{openalex:W1993840452,
  author       = {Don Coppersmith},
  title        = {{Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm}},
  journal      = {Mathematics of Computation},
  year         = {1994},
  doi          = {10.2307/2153413},
  url          = {https://doi.org/10.2307/2153413},
  classes      = {Factoring/FF-DLP 1},
  category     = {A},
  rationale    = {Block Wiedemann for GF(2) linear algebra stage of factoring.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {openalex_phrase, zbmath},
  studyid      = {W1993840452},
  countyear    = {1994},
  venuenote    = {published venue resolved from crossref 10.2307/2153413 [+crossref,openalex] (confidence 0.98)}
}

@article{openalex:W4230654384,
  author       = {Don Coppersmith},
  title        = {{Solving homogeneous linear equations over 𝐺𝐹(2) via block Wiedemann algorithm}},
  journal      = {Mathematics of Computation},
  year         = {1994},
  doi          = {10.1090/s0025-5718-1994-1192970-7},
  url          = {https://doi.org/10.1090/s0025-5718-1994-1192970-7},
  classes      = {Factoring/FF-DLP 1},
  category     = {A},
  rationale    = {Block Wiedemann over GF(2), standard linear algebra step of factoring sieves.},
  vetted       = {no},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {openalex_phrase},
  studyid      = {W4230654384},
  countyear    = {1994},
  venuenote    = {published venue resolved from crossref 10.1090/s0025-5718-1994-1192970-7 [+crossref,openalex] (confidence 0.98)}
}

@incollection{zbmath:0819.11069,
  author       = {Montgomery, Peter L.},
  title        = {{Square roots of products of algebraic numbers}},
  booktitle    = {Mathematics of Computation 1943-1993 (AMS Proc. Symp. Appl. Math. 48)},
  year         = {1994},
  url          = {https://zbmath.org/?q=an:0819.11069},
  classes      = {Factoring/FF-DLP 1},
  category     = {A},
  rationale    = {Montgomery square-root step for the number field sieve.},
  vetted       = {no},
  peerreviewed = {no},
  quantum      = {no},
  sources      = {zbmath},
  studyid      = {zb:0819.11069},
  countyear    = {1994},
  venuenote    = {published venue resolved from zbMATH API source field (confidence 0.90)}
}

@inproceedings{dblp:conf-ants-Adleman94,
  author       = {Leonard M. Adleman},
  title        = {{The function field sieve}},
  booktitle    = {ANTS (Algorithmic Number Theory Symposium) 1994},
  year         = {1994},
  doi          = {10.1007/3-540-58691-1_48},
  url          = {https://doi.org/10.1007/3-540-58691-1_48},
  classes      = {Factoring/FF-DLP 1},
  category     = {A},
  rationale    = {Function field sieve for discrete logs in GF(p\^{}n).},
  vetted       = {yes},
  peerreviewed = {yes},
  quantum      = {no},
  sources      = {dblp, openalex_phrase, zbmath},
  studyid      = {dblp:conf/ants/Adleman94},
  countyear    = {1994},
  venuenote    = {published venue resolved from dblp conf/ants/Adleman94 [+crossref,dblp-self] (confidence 1.00)}
}