The state of the art in integer factoring and breaking public-key cryptography

Record

Authors
Boudot, F.; Gaudry, P.; Guillevic, A.; Heninger, N.; Thomé, E.; Zimmermann, P.
Year
2022
Title
The state of the art in integer factoring and breaking public-key cryptography
Published in
IEEE Security & Privacy
Volume
20 (2)
Pages
80–86
Type
Journal article
Our note
none yet
Verification
matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W4221133636 · DOI 10.1109/msec.2022.3141918
Id
boudot-2022-state-art-integer-factoring-breaking-public

Cited on

As cited

The pages cite this work in one form.

  • Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thomé, E., and Zimmermann, P. (2022). The state of the art in integer factoring and breaking public-key cryptography. IEEE Security & Privacy, 20(2), 80–86. Factoring and breaking RSA are not known to be equivalent; RSA-250 (829 bits) was factored in February 2020 for about 2,700 core-years; a 1024-bit modulus would take about 200 times as much; whether quantum computers able to run Shor's algorithm can be built is open.

BibLaTeX

@article{boudot-2022-state-art-integer-factoring-breaking-public,
  author = {Boudot, F. and Gaudry, P. and Guillevic, A. and Heninger, N. and Thomé, E. and Zimmermann, P.},
  title = {{The state of the art in integer factoring and breaking public-key cryptography}},
  journaltitle = {IEEE Security \& Privacy},
  date = {2022},
  volume = {20},
  number = {2},
  pages = {80--86}
}

Download · JSON with CSL-JSON · the whole bibliography