RSA cryptosystem (English Wikipedia)

Miller, Gary L. (1975). "Riemann's Hypothesis and Tests for Primality" (PDF). Proceedings of Seventh Annual ACM Symposium on Theory of Computing. pp. 234–239.

darkreading.com (Global: low place; English: low place)

"'BERserk' Bug Uncovered In Mozilla NSS Crypto Library Impacts Firefox, Chrome". Dark Reading. 25 September 2014. Retrieved 4 January 2022.

di-mgt.com.au (Global: low place; English: low place)

"RSA Algorithm".

doi.org (Global: 2^nd place; English: 2^nd place)

Gardner, Martin (August 1977). "Mathematical Games: A new kind of cipher that would take millions of years to break" (PDF). Scientific American. Vol. 237, no. 2. doi:10.1038/scientificamerican0877-120. Archived from the original (PDF) on 2025-07-11.
Rivest, R.; Shamir, A.; Adleman, L. (February 1978). "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" (PDF). Communications of the ACM. 21 (2): 120–126. doi:10.1145/359340.359342. Archived from the original (PDF) on 2023-01-27. Retrieved 2025-07-30.
Bellare, Mihir; Rogaway, Phillip. Maurer, Ueli (ed.). The exact security of digital signatures: How to sign with RSA and Rabin. Advances in Cryptology—EUROCRYPT '96. Lecture Notes in Computer Science. Springer. pp. 399–416. doi:10.1007/3-540-68339-9_34. ISBN 978-3-540-61186-8.
B. Kaliski; A. Rusch; J. Johnsson; A. Rusch (November 2016). K. Moriarty (ed.). PKCS #1: RSA Cryptography Specifications Version 2.2. Internet Engineering Task Force. doi:10.17487/RFC8017. ISSN 2070-1721. RFC 8017. Informational. Obsoletes RFC 3447.
Bellare, Mihir; Rogaway, Phillip. Santis, Alfredo (ed.). Optimal asymmetric encryption. Advances in Cryptology—EUROCRYPT '94. Lecture Notes in Computer Science. Springer. pp. 92–111. doi:10.1007/BFb0053428. ISBN 978-3-540-60176-0.
R. Housley; S. Turner (February 2025). Use of the RSA-KEM Algorithm in the Cryptographic Message Syntax (CMS). Internet Engineering Task Force. doi:10.17487/RFC9690. RFC 9690. Proposed Standard. Obsoletes RFC 5990.
Castelvecchi, Davide (2020-10-30). "Quantum-computing pioneer warns of complacency over Internet security". Nature. 587 (7833): 189. Bibcode:2020Natur.587..189C. doi:10.1038/d41586-020-03068-9. PMID 33139910. S2CID 226243008. 2020 interview of Peter Shor.
Diffie, W.; Hellman, M. E. (November 1976). "New directions in cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. Bibcode:1976ITIT...22..644D. doi:10.1109/TIT.1976.1055638. ISSN 0018-9448. Archived from the original (PDF) on 2014-11-29. Retrieved 2025-07-30.
Johnson, J.; Kaliski, B. (February 2003). Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. Network Working Group. doi:10.17487/RFC3447. RFC 3447. Retrieved 9 March 2016.
Bleichenbacher, Daniel (1998). Krawczyk, Hugo (ed.). Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1. Advances in Cryptology—CRYPTO '98. Lecture Notes in Computer Science. Springer. pp. 1–12. doi:10.1007/BFb0055716. ISBN 978-3-540-68462-6.
Bellare, Mihir; Rogaway, Phillip (May 1996). Maurer, Ueli (ed.). The Exact Security of Digital Signatures—How to Sign with RSA and Rabin. Advances in Cryptology – EUROCRYPT '96. Lecture Notes in Computer Science. Vol. 1070. Saragossa, Spain: Springer. pp. 399–416. doi:10.1007/3-540-68339-9_34. ISBN 978-3-540-61186-8.
Håstad, Johan (1986). "On using RSA with Low Exponent in a Public Key Network". Advances in Cryptology – CRYPTO '85 Proceedings. Lecture Notes in Computer Science. Vol. 218. pp. 403–408. doi:10.1007/3-540-39799-X_29. ISBN 978-3-540-16463-0.
Coppersmith, Don (1997). "Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities" (PDF). Journal of Cryptology. 10 (4): 233–260. doi:10.1007/s001459900030. S2CID 15726802.
Goldwasser, Shafi; Micali, Silvio (1982-05-05). "Probabilistic encryption & how to play mental poker keeping secret all partial information". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: Association for Computing Machinery. pp. 365–377. doi:10.1145/800070.802212. ISBN 978-0-89791-070-5. S2CID 10316867.
Coron, Jean-Sébastien; Joye, Marc; Naccache, David; Paillier, Pascal (2000). "New Attacks on PKCS#1 v1.5 Encryption". In Preneel, Bart (ed.). Advances in Cryptology — EUROCRYPT 2000. Lecture Notes in Computer Science. Vol. 1807. Berlin, Heidelberg: Springer. pp. 369–381. doi:10.1007/3-540-45539-6_25. ISBN 978-3-540-45539-4.
Barker, Elaine; Dang, Quynh (2015-01-22). "NIST Special Publication 800-57 Part 3 Revision 1: Recommendation for Key Management: Application-Specific Key Management Guidance" (PDF). National Institute of Standards and Technology. p. 12. doi:10.6028/NIST.SP.800-57pt3r1. Retrieved 2017-11-24.
Wiener, Michael J. (May 1990). "Cryptanalysis of short RSA secret exponents" (PDF). IEEE Transactions on Information Theory. 36 (3): 553–558. Bibcode:1990ITIT...36..553W. doi:10.1109/18.54902. S2CID 7120331.
Nemec, Matus; Sys, Marek; Svenda, Petr; Klinec, Dusan; Matyas, Vashek (November 2017). "The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli" (PDF). Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS '17. doi:10.1145/3133956.3133969.
Acıiçmez, Onur; Koç, Çetin Kaya; Seifert, Jean-Pierre (2007). "On the power of simple branch prediction analysis". Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security. ASIACCS '07. pp. 312–320. doi:10.1145/1229285.1266999.
Pellegrini, Andrea; Bertacco, Valeria; Austin, Todd (March 2010). "Fault-based attack of RSA authentication". 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010). pp. 855–860. doi:10.1109/DATE.2010.5456933. ISBN 978-3-9810801-6-2.
Boneh, Dan; DeMillo, Richard A.; Lipton, Richard J. (Nov 2000). "On the Importance of Eliminating Errors in Cryptographic Computations". Journal of Cryptology. 14 (2): 106–107. doi:10.1007/s001450010016. ISSN 0933-2790.

emc.com (Global: low place; English: low place)

Kaliski, Burt (2003-05-06). "TWIRL and RSA Key Size". RSA Laboratories. Archived from the original on 2017-04-17. Retrieved 2017-11-24.

ens.fr (Global: 6,982^nd place; English: low place)

di.ens.fr

Coppersmith, Don (1997). "Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities" (PDF). Journal of Cryptology. 10 (4): 233–260. doi:10.1007/s001459900030. S2CID 15726802.

fox-it.com (Global: low place; English: low place)

blog.fox-it.com

Sandee, Michael (November 21, 2011). "RSA-512 certificates abused in-the-wild". Fox-IT International blog.

freedom-to-tinker.com (Global: low place; English: low place)

Heninger, Nadia (February 15, 2012). "New research: There's no need to panic over factorable keys–just mind your Ps and Qs". Freedom to Tinker.

gchq.gov.uk (Global: low place; English: low place)

Cocks, C. C. (20 November 1973). "A Note on Non-Secret Encryption" (PDF). www.gchq.gov.uk. Archived from the original (PDF) on 28 September 2018. Retrieved 2017-05-30.

github.com (Global: 380^th place; English: 337^th place)

"OpenSSL bn_s390x.c". Github. Retrieved 2 August 2024.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Rivest, R.L.; Shamir, A.; Adleman, L. (1977). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (PDF) (Technical report). MIT Laboratory for Computer Science. hdl:1721.1/148910. MIT-LCS-TM-082.

iacr.org (Global: 6,361^st place; English: 4,159^th place)

eprint.iacr.org

Shoup, Victor (2001), A Proposal for an ISO Standard for Public Key Encryption (version 2.1), Cryptology ePrint Archive, International Association for Cryptologic Research
Lenstra, Arjen K.; Hughes, James P.; Augier, Maxime; Bos, Joppe W.; Kleinjung, Thorsten; Wachter, Christophe (2012). "Ron was wrong, Whit is right" (PDF).

iacr.org

Lenstra, Arjen; et al. (Group) (2000). "Factorization of a 512-bit RSA Modulus" (PDF). Eurocrypt.

ietf.org (Global: 731^st place; English: 625^th place)

datatracker.ietf.org

B. Kaliski; A. Rusch; J. Johnsson; A. Rusch (November 2016). K. Moriarty (ed.). PKCS #1: RSA Cryptography Specifications Version 2.2. Internet Engineering Task Force. doi:10.17487/RFC8017. ISSN 2070-1721. RFC 8017. Informational. Obsoletes RFC 3447.
R. Housley; S. Turner (February 2025). Use of the RSA-KEM Algorithm in the Cryptographic Message Syntax (CMS). Internet Engineering Task Force. doi:10.17487/RFC9690. RFC 9690. Proposed Standard. Obsoletes RFC 5990.
Johnson, J.; Kaliski, B. (February 2003). Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. Network Working Group. doi:10.17487/RFC3447. RFC 3447. Retrieved 9 March 2016.

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

lists.gforge.inria.fr

Zimmermann, Paul (2020-02-28). "Factorization of RSA-250". Cado-nfs-discuss. Archived from the original on 2020-02-28. Retrieved 2020-07-12.

leanpub.com (Global: low place; English: low place)

Isom, Kyle. "Practical Cryptography With Go". Retrieved 4 January 2022.

mit.edu (Global: 476^th place; English: 340^th place)

publications.csail.mit.edu

Rivest, R.L.; Shamir, A.; Adleman, L. (1977). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (PDF) (Technical report). MIT Laboratory for Computer Science. hdl:1721.1/148910. MIT-LCS-TM-082.
Rabin, Michael O. (January 1979). Digitalized Signatures and Public Key Functions as Intractable as Factorization (PDF) (Technical report). Cambridge, MA, United States: MIT Laboratory for Computer Science. TR-212.

people.csail.mit.edu

Rivest, R.; Shamir, A.; Adleman, L. (February 1978). "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" (PDF). Communications of the ACM. 21 (2): 120–126. doi:10.1145/359340.359342. Archived from the original (PDF) on 2023-01-27. Retrieved 2025-07-30.
Rivest, Ronald. "The Early Days of RSA – History and Lessons" (PDF).

mozilla.org (Global: 2,188^th place; English: 2,076^th place)

"RSA Signature Forgery in NSS". Mozilla.

msri.org (Global: low place; English: low place)

Robinson, Sara (June 2003). "Still Guarding Secrets after Years of Attacks, RSA Earns Accolades for its Founders" (PDF). SIAM News. 36 (5). Archived from the original (PDF) on 2022-12-15.

muni.cz (Global: 2,278^th place; English: 5,329^th place)

crocs.fi.muni.cz

Nemec, Matus; Sys, Marek; Svenda, Petr; Klinec, Dusan; Matyas, Vashek (November 2017). "The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli" (PDF). Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS '17. doi:10.1145/3133956.3133969.

nature.com (Global: 207^th place; English: 347^th place)

Castelvecchi, Davide (2020-10-30). "Quantum-computing pioneer warns of complacency over Internet security". Nature. 587 (7833): 189. Bibcode:2020Natur.587..189C. doi:10.1038/d41586-020-03068-9. PMID 33139910. S2CID 226243008. 2020 interview of Peter Shor.

nih.gov (Global: 5^th place; English: 5^th place)

pubmed.ncbi.nlm.nih.gov

Castelvecchi, Davide (2020-10-30). "Quantum-computing pioneer warns of complacency over Internet security". Nature. 587 (7833): 189. Bibcode:2020Natur.587..189C. doi:10.1038/d41586-020-03068-9. PMID 33139910. S2CID 226243008. 2020 interview of Peter Shor.

nist.gov (Global: 708^th place; English: 742^nd place)

nvlpubs.nist.gov

Barker, Elaine; Dang, Quynh (2015-01-22). "NIST Special Publication 800-57 Part 3 Revision 1: Recommendation for Key Management: Application-Specific Key Management Guidance" (PDF). National Institute of Standards and Technology. p. 12. doi:10.6028/NIST.SP.800-57pt3r1. Retrieved 2017-11-24.

nytimes.com (Global: 7^th place; English: 7^th place)

Markoff, John (February 14, 2012). "Flaw Found in an Online Encryption Method". The New York Times.

rfc-editor.org (Global: 747^th place; English: 325^th place)

B. Kaliski; A. Rusch; J. Johnsson; A. Rusch (November 2016). K. Moriarty (ed.). PKCS #1: RSA Cryptography Specifications Version 2.2. Internet Engineering Task Force. doi:10.17487/RFC8017. ISSN 2070-1721. RFC 8017. Informational. Obsoletes RFC 3447.
R. Housley; S. Turner (February 2025). Use of the RSA-KEM Algorithm in the Cryptographic Message Syntax (CMS). Internet Engineering Task Force. doi:10.17487/RFC9690. RFC 9690. Proposed Standard. Obsoletes RFC 5990.
Johnson, J.; Kaliski, B. (February 2003). Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. Network Working Group. doi:10.17487/RFC3447. RFC 3447. Retrieved 9 March 2016.

rsa.com (Global: low place; English: low place)

"RSA Security Releases RSA Encryption Algorithm into Public Domain". Archived from the original on June 21, 2007. Retrieved 2010-03-03.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Castelvecchi, Davide (2020-10-30). "Quantum-computing pioneer warns of complacency over Internet security". Nature. 587 (7833): 189. Bibcode:2020Natur.587..189C. doi:10.1038/d41586-020-03068-9. PMID 33139910. S2CID 226243008. 2020 interview of Peter Shor.
Coppersmith, Don (1997). "Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities" (PDF). Journal of Cryptology. 10 (4): 233–260. doi:10.1007/s001459900030. S2CID 15726802.
Goldwasser, Shafi; Micali, Silvio (1982-05-05). "Probabilistic encryption & how to play mental poker keeping secret all partial information". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: Association for Computing Machinery. pp. 365–377. doi:10.1145/800070.802212. ISBN 978-0-89791-070-5. S2CID 10316867.
Wiener, Michael J. (May 1990). "Cryptanalysis of short RSA secret exponents" (PDF). IEEE Transactions on Information Theory. 36 (3): 553–558. Bibcode:1990ITIT...36..553W. doi:10.1109/18.54902. S2CID 7120331.

simson.net (Global: low place; English: low place)

Gardner, Martin (August 1977). "Mathematical Games: A new kind of cipher that would take millions of years to break" (PDF). Scientific American. Vol. 237, no. 2. doi:10.1038/scientificamerican0877-120. Archived from the original (PDF) on 2025-07-11.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Bellare, Mihir; Rogaway, Phillip. Maurer, Ueli (ed.). The exact security of digital signatures: How to sign with RSA and Rabin. Advances in Cryptology—EUROCRYPT '96. Lecture Notes in Computer Science. Springer. pp. 399–416. doi:10.1007/3-540-68339-9_34. ISBN 978-3-540-61186-8.
Bellare, Mihir; Rogaway, Phillip. Santis, Alfredo (ed.). Optimal asymmetric encryption. Advances in Cryptology—EUROCRYPT '94. Lecture Notes in Computer Science. Springer. pp. 92–111. doi:10.1007/BFb0053428. ISBN 978-3-540-60176-0.
Bleichenbacher, Daniel (1998). Krawczyk, Hugo (ed.). Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1. Advances in Cryptology—CRYPTO '98. Lecture Notes in Computer Science. Springer. pp. 1–12. doi:10.1007/BFb0055716. ISBN 978-3-540-68462-6.
Bellare, Mihir; Rogaway, Phillip (May 1996). Maurer, Ueli (ed.). The Exact Security of Digital Signatures—How to Sign with RSA and Rabin. Advances in Cryptology – EUROCRYPT '96. Lecture Notes in Computer Science. Vol. 1070. Saragossa, Spain: Springer. pp. 399–416. doi:10.1007/3-540-68339-9_34. ISBN 978-3-540-61186-8.

stanford.edu (Global: 194^th place; English: 182^nd place)

crypto.stanford.edu

Boneh, Dan (1999). "Twenty Years of attacks on the RSA Cryptosystem". Notices of the American Mathematical Society. 46 (2): 203–213.
Brumley, David; Boneh, Dan (2003). "Remote timing attacks are practical" (PDF). Proceedings of the 12th Conference on USENIX Security Symposium. SSYM'03.

ee.stanford.edu

Diffie, W.; Hellman, M. E. (November 1976). "New directions in cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. Bibcode:1976ITIT...22..644D. doi:10.1109/TIT.1976.1055638. ISSN 0018-9448. Archived from the original (PDF) on 2014-11-29. Retrieved 2025-07-30.

ucdavis.edu (Global: 2,336^th place; English: 1,492^nd place)

cs.ucdavis.edu

Bellare, Mihir; Rogaway, Phillip. Maurer, Ueli (ed.). The exact security of digital signatures: How to sign with RSA and Rabin. Advances in Cryptology—EUROCRYPT '96. Lecture Notes in Computer Science. Springer. pp. 399–416. doi:10.1007/3-540-68339-9_34. ISBN 978-3-540-61186-8.

uchicago.edu (Global: 226^th place; English: 199^th place)

math.uchicago.edu

Calderbank, Michael (2007-08-20). "The RSA Cryptosystem: History, Algorithm, Primes" (PDF).

usenix.org (Global: 7,359^th place; English: 4,657^th place)

Švenda, Petr; Nemec, Matúš; Sekan, Peter; Kvašňovský, Rudolf; Formánek, David; Komárek, David; Matyáš, Vashek (August 2016). The Million-Key Question—Investigating the Origins of RSA Public Keys. 25th USENIX Security Symposium. Austin, TX, United States: USENIX Association. pp. 893–910. ISBN 978-1-931971-32-4.

washington.edu (Global: 1,171^st place; English: 736^th place)

sites.math.washington.edu

Neal Koblitz. "Cryptography As a Teaching Tool". Cryptologia, Vol. 21, No. 4 (1997).

web.archive.org (Global: 1^st place; English: 1^st place)

Gardner, Martin (August 1977). "Mathematical Games: A new kind of cipher that would take millions of years to break" (PDF). Scientific American. Vol. 237, no. 2. doi:10.1038/scientificamerican0877-120. Archived from the original (PDF) on 2025-07-11.
Rivest, R.; Shamir, A.; Adleman, L. (February 1978). "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" (PDF). Communications of the ACM. 21 (2): 120–126. doi:10.1145/359340.359342. Archived from the original (PDF) on 2023-01-27. Retrieved 2025-07-30.
Diffie, W.; Hellman, M. E. (November 1976). "New directions in cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. Bibcode:1976ITIT...22..644D. doi:10.1109/TIT.1976.1055638. ISSN 0018-9448. Archived from the original (PDF) on 2014-11-29. Retrieved 2025-07-30.
Robinson, Sara (June 2003). "Still Guarding Secrets after Years of Attacks, RSA Earns Accolades for its Founders" (PDF). SIAM News. 36 (5). Archived from the original (PDF) on 2022-12-15.
Cocks, C. C. (20 November 1973). "A Note on Non-Secret Encryption" (PDF). www.gchq.gov.uk. Archived from the original (PDF) on 28 September 2018. Retrieved 2017-05-30.
Surender R. Chiluka. "Public key Cryptography".
"RSA Security Releases RSA Encryption Algorithm into Public Domain". Archived from the original on June 21, 2007. Retrieved 2010-03-03.
Zimmermann, Paul (2020-02-28). "Factorization of RSA-250". Cado-nfs-discuss. Archived from the original on 2020-02-28. Retrieved 2020-07-12.
Kaliski, Burt (2003-05-06). "TWIRL and RSA Key Size". RSA Laboratories. Archived from the original on 2017-04-17. Retrieved 2017-11-24.

wikibooks.org (Global: 7,048^th place; English: low place)

en.wikibooks.org

The parameters used here are artificially small, but one can also OpenSSL can also be used to generate and examine a real keypair.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

B. Kaliski; A. Rusch; J. Johnsson; A. Rusch (November 2016). K. Moriarty (ed.). PKCS #1: RSA Cryptography Specifications Version 2.2. Internet Engineering Task Force. doi:10.17487/RFC8017. ISSN 2070-1721. RFC 8017. Informational. Obsoletes RFC 3447.
Diffie, W.; Hellman, M. E. (November 1976). "New directions in cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. Bibcode:1976ITIT...22..644D. doi:10.1109/TIT.1976.1055638. ISSN 0018-9448. Archived from the original (PDF) on 2014-11-29. Retrieved 2025-07-30.
Boneh, Dan; DeMillo, Richard A.; Lipton, Richard J. (Nov 2000). "On the Importance of Eliminating Errors in Cryptographic Computations". Journal of Cryptology. 14 (2): 106–107. doi:10.1007/s001450010016. ISSN 0933-2790.

yp.to (Global: low place; English: low place)

cr.yp.to

Bernstein, Daniel J. (January 31, 2008). RSA signatures and Rabin–Williams signatures: the state of the art (Report). (additional information at https://cr.yp.to/sigs.html)

RSA cryptosystem (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

amstat.org (Global: low place; English: 7,313th place)

ww2.amstat.org

books.google.com (Global: 3rd place; English: 3rd place)

bristol.ac.uk (Global: 7,934th place; English: 4,709th place)

cits.rub.de (Global: low place; English: low place)

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

darkreading.com (Global: low place; English: low place)

di-mgt.com.au (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

emc.com (Global: low place; English: low place)

ens.fr (Global: 6,982nd place; English: low place)

di.ens.fr

fox-it.com (Global: low place; English: low place)

blog.fox-it.com

freedom-to-tinker.com (Global: low place; English: low place)

gchq.gov.uk (Global: low place; English: low place)

github.com (Global: 380th place; English: 337th place)

hdl.handle.net (Global: 66th place; English: 34th place)

iacr.org (Global: 6,361st place; English: 4,159th place)

eprint.iacr.org

iacr.org

ietf.org (Global: 731st place; English: 625th place)

datatracker.ietf.org

inria.fr (Global: 6,372nd place; English: 5,582nd place)

lists.gforge.inria.fr

leanpub.com (Global: low place; English: low place)

mit.edu (Global: 476th place; English: 340th place)

publications.csail.mit.edu

people.csail.mit.edu

mozilla.org (Global: 2,188th place; English: 2,076th place)

msri.org (Global: low place; English: low place)

muni.cz (Global: 2,278th place; English: 5,329th place)

crocs.fi.muni.cz

nature.com (Global: 207th place; English: 347th place)

nih.gov (Global: 5th place; English: 5th place)

pubmed.ncbi.nlm.nih.gov

nist.gov (Global: 708th place; English: 742nd place)

nvlpubs.nist.gov

nytimes.com (Global: 7th place; English: 7th place)

rfc-editor.org (Global: 747th place; English: 325th place)

rsa.com (Global: low place; English: low place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

simson.net (Global: low place; English: low place)

springer.com (Global: 182nd place; English: 172nd place)

link.springer.com

stanford.edu (Global: 194th place; English: 182nd place)

crypto.stanford.edu

ee.stanford.edu

ucdavis.edu (Global: 2,336th place; English: 1,492nd place)

cs.ucdavis.edu

uchicago.edu (Global: 226th place; English: 199th place)

math.uchicago.edu

usenix.org (Global: 7,359th place; English: 4,657th place)

washington.edu (Global: 1,171st place; English: 736th place)

sites.math.washington.edu

web.archive.org (Global: 1st place; English: 1st place)

wikibooks.org (Global: 7,048th place; English: low place)

en.wikibooks.org

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

yp.to (Global: low place; English: low place)

cr.yp.to

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

amstat.org (Global: low place; English: 7,313^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

bristol.ac.uk (Global: 7,934^th place; English: 4,709^th place)

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

ens.fr (Global: 6,982^nd place; English: low place)

github.com (Global: 380^th place; English: 337^th place)

hdl.handle.net (Global: 66^th place; English: 34^th place)

iacr.org (Global: 6,361^st place; English: 4,159^th place)

ietf.org (Global: 731^st place; English: 625^th place)

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

mit.edu (Global: 476^th place; English: 340^th place)

mozilla.org (Global: 2,188^th place; English: 2,076^th place)

muni.cz (Global: 2,278^th place; English: 5,329^th place)

nature.com (Global: 207^th place; English: 347^th place)

nih.gov (Global: 5^th place; English: 5^th place)

nist.gov (Global: 708^th place; English: 742^nd place)

nytimes.com (Global: 7^th place; English: 7^th place)

rfc-editor.org (Global: 747^th place; English: 325^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

springer.com (Global: 182^nd place; English: 172^nd place)

stanford.edu (Global: 194^th place; English: 182^nd place)

ucdavis.edu (Global: 2,336^th place; English: 1,492^nd place)

uchicago.edu (Global: 226^th place; English: 199^th place)

usenix.org (Global: 7,359^th place; English: 4,657^th place)

washington.edu (Global: 1,171^st place; English: 736^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

wikibooks.org (Global: 7,048^th place; English: low place)

worldcat.org (Global: 4^th place; English: 4^th place)