% Bibliography of the 2877 items from 1997 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. @incollection{openalex:W3195244309, author = {Igor Semaev}, title = {{A GENERALIZATION OF THE NUMBER FIELD SIEVE}}, booktitle = {Probabilistic Methods in Discrete Mathematics}, year = {1997}, doi = {10.1515/9783112314074-006}, url = {https://doi.org/10.1515/9783112314074-006}, classes = {Factoring/FF-DLP 1}, category = {A}, rationale = {Generalized NFS gains for integers of special forms.}, vetted = {no}, peerreviewed = {no}, quantum = {no}, sources = {openalex_phrase, zbmath}, studyid = {W3195244309}, countyear = {1997}, venuenote = {published venue resolved from crossref 10.1515/9783112314074-006 (confidence 0.95)} } @article{openalex:W1562031171, author = {Peter L. Montgomery and Stefania Cavallar and H.J.J. teRiele}, title = {{A new world record for the special number field sieve factoring method}}, journal = {Quarterly - Centrum voor Wiskunde en Informatica}, year = {1997}, url = {https://openalex.org/W1562031171}, classes = {Factoring/FF-DLP 1}, category = {E}, rationale = {SNFS world-record factorization announcement via NFSNET.}, vetted = {no}, peerreviewed = {yes}, quantum = {no}, sources = {openalex_phrase, zbmath}, studyid = {W1562031171}, countyear = {1997}, venuenote = {published venue resolved from openalex W1562031171 S2764599257 (confidence 0.80)} } @misc{eprint:1997-008, author = {Harald Ritter and Carsten Roessner}, title = {{Factoring via Strong Lattice Reduction Algorithms}}, howpublished = {Cryptology {ePrint} Archive, Paper 1997/008}, eprint = {1997/008}, eprinttype = {iacr}, year = {1997}, url = {https://eprint.iacr.org/1997/008}, classes = {Factoring/FF-DLP 1}, category = {A}, rationale = {Schnorr lattice-based factoring with stronger reduction; factors 60-bit integers.}, vetted = {yes}, peerreviewed = {no}, quantum = {no}, sources = {eprint}, studyid = {1997/008}, countyear = {1997} } @article{zbmath:0903.68083, author = {Rote, Günter}, title = {{Finding a shortest vector in a two-dimensional lattice modulo m}}, journal = {Theoretical Computer Science}, year = {1997}, doi = {10.1016/S0304-3975(96)00185-5}, url = {https://doi.org/10.1016/S0304-3975(96)00185-5}, classes = {Lattices 1}, category = {A}, rationale = {Algorithm for shortest vector in 2D modular lattices.}, vetted = {no}, peerreviewed = {yes}, quantum = {no}, sources = {zbmath}, studyid = {zb:0903.68083}, countyear = {1997}, venuenote = {published venue resolved from dblp journals/tcs/Rote97 [+crossref,dblp-title,zbmath] (confidence 1.00)} } @inproceedings{zbmath:0922.11113, author = {Howgrave-Graham, Nicholas}, title = {{Finding small roots of univariate modular equations revisited}}, booktitle = {Crytography and Coding}, year = {1997}, doi = {10.1007/bfb0024458}, url = {https://doi.org/10.1007/bfb0024458}, classes = {}, category = {A}, rationale = {Howgrave-Graham reformulation of Coppersmith small modular roots.}, vetted = {no}, peerreviewed = {yes}, quantum = {no}, sources = {zbmath}, studyid = {zb:0922.11113}, countyear = {1997}, venuenote = {published venue resolved from crossref 10.1007/bfb0024458 (confidence 0.95)} } @inproceedings{dblp:conf-issac-Villard97, author = {Gilles Villard}, title = {{Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract)}}, booktitle = {ISSAC 1997}, year = {1997}, doi = {10.1145/258726.258742}, url = {https://doi.org/10.1145/258726.258742}, classes = {Factoring/FF-DLP 1}, category = {A}, rationale = {Analysis of block Wiedemann, the sparse linear algebra used in NFS/index calculus.}, vetted = {yes}, peerreviewed = {yes}, quantum = {no}, sources = {dblp}, studyid = {dblp:conf/issac/Villard97}, countyear = {1997}, venuenote = {published venue resolved from dblp conf/issac/Villard97 [+crossref,dblp-self] (confidence 1.00)} } @inproceedings{dblp:conf-eurocrypt-CoppersmithS97, author = {Don Coppersmith and Adi Shamir}, title = {{Lattice Attacks on NTRU}}, booktitle = {EUROCRYPT 1997}, year = {1997}, doi = {10.1007/3-540-69053-0_5}, url = {https://doi.org/10.1007/3-540-69053-0_5}, classes = {Lattices 1}, category = {A}, rationale = {Lattice attacks on NTRU.}, vetted = {yes}, peerreviewed = {yes}, quantum = {no}, sources = {dblp, openalex_doi, openalex_phrase}, studyid = {dblp:conf/eurocrypt/CoppersmithS97}, countyear = {1997}, venuenote = {published venue resolved from dblp conf/eurocrypt/CoppersmithS97 [+crossref,dblp-self] (confidence 1.00)} } @inproceedings{dblp:conf-eurocrypt-Shoup97, author = {Victor Shoup}, title = {{Lower Bounds for Discrete Logarithms and Related Problems}}, booktitle = {EUROCRYPT 1997}, year = {1997}, doi = {10.1007/3-540-69053-0_18}, url = {https://doi.org/10.1007/3-540-69053-0_18}, classes = {ECDLP 0.5, Factoring/FF-DLP 0.5}, category = {F}, rationale = {Generic-group lower bounds for discrete logarithms.}, vetted = {yes}, peerreviewed = {yes}, quantum = {no}, sources = {dblp, openalex}, studyid = {dblp:conf/eurocrypt/Shoup97}, countyear = {1997}, venuenote = {published venue resolved from dblp conf/eurocrypt/Shoup97 [+crossref,dblp-self] (confidence 1.00)} } @inproceedings{dblp:conf-cats-MurphyB98, author = {Brian Murphy and Richard P. Brent}, title = {{On Quadratic Polynomials for the Number Field Sieve}}, booktitle = {CATS}, year = {1998}, url = {https://dblp.org/rec/conf/cats/MurphyB98}, classes = {Factoring/FF-DLP 1}, category = {A}, rationale = {Smoothness yield analysis for NFS quadratic polynomial selection.}, vetted = {yes}, peerreviewed = {yes}, quantum = {no}, sources = {dblp, openalex_phrase, zbmath}, studyid = {dblp:conf/cats/MurphyB98}, countyear = {1997}, venuenote = {published venue resolved from dblp conf/cats/MurphyB98 (confidence 1.00)} } @article{dblp:journals-moc-BuchmannJT97, author = {Johannes Buchmann and Michael J. Jacobson Jr. and Edlyn Teske}, title = {{On some computational problems in finite abelian groups}}, journal = {Mathematics of Computation}, year = {1997}, doi = {10.1090/s0025-5718-97-00880-6}, url = {https://doi.org/10.1090/s0025-5718-97-00880-6}, classes = {ECDLP 0.4, Factoring/FF-DLP 0.4}, category = {A}, rationale = {BSGS-based algorithms for DLP, order and structure in generic abelian groups.}, vetted = {yes}, peerreviewed = {yes}, quantum = {no}, sources = {dblp, zbmath}, studyid = {dblp:journals/moc/BuchmannJT97}, countyear = {1997}, venuenote = {published venue resolved from dblp journals/moc/BuchmannJT97 [+crossref,dblp-self] (confidence 1.00)} } @phdthesis{dblp:phd-dnb-Weber97b, author = {Damian Weber}, title = {{On the computation of discrete logarithms in finite prime fields}}, school = {Saarland University}, year = {1997}, doi = {10.22028/d291-25895}, url = {https://doi.org/10.22028/d291-25895}, classes = {Factoring/FF-DLP 1}, category = {E}, rationale = {Thesis with index-calculus DL computations up to 85 digits, McCurley challenge.}, vetted = {yes}, peerreviewed = {no}, quantum = {no}, sources = {dblp, openalex_phrase}, studyid = {dblp:phd/dnb/Weber97b}, countyear = {1997}, venuenote = {published venue resolved from dblp phd/dnb/Weber97b (confidence 1.00)} } @article{dblp:journals-joc-Coppersmith97, author = {Don Coppersmith}, title = {{Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities}}, journal = {Journal of Cryptology}, year = {1997}, doi = {10.1007/s001459900030}, url = {https://doi.org/10.1007/s001459900030}, classes = {}, category = {A}, rationale = {Coppersmith small-roots method; low-exponent RSA and partial-key factoring attacks.}, vetted = {yes}, peerreviewed = {yes}, quantum = {no}, sources = {dblp, zbmath}, studyid = {dblp:journals/joc/Coppersmith97}, countyear = {1997}, venuenote = {published venue resolved from dblp journals/joc/Coppersmith97 [+crossref,dblp-self] (confidence 1.00)} }