Items not included in paper/references.bib (could not be verified, or verified as incorrect)
Date: 2026-11-01. Every entry in references.bib was checked against Crossref, IACR ePrint, arXiv,
DOI resolution, a publisher page or the official standard URL. The items below were requested in the
Stage-1 brief but were either not confirmable or turned out to be mis-stated; they are deliberately
absent from the bibliography (or included only with an explicit caveat).
| Requested item | Status | What was found |
|---|---|---|
| "ECDLP 117.35-bit" record (2016) | Not found — excluded | No source (ePrint 2016/382 abstract, the cr.yp.to copy of the paper, web search) contains a 117.35-bit figure. Bernstein–Engels–Lange–Niederhagen–Paar–Schwabe–Zimmermann 2016 attacked sect113r2 ("a prime order very slightly larger than the previous record holder"); the same paper benchmarks, but does not solve, a curve over a 127-bit field. Only the sect113r2 fact is recorded in records.md. |
| "114-bit" or any prime-field ECDLP record after 2009 | Not found — excluded | Searches returned no completed prime-field ECDLP above the 112-bit computation of Bos et al. (July 2009, published 2012). The Certicom ECCp-131 challenge is listed as open in the 2009 challenge document. |
| Lee–Cheon–Hong 2011 "discrete log with preprocessing" | Included with corrected title | The real document is IACR ePrint 2011/187, Accelerating ID-based Encryption based on Trapdoor DL using Pre-computation (Hyung Tae Lee, Jung Hee Cheon, Jin Hong). It is the paper cited by Corrigan-Gibbs–Kogan as a preprocessing DL algorithm; the brief's title did not match any record. |
| "Aldaya et al. 2020 (LadderLeak)" | Author list corrected | LadderLeak (CCS 2020, DOI 10.1145/3372297.3417268) is by Aranha, Novaes, Takahashi, Tibouchi and Yarom. Key aldaya2020ladderleak. |
| Satoh–Araki 1998 | Included with caveat | Comment. Math. Univ. St. Pauli 47(1):81–92 has no DOI and no Crossref record. Volume/pages were confirmed through three independent citing sources (reference lists, the 1997 Waterloo ECC workshop programme, and a USPTO document). |
| ECC2K-130 "broken" (ePrint 2009/541, Bailey et al.) | Excluded | The ePrint abstract says "describes breaking the ECC2K-130 challenge", but the Certicom challenge document (Nov. 2009) lists ECC2K-130 without an end date and no completion announcement was found. Not recorded as a solved instance. |
| Gilbert–Handschuh 2003 numeric claims (e.g. "9-round collision", "2^9 differential") | Numbers not confirmed | The paper is verified (SAC 2003, LNCS 3006, pp. 175–193) and included; only its qualitative conclusions (Chabaud–Joux / Dobbertin-style attacks do not apply; XOR-linearised variant is weak) are used in db.yaml. |
| Nejati et al. 2018 "programmatic SAT for SHA-1/SHA-256" | Different paper exists — not included | The 2018 paper found is Algebraic Fault Attack on SHA Hash Functions Using Programmatic SAT Solvers (Nejati, Horáček, Gebotys, Ganesh; CP 2018, DOI 10.1007/978-3-319-98334-9_47). It concerns fault attacks, not collision/preimage search, so only the 2017 VSTTE paper (nejati2017adaptive) and alamgir2024sha256 are cited for SAT-based SHA-256 work. The arXiv note CDCL(Crypto) SAT Solvers for Cryptanalysis (Nejati–Ganesh, arXiv:2005.13415) exists but was not needed. |
| Harrison (HOL Light) | Optional — omitted | Not required by the mandate; not searched. |
| Bernstein–Lange 2017 Post-quantum cryptography (Nature 549:188–194, DOI 10.1038/nature23461) | Verified but omitted | Verified via Crossref; left out to keep the bibliography focused (the implications section cites Shor 1997 and Roetteler et al. 2017). Can be added on request. |
| Nikolić–Biryukov 2008 ePrint | n/a | No ePrint version; FSE 2008 DOI used. |
| Kissat system descriptions 2021–2024 | Not individually verified | Only the 2020 SAT Competition description (JKU record: Univ. Helsinki Report Series B, B-2020-1, pp. 50–53) and CaDiCaL 2.0 (CAV 2024, DOI) were verified. |
| LNCS volume numbers | From series knowledge, not Crossref | Crossref does not return LNCS volume numbers for Springer chapters; DOI, pages and year were verified for every chapter, volume numbers were added from the standard LNCS numbering and should be treated as secondary metadata. The ASIACRYPT 2024 volume for li2024first was deliberately left blank. |
| Blackburn–Murphy 1998 "The number of partitions in Pollard rho" | Not found — excluded | No Crossref/DOI record; it is an unpublished manuscript cited by Teske. teske1998speeding / teske2001random are cited for the r-adding-walk partition count instead. |
| Cornacchia 1908 | Optional — omitted | Not searched (not needed by the manuscript). |
| Cheon–Hong–Kim 2012 "Speeding up the Pollard rho method on prime fields" | Title corrected | The J. Cryptology 25(2):195–242 paper is titled Accelerating Pollard's Rho Algorithm on Finite Fields; the ASIACRYPT 2008 version carries the "Speeding up ..." title. Key cheon2012speeding points to the journal version with a note. |