Post-Quantum Cryptography: 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The total exponent length is hence n e = 3 m = 1 . 5 n + O (1) qubits, compared to 2 n qubits in Shor's algorithm.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [25]
In the citing paper
“The estimates are for factoring RSA integers with Eker˚ a-H˚ astad's algorithm [23, 25] that computes a short discrete logarithm, see the appendix to [23] for full technical details. As is explained in [23], a single correct run of this quantum algorithm suffices for the RSA integer to be factored with at least 99% success probability in the classical post-processing.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [25]
Citations
Cites
Transitioning to a Quantum-Resistant Public Key Infrastructure
Bindel, N., Herath, U., McKague, M., & Stebila, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_22 · Cited by 179
Bernstein, D. J., Heninger, N., Lou, P., & Valenta, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_18 · Cited by 121
A New Rank Metric Codes Based Encryption Scheme
Loidreau, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_1 · Cited by 99
Quantum Information Set Decoding Algorithms
Kachigar, G., & Tillich, J.-P. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-59879-6_5 · Cited by 69
A Reaction Attack on the QC-LDPC McEliece Cryptosystem
Fabšič, T., Hromada, V., Stankovski, P., Zajac, P., Guo, Q., & Johansson, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_4 · Cited by 66
Revisiting TESLA in the Quantum Random Oracle Model
Alkım, E., Bindel, N., Buchmann, J. A., Dagdelen, Ö., Eaton, E., Gutoski, G., Krämer, J., & Pawlega, F. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_9 · Cited by 64
A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE
Göpfert, F., van Vredendaal, C., & Wunderer, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_11 · Cited by 54
Fault Attack on Supersingular Isogeny Cryptosystems
Ti, Y. B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_7 · Cited by 48
Loop-Abort Faults on Supersingular Isogeny Cryptosystems
Gélin, A., & Wesolowski, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_6 · Cited by 45
Ouroboros: A Simple, Secure and Efficient Key Exchange Protocol Based on Coding Theory
Deneuville, J.-C., Gaborit, P., & Zémor, G. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_2 · Cited by 44
Key Recovery Attack for All Parameters of HFE-
Vates, J., & Smith-Tone, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_16 · Cited by 40
Cabarcas, D., Smith-Tone, D., & Verbel, J. A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_17 · Cited by 37
A Low-Resource Quantum Factoring Algorithm
Bernstein, D. J., Biasse, J., & Mosca, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_19 · Cited by 25
HMFEv - An Efficient Multivariate Signature Scheme
Petzoldt, A., Chen, M.-S., Ding, J., & Yang, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_12 · Cited by 21
Improved Attacks for Characteristic-2 Parameters of the Cubic ABC Simple Matrix Encryption Scheme
Moody, D., Perlner, R. A., & Smith-Tone, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_15 · Cited by 19
An Updated Security Analysis of PFLASH
Cartor, R., & Smith-Tone, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_14 · Cited by 13
Gagliardoni, T., Karvelas, N. P., & Katzenbeisser, S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_23 · Cited by 7
Szepieniec, A., Beullens, W., & Bart Preneel, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_13 · Cited by 7
CCA2 Key-Privacy for Code-Based Encryption in the Standard Model
Yoshida, Y., Morozov, K., & Tanaka, K. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_3 · Cited by 7
Fast Lattice-Based Encryption: Stretching Spring
Bouillaguet, C., Delaplace, C., Fouque, P.-A., & Kirchner, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_8 · Cited by 6
Cryptanalysis of RLWE-Based One-Pass Authenticated Key Exchange
Gong, B., & Zhao, Y. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_10 · Cited by 5
Cited by
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_9 · Cited by 212
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., & Tillich, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45727-3_3 · Cited by 87
IoT Security Challenges: Cloud and Blockchain, Postquantum Cryptography, and Evolutionary Techniques
Balogh, Š., Gallo, O., Ploszek, R., Špaček, P., & Zajac, P. (2021) · Electronics · doi:10.3390/electronics10212647 · Cited by 86
Large-Scale Simulation of Shor’s Quantum Factoring Algorithm
Willsch, D., Willsch, M., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · Mathematics · doi:10.3390/math11194222 · Cited by 50
Metadata
- Authors
- Takagi, T., & Lange, T.
- Affiliations
- Eindhoven University of Technology (NL)
- Kyushu University (JP)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2017
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4301737027
- Cited by
- 20
- References
- 21
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 2 · 2023: 2 · 2022: 3 · 2021: 2 · 2020: 2 · 2019: 1 · 2018: 2 · 2017: 1
- FWCI
- 0.75
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Lecture notes in computer science (publishedVersion)
- DIAL (Catholic University of Leuven) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- post-quantum cryptography, code-based cryptography, isogeny-based cryptography, lattice-based cryptography, multivariate public-key cryptography, quantum algorithms, security model
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.