后量子密码学 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "后量子密码学" in Chinese language version.

refsWebsite

Global rank Chinese rank

10web.archive.org

1^st place

3doi.org

2^nd place

23^rd place

2ieee.org

652^nd place

712^th place

2yp.to

low place

7,987^th place

1harvard.edu

18^th place

57^th place

1arxiv.org

69^th place

254^th place

1pqcrypto.org

low place

1science.org

1,160^th place

1,594^th place

1nih.gov

4^th place

5^th place

1semanticscholar.org

11^th place

332^nd place

1phys.org

1,283^rd place

2,386^th place

1etsi.org

7,368^th place

low place

1securityweek.com

low place

1ukri.org

low place

1nist.gov

355^th place

411^th place

1iacr.org

5,032^nd place

5,199^th place

1arstechnica.com

388^th place

546^th place

arstechnica.com

Post-quantum encryption contender is taken out by single-core PC and 1 hour. arstechnica. （原始内容存档于2023-12-15）.

arxiv.org

Peter W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing. 1997, 26 (5): 1484–1509. Bibcode:1995quant.ph..8027S. arXiv:quant-ph/9508027 . doi:10.1137/S0097539795293172.

doi.org

Peter W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing. 1997, 26 (5): 1484–1509. Bibcode:1995quant.ph..8027S. arXiv:quant-ph/9508027 . doi:10.1137/S0097539795293172.
Kramer, Anna. 'Surprising and super cool.' Quantum algorithm offers faster way to hack internet encryption. Science. 2023, 381 (6664): 1270 [2024-08-20]. PMID 37733849. S2CID 262084525. doi:10.1126/science.adk9443. （原始内容存档于2023-12-19）.
Gasser, Linus, Mulder, Valentin; Mermoud, Alain; Lenders, Vincent; Tellenbach, Bernhard , 编, Post-quantum Cryptography, Trends in Data Protection and Encryption Technologies (Cham: Springer Nature Switzerland), 2023: 47–52, ISBN 978-3-031-33386-6, doi:10.1007/978-3-031-33386-6_10  （英语）

etsi.org

ETSI Quantum Safe Cryptography Workshop. ETSI Quantum Safe Cryptography Workshop. ETSI. October 2014 [24 February 2015]. （原始内容存档于17 August 2016）.

harvard.edu

ui.adsabs.harvard.edu

Peter W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing. 1997, 26 (5): 1484–1509. Bibcode:1995quant.ph..8027S. arXiv:quant-ph/9508027 . doi:10.1137/S0097539795293172.

iacr.org

eprint.iacr.org

An efficient key recovery attack on SIDH (PDF). [2023-10-03]. （原始内容存档 (PDF)于2023-12-05）.

ieee.org

spectrum.ieee.org

Cryptographers Take On Quantum Computers. IEEE Spectrum. 2009-01-01.
Q&A With Post-Quantum Computing Cryptography Researcher Jintai Ding. IEEE Spectrum. 2008-11-01 [2024-08-20]. （原始内容存档于2021-05-07）.

nih.gov

ncbi.nlm.nih.gov

Kramer, Anna. 'Surprising and super cool.' Quantum algorithm offers faster way to hack internet encryption. Science. 2023, 381 (6664): 1270 [2024-08-20]. PMID 37733849. S2CID 262084525. doi:10.1126/science.adk9443. （原始内容存档于2023-12-19）.

nist.gov

NIST Releases First 3 Finalized Post-Quantum Encryption Standards, NIST, August 13, 2024

phys.org

New qubit control bodes well for future of quantum computing. phys.org. [2024-08-20]. （原始内容存档于2025-02-11）.

pqcrypto.org

Daniel J. Bernstein. Introduction to post-quantum cryptography (PDF). Post-Quantum Cryptography. 2009 [2021-02-08]. （原始内容存档 (PDF)于2009-09-20）.

science.org

Kramer, Anna. 'Surprising and super cool.' Quantum algorithm offers faster way to hack internet encryption. Science. 2023, 381 (6664): 1270 [2024-08-20]. PMID 37733849. S2CID 262084525. doi:10.1126/science.adk9443. （原始内容存档于2023-12-19）.

securityweek.com

Townsend, Kevin. Solving the Quantum Decryption 'Harvest Now, Decrypt Later' Problem. SecurityWeek. 2022-02-16 [2023-04-09]. （原始内容存档于2025-01-05）（美国英语）.

semanticscholar.org

api.semanticscholar.org

Kramer, Anna. 'Surprising and super cool.' Quantum algorithm offers faster way to hack internet encryption. Science. 2023, 381 (6664): 1270 [2024-08-20]. PMID 37733849. S2CID 262084525. doi:10.1126/science.adk9443. （原始内容存档于2023-12-19）.

ukri.org

uknqt.ukri.org

Quantum-Safe Secure Communications (PDF). UK National Quantum Technologies Programme. October 2021 [2023-04-09].

web.archive.org

Daniel J. Bernstein. Introduction to post-quantum cryptography (PDF). Post-Quantum Cryptography. 2009 [2021-02-08]. （原始内容存档 (PDF)于2009-09-20）.
Kramer, Anna. 'Surprising and super cool.' Quantum algorithm offers faster way to hack internet encryption. Science. 2023, 381 (6664): 1270 [2024-08-20]. PMID 37733849. S2CID 262084525. doi:10.1126/science.adk9443. （原始内容存档于2023-12-19）.
New qubit control bodes well for future of quantum computing. phys.org. [2024-08-20]. （原始内容存档于2025-02-11）.
Q&A With Post-Quantum Computing Cryptography Researcher Jintai Ding. IEEE Spectrum. 2008-11-01 [2024-08-20]. （原始内容存档于2021-05-07）.
ETSI Quantum Safe Cryptography Workshop. ETSI Quantum Safe Cryptography Workshop. ETSI. October 2014 [24 February 2015]. （原始内容存档于17 August 2016）.
Townsend, Kevin. Solving the Quantum Decryption 'Harvest Now, Decrypt Later' Problem. SecurityWeek. 2022-02-16 [2023-04-09]. （原始内容存档于2025-01-05）（美国英语）.
Daniel J. Bernstein. Cost analysis of hash collisions: Will quantum computers make SHARCS obsolete? (PDF). 2009-05-17 [2024-08-20]. （原始内容存档 (PDF)于2017-08-25）.
Daniel J. Bernstein. Grover vs. McEliece (PDF). 2010-03-03 [2024-08-20]. （原始内容存档 (PDF)于2024-11-19）.
An efficient key recovery attack on SIDH (PDF). [2023-10-03]. （原始内容存档 (PDF)于2023-12-05）.
Post-quantum encryption contender is taken out by single-core PC and 1 hour. arstechnica. （原始内容存档于2023-12-15）.

yp.to

cr.yp.to

Daniel J. Bernstein. Cost analysis of hash collisions: Will quantum computers make SHARCS obsolete? (PDF). 2009-05-17 [2024-08-20]. （原始内容存档 (PDF)于2017-08-25）.
Daniel J. Bernstein. Grover vs. McEliece (PDF). 2010-03-03 [2024-08-20]. （原始内容存档 (PDF)于2024-11-19）.