On the public citation graph

https://doi.org/10.5281/zenodo.20252051

0 signed · 5 inferred · view as graph
Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1145/1060590.1060603 On lattices, learning with errors, random linear codes, and cryptography Oded Regev Conference Paper (STOC 2005)zenodo-depositor-declared
inferredcites →https://doi.org/10.1109/SFCS.1994.365700 Algorithms for quantum computation: discrete logarithms and factoring Peter W. Shorzenodo-depositor-declared
inferredcites →https://doi.org/10.1109/EuroSP.2018.00032 CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM Joppe Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, Damien Stehlé Conference Paper (IEEE EuroS&P 2018)zenodo-depositor-declared
inferredcites →https://doi.org/10.1090/S0025-5718-1987-0866109-5 A subexponential algorithm for the discrete logarithm problem with applications to cryptography (Fundación de criptoanálisis subexponencial) Carl Pomerance Journal Article (Mathematics of Computation 1987)zenodo-depositor-declared
inferredcites →https://doi.org/10.5281/zenodo.PIROLO_ZCN_2026 Zero Contact Network: A Discrete Residue Approach to the Riemann Zero Distribution Andrés Sebastián Pirolo Preprint / Companion Publicationzenodo-depositor-declared
Watch this work.
One email when a new claim lands here — something that cites, supports, or refutes it. Nothing else, ever. Leave anytime: the unsubscribe link in any alert, or one line to info@citestamp.com.
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.