One-time pad (English Wikipedia)

Jenkin, Tim (May–October 1995). "Talking to Vula: The Story of the Secret Underground Communications Network of Operation Vula". Mayibuye. Archived from the original on 2014-08-26. Retrieved 24 August 2014. Our system was based on the one-time pad, though instead of having paper pads the random numbers were on a disk.

archive.org (Global: 6^th place; English: 6^th place)

Marks, Leo (1998). Between Silk and Cyanide: a Codemaker's Story, 1941–1945. HarperCollins. ISBN 978-0-684-86780-9.
Robert Wallace and H. Keith Melton, with Henry R. Schlesinger (2008). Spycraft: The Secret History of the CIA's Spytechs, from Communism to al-Qaeda. New York: Dutton. p. 436. ISBN 978-0-525-94980-0.
Singh, Simon (2000). The Code Book. United States: Anchor Books. pp. 123. ISBN 978-0-385-49532-5.

arxiv.org (Global: 49^th place; English: 31^st place)

Ryabko, Boris (2013), The Vernam cipher is robust to small deviations from randomness, arXiv, doi:10.48550/ARXIV.1303.2219, retrieved 2026-10-06
Mosca, Michele; Tapp, Alain; de Wolf, Ronald (2000-03-27). "Private Quantum Channels and the Cost of Randomizing Quantum Information". arXiv:quant-ph/0003101.
Bennett, Charles; Brassard, Giles (1984). "Quantum cryptography: Public key distribution and coin tossing". Theoretical Computer Science. 560: 7–11. arXiv:2003.06557. doi:10.1016/j.tcs.2014.05.025. S2CID 27022972. Note: This paper was published originally in 1984, but was retracted, and the version on ArXiv is a reprint from 2014 of the 1984 paper.

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

Lars R. Knudsen & Matthew Robshaw (2011). The Block Cipher Companion. Springer Science & Business Media. pp. 1–14. ISBN 978-3-642-17342-4. Retrieved 26 July 2017.
Safavi-Naini, Reihaneh (2008). Information Theoretic Security: Third International Conference, ICITS 2008, Calgary, Canada, August 10–13, 2008, Proceedings. Springer Science & Business Media. ISBN 978-3-540-85092-2 – via Google Books.

columbia.edu (Global: 554^th place; English: 368^th place)

academiccommons.columbia.edu

Bellovin, Steven M. (2011). "Frank Miller: Inventor of the One-Time Pad". Cryptologia. 35 (3): 203–222. doi:10.1080/01611194.2011.583711. ISSN 0161-1194. S2CID 35541360.

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

Boneh, Dan. "Attacks on Stream Ciphers and The One Time Pad - Course overview and stream ciphers". Coursera. Retrieved 2022-03-21.

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

"One-Time Pad (OTP)". Cryptomuseum.com. Archived from the original on 2014-03-14. Retrieved 2014-03-17.

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

Ryabko, Boris (2013), The Vernam cipher is robust to small deviations from randomness, arXiv, doi:10.48550/ARXIV.1303.2219, retrieved 2026-10-06
Lugrin, Thomas (2023), "One-Time Pad", in Mulder, Valentin; Mermoud, Alain; Lenders, Vincent; Tellenbach, Bernhard (eds.), Trends in Data Protection and Encryption Technologies, Cham: Springer Nature Switzerland, pp. 3–6, doi:10.1007/978-3-031-33386-6_1, ISBN 978-3-031-33386-6
Shannon, Claude (1949). "Communication Theory of Secrecy Systems" (PDF). Bell System Technical Journal. 28 (4): 656–715. doi:10.1002/j.1538-7305.1949.tb00928.x.
Bellovin, Steven M. (2011). "Frank Miller: Inventor of the One-Time Pad". Cryptologia. 35 (3): 203–222. doi:10.1080/01611194.2011.583711. ISSN 0161-1194. S2CID 35541360.
Peng, Weiping; Cui, Shuang; Song, Cheng (2021-01-20). Raja, Gulistan (ed.). "One-time-pad cipher algorithm based on confusion mapping and DNA storage technology". PLOS ONE. 16 (1) e0245506. Bibcode:2021PLoSO..1645506P. doi:10.1371/journal.pone.0245506. ISSN 1932-6203. PMC 7817086. PMID 33471849.
Sergei N Molotkov (Institute of Solid-State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, Russian Federation) (22 February 2006). "Quantum cryptography and V A Kotel'nikov's one-time key and sampling theorems". Physics-Uspekhi. 49 (7): 750–761. Bibcode:2006PhyU...49..750M. doi:10.1070/PU2006v049n07ABEH006050. S2CID 118764598. Archived from the original on 2008-12-10. Retrieved 2009-05-03.{{cite journal}}: CS1 maint: multiple names: authors list (link) PACS numbers: 01.10.Fv, 03.67.Dd, 89.70.+c and openly in Russian Квантовая криптография и теоремы В.А. Котельникова об одноразовых ключах и об отсчетах. УФН
Shannon, Claude E. (October 1949). "Communication Theory of Secrecy Systems" (PDF). Bell System Technical Journal. 28 (4): 656–715. doi:10.1002/j.1538-7305.1949.tb00928.x. hdl:10338.dmlcz/119717. Archived from the original (PDF) on 2012-01-20. Retrieved 2011-12-21.
Bennett, Charles; Brassard, Giles (1984). "Quantum cryptography: Public key distribution and coin tossing". Theoretical Computer Science. 560: 7–11. arXiv:2003.06557. doi:10.1016/j.tcs.2014.05.025. S2CID 27022972. Note: This paper was published originally in 1984, but was retracted, and the version on ArXiv is a reprint from 2014 of the 1984 paper.
Dušek, Miloslav; Haderka, Ondřej; Hendrych, Martin (1999-10-01). "Generalized beam-splitting attack in quantum cryptography with dim coherent states". Optics Communications. 169 (1): 103–108. Bibcode:1999OptCo.169..103D. doi:10.1016/S0030-4018(99)00419-8. ISSN 0030-4018.
Bennett, Charles; Brassard, Giles; Breidbart, Seth (2014). "Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP". Natural Computing. 13 (4): 453–458. doi:10.1007/s11047-014-9453-6. PMC 4224740. PMID 25400534. S2CID 3121156. Note: This is also a reprint of the original 1982 paper.
Hieu, Phan Duong (April 2007). "Cryptology during the French and American Wars in Vietnam" (PDF). Cryptologia. 41 (6): 1–21. doi:10.1080/01611194.2017.1292825. S2CID 3780267. Retrieved 14 April 2020.

en.wikisource.org (Global: 82^nd place; English: 41^st place)

Frank Miller (1882). Telegraphic Code to Insure Privacy and Secrecy in the Transmission of Telegrams – via Wikisource.

governmentattic.org (Global: low place; English: 6,646^th place)

Boak, David G. (July 1973) [1966]. A History of U.S. Communications Security; the David G. Boak Lectures, Vol. I (PDF) (2015 declassification review ed.). Ft. George G. Meade, MD: U.S. National Security Agency. Archived from the original (PDF) on 2017-05-25. Retrieved 2017-04-23.

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

Shannon, Claude E. (October 1949). "Communication Theory of Secrecy Systems" (PDF). Bell System Technical Journal. 28 (4): 656–715. doi:10.1002/j.1538-7305.1949.tb00928.x. hdl:10338.dmlcz/119717. Archived from the original (PDF) on 2012-01-20. Retrieved 2011-12-21.

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

eprint.iacr.org

Hieu, Phan Duong (April 2007). "Cryptology during the French and American Wars in Vietnam" (PDF). Cryptologia. 41 (6): 1–21. doi:10.1080/01611194.2017.1292825. S2CID 3780267. Retrieved 14 April 2020.

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

ncbi.nlm.nih.gov

Peng, Weiping; Cui, Shuang; Song, Cheng (2021-01-20). Raja, Gulistan (ed.). "One-time-pad cipher algorithm based on confusion mapping and DNA storage technology". PLOS ONE. 16 (1) e0245506. Bibcode:2021PLoSO..1645506P. doi:10.1371/journal.pone.0245506. ISSN 1932-6203. PMC 7817086. PMID 33471849.
Bennett, Charles; Brassard, Giles; Breidbart, Seth (2014). "Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP". Natural Computing. 13 (4): 453–458. doi:10.1007/s11047-014-9453-6. PMC 4224740. PMID 25400534. S2CID 3121156. Note: This is also a reprint of the original 1982 paper.

pubmed.ncbi.nlm.nih.gov

Peng, Weiping; Cui, Shuang; Song, Cheng (2021-01-20). Raja, Gulistan (ed.). "One-time-pad cipher algorithm based on confusion mapping and DNA storage technology". PLOS ONE. 16 (1) e0245506. Bibcode:2021PLoSO..1645506P. doi:10.1371/journal.pone.0245506. ISSN 1932-6203. PMC 7817086. PMID 33471849.
Bennett, Charles; Brassard, Giles; Breidbart, Seth (2014). "Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP". Natural Computing. 13 (4): 453–458. doi:10.1007/s11047-014-9453-6. PMC 4224740. PMID 25400534. S2CID 3121156. Note: This is also a reprint of the original 1982 paper.

nsa.gov (Global: 7,332^nd place; English: 4,773^rd place)

"The Translations and KGB Cryptographic Systems" (PDF). The Venona Story. Fort Meade, Maryland: National Security Agency. 2004-01-15. pp. 26–27 (28–29th of 63 in PDF). Archived from the original (PDF) on 2009-05-10. Retrieved 2009-05-03. KGB's cryptographic material manufacturing center in the Soviet Union apparently reused some of the pages from one-time pads. This provided Arlington Hall with an opening.
"The Venona Translations" (PDF). The Venona Story. Fort Meade, Maryland: National Security Agency. 2004-01-15. p. 17th (of 63 in PDF) but marked 15. Archived from the original (PDF) on 2009-05-10. Retrieved 2009-05-03. Arlington Hall's ability to read the VENONA messages was spotty, being a function of the underlying code, key changes, and the lack of volume. Of the message traffic from the KGB New York office to Moscow, 49 percent of the 1944 messages and 15 percent of the 1943 messages were readable, but this was true of only 1.8 percent of the 1942 messages. For the 1945 KGB Washington office to Moscow messages, only 1.5 percent were readable. About 50 percent of the 1943 GRU-Naval Washington to Moscow/Moscow to Washington messages were read but none from any other year.
"National Security Agency | Central Security Service > About Us > Cryptologic Heritage > Historical Figures and Publications > Publications > WWII > Sigsaly Story". 2019-02-24. Archived from the original on 2019-02-24. Retrieved 2022-03-27.
Klein, Melville (2003). "Securing Record Communications: The TSEC/KW-26" (PDF). NSA. Archived from the original (PDF) on 2006-02-13. Retrieved 2006-05-12.

numbers-stations.com (Global: low place; English: low place)

"Intro to Numbers Stations". Archived from the original on 18 October 2014. Retrieved 13 September 2014.
"Stasi Sprach Morse Machine". The Numbers Stations Research and Information Center. Archived from the original on March 13, 2015. Retrieved March 1, 2015.

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

John Markoff (July 25, 2011). "Codebook Shows an Encryption Form Dates Back to Telegraphs". The New York Times. Archived from the original on May 21, 2013. Retrieved 2011-07-26.

patents.google.com (Global: 1,154^th place; English: 606^th place)

"'Secret signaling system patent' on Google.Com". google.com. Archived from the original on 11 March 2016. Retrieved 3 February 2016.

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

"Operation Vula: a secret Dutch network against apartheid", Radio Netherlands Archives, September 9, 1999

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

Schneier, Bruce. "One-Time Pads". Archived from the original on 2005-04-03.

sciencedirect.com (Global: 137^th place; English: 146^th place)

Dušek, Miloslav; Haderka, Ondřej; Hendrych, Martin (1999-10-01). "Generalized beam-splitting attack in quantum cryptography with dim coherent states". Optics Communications. 169 (1): 103–108. Bibcode:1999OptCo.169..103D. doi:10.1016/S0030-4018(99)00419-8. ISSN 0030-4018.

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

api.semanticscholar.org

Bellovin, Steven M. (2011). "Frank Miller: Inventor of the One-Time Pad". Cryptologia. 35 (3): 203–222. doi:10.1080/01611194.2011.583711. ISSN 0161-1194. S2CID 35541360.
Sergei N Molotkov (Institute of Solid-State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, Russian Federation) (22 February 2006). "Quantum cryptography and V A Kotel'nikov's one-time key and sampling theorems". Physics-Uspekhi. 49 (7): 750–761. Bibcode:2006PhyU...49..750M. doi:10.1070/PU2006v049n07ABEH006050. S2CID 118764598. Archived from the original on 2008-12-10. Retrieved 2009-05-03.{{cite journal}}: CS1 maint: multiple names: authors list (link) PACS numbers: 01.10.Fv, 03.67.Dd, 89.70.+c and openly in Russian Квантовая криптография и теоремы В.А. Котельникова об одноразовых ключах и об отсчетах. УФН
Bennett, Charles; Brassard, Giles (1984). "Quantum cryptography: Public key distribution and coin tossing". Theoretical Computer Science. 560: 7–11. arXiv:2003.06557. doi:10.1016/j.tcs.2014.05.025. S2CID 27022972. Note: This paper was published originally in 1984, but was retracted, and the version on ArXiv is a reprint from 2014 of the 1984 paper.
Bennett, Charles; Brassard, Giles; Breidbart, Seth (2014). "Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP". Natural Computing. 13 (4): 453–458. doi:10.1007/s11047-014-9453-6. PMC 4224740. PMID 25400534. S2CID 3121156. Note: This is also a reprint of the original 1982 paper.
Hieu, Phan Duong (April 2007). "Cryptology during the French and American Wars in Vietnam" (PDF). Cryptologia. 41 (6): 1–21. doi:10.1080/01611194.2017.1292825. S2CID 3780267. Retrieved 14 April 2020.

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

Sergei N Molotkov (Institute of Solid-State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, Russian Federation) (22 February 2006). "Quantum cryptography and V A Kotel'nikov's one-time key and sampling theorems". Physics-Uspekhi. 49 (7): 750–761. Bibcode:2006PhyU...49..750M. doi:10.1070/PU2006v049n07ABEH006050. S2CID 118764598. Archived from the original on 2008-12-10. Retrieved 2009-05-03.{{cite journal}}: CS1 maint: multiple names: authors list (link) PACS numbers: 01.10.Fv, 03.67.Dd, 89.70.+c and openly in Russian Квантовая криптография и теоремы В.А. Котельникова об одноразовых ключах и об отсчетах. УФН

ufn.ru (Global: low place; English: low place)

Sergei N Molotkov (Institute of Solid-State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, Russian Federation) (22 February 2006). "Quantum cryptography and V A Kotel'nikov's one-time key and sampling theorems". Physics-Uspekhi. 49 (7): 750–761. Bibcode:2006PhyU...49..750M. doi:10.1070/PU2006v049n07ABEH006050. S2CID 118764598. Archived from the original on 2008-12-10. Retrieved 2009-05-03.{{cite journal}}: CS1 maint: multiple names: authors list (link) PACS numbers: 01.10.Fv, 03.67.Dd, 89.70.+c and openly in Russian Квантовая криптография и теоремы В.А. Котельникова об одноразовых ключах и об отсчетах. УФН

virginia.edu (Global: 1,203^rd place; English: 734^th place)

cs.virginia.edu

Shannon, Claude (1949). "Communication Theory of Secrecy Systems" (PDF). Bell System Technical Journal. 28 (4): 656–715. doi:10.1002/j.1538-7305.1949.tb00928.x.

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

Johnson, Tim. "What do all those hand signals mean? Inside the hidden language of baseball and softball". Retrieved 14 June 2024.

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

"Intro to Numbers Stations". Archived from the original on 18 October 2014. Retrieved 13 September 2014.
"One-Time Pad (OTP)". Cryptomuseum.com. Archived from the original on 2014-03-14. Retrieved 2014-03-17.
"'Secret signaling system patent' on Google.Com". google.com. Archived from the original on 11 March 2016. Retrieved 3 February 2016.
John Markoff (July 25, 2011). "Codebook Shows an Encryption Form Dates Back to Telegraphs". The New York Times. Archived from the original on May 21, 2013. Retrieved 2011-07-26.
Sergei N Molotkov (Institute of Solid-State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, Russian Federation) (22 February 2006). "Quantum cryptography and V A Kotel'nikov's one-time key and sampling theorems". Physics-Uspekhi. 49 (7): 750–761. Bibcode:2006PhyU...49..750M. doi:10.1070/PU2006v049n07ABEH006050. S2CID 118764598. Archived from the original on 2008-12-10. Retrieved 2009-05-03.{{cite journal}}: CS1 maint: multiple names: authors list (link) PACS numbers: 01.10.Fv, 03.67.Dd, 89.70.+c and openly in Russian Квантовая криптография и теоремы В.А. Котельникова об одноразовых ключах и об отсчетах. УФН
Schneier, Bruce. "One-Time Pads". Archived from the original on 2005-04-03.
Shannon, Claude E. (October 1949). "Communication Theory of Secrecy Systems" (PDF). Bell System Technical Journal. 28 (4): 656–715. doi:10.1002/j.1538-7305.1949.tb00928.x. hdl:10338.dmlcz/119717. Archived from the original (PDF) on 2012-01-20. Retrieved 2011-12-21.
"The Translations and KGB Cryptographic Systems" (PDF). The Venona Story. Fort Meade, Maryland: National Security Agency. 2004-01-15. pp. 26–27 (28–29th of 63 in PDF). Archived from the original (PDF) on 2009-05-10. Retrieved 2009-05-03. KGB's cryptographic material manufacturing center in the Soviet Union apparently reused some of the pages from one-time pads. This provided Arlington Hall with an opening.
"The Venona Translations" (PDF). The Venona Story. Fort Meade, Maryland: National Security Agency. 2004-01-15. p. 17th (of 63 in PDF) but marked 15. Archived from the original (PDF) on 2009-05-10. Retrieved 2009-05-03. Arlington Hall's ability to read the VENONA messages was spotty, being a function of the underlying code, key changes, and the lack of volume. Of the message traffic from the KGB New York office to Moscow, 49 percent of the 1944 messages and 15 percent of the 1943 messages were readable, but this was true of only 1.8 percent of the 1942 messages. For the 1945 KGB Washington office to Moscow messages, only 1.5 percent were readable. About 50 percent of the 1943 GRU-Naval Washington to Moscow/Moscow to Washington messages were read but none from any other year.
"Stasi Sprach Morse Machine". The Numbers Stations Research and Information Center. Archived from the original on March 13, 2015. Retrieved March 1, 2015.
"National Security Agency | Central Security Service > About Us > Cryptologic Heritage > Historical Figures and Publications > Publications > WWII > Sigsaly Story". 2019-02-24. Archived from the original on 2019-02-24. Retrieved 2022-03-27.
Jenkin, Tim (May–October 1995). "Talking to Vula: The Story of the Secret Underground Communications Network of Operation Vula". Mayibuye. Archived from the original on 2014-08-26. Retrieved 24 August 2014. Our system was based on the one-time pad, though instead of having paper pads the random numbers were on a disk.
Boak, David G. (July 1973) [1966]. A History of U.S. Communications Security; the David G. Boak Lectures, Vol. I (PDF) (2015 declassification review ed.). Ft. George G. Meade, MD: U.S. National Security Agency. Archived from the original (PDF) on 2017-05-25. Retrieved 2017-04-23.
Klein, Melville (2003). "Securing Record Communications: The TSEC/KW-26" (PDF). NSA. Archived from the original (PDF) on 2006-02-13. Retrieved 2006-05-12.

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

search.worldcat.org

Bellovin, Steven M. (2011). "Frank Miller: Inventor of the One-Time Pad". Cryptologia. 35 (3): 203–222. doi:10.1080/01611194.2011.583711. ISSN 0161-1194. S2CID 35541360.
Peng, Weiping; Cui, Shuang; Song, Cheng (2021-01-20). Raja, Gulistan (ed.). "One-time-pad cipher algorithm based on confusion mapping and DNA storage technology". PLOS ONE. 16 (1) e0245506. Bibcode:2021PLoSO..1645506P. doi:10.1371/journal.pone.0245506. ISSN 1932-6203. PMC 7817086. PMID 33471849.
Dušek, Miloslav; Haderka, Ondřej; Hendrych, Martin (1999-10-01). "Generalized beam-splitting attack in quantum cryptography with dim coherent states". Optics Communications. 169 (1): 103–108. Bibcode:1999OptCo.169..103D. doi:10.1016/S0030-4018(99)00419-8. ISSN 0030-4018.

One-time pad (English Wikipedia)

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

ui.adsabs.harvard.edu

alcatel-lucent.com (Global: low place; English: low place)

www3.alcatel-lucent.com

anc.org.za (Global: low place; English: low place)

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 49th place; English: 31st place)

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

columbia.edu (Global: 554th place; English: 368th place)

academiccommons.columbia.edu

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

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

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

en.wikisource.org (Global: 82nd place; English: 41st place)

governmentattic.org (Global: low place; English: 6,646th place)

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

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

eprint.iacr.org

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

ncbi.nlm.nih.gov

pubmed.ncbi.nlm.nih.gov

nsa.gov (Global: 7,332nd place; English: 4,773rd place)

numbers-stations.com (Global: low place; English: low place)

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

patents.google.com (Global: 1,154th place; English: 606th place)

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

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

sciencedirect.com (Global: 137th place; English: 146th place)

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

api.semanticscholar.org

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

ufn.ru (Global: low place; English: low place)

virginia.edu (Global: 1,203rd place; English: 734th place)

cs.virginia.edu

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

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

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

search.worldcat.org

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

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

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

columbia.edu (Global: 554^th place; English: 368^th place)

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

en.wikisource.org (Global: 82^nd place; English: 41^st place)

governmentattic.org (Global: low place; English: 6,646^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)

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

nsa.gov (Global: 7,332^nd place; English: 4,773^rd place)

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

patents.google.com (Global: 1,154^th place; English: 606^th place)

sciencedirect.com (Global: 137^th place; English: 146^th place)

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

virginia.edu (Global: 1,203^rd place; English: 734^th place)

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

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