Fetching the paper…
Reading the bibliography…
The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms.
D. Bohm, Quantum theory . Courier Corporation, 1951
1951
Earlier work this paper cites.
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Proposed experiment to test local hidden-variable theories,” Physical review letters , vol. 23, no. 15, p. 880, 1969
1969
Earlier work this paper cites.
C. H. Bennett and G. Brassard, “Quantum Cryptography: Public Key Distribution, and Coin-Tossing,” in Proc. 1984 IEEE International Conference on Computers, Systems, and Signal Processing , no. 560, 1984, pp. 175–179
1984
Earlier work this paper cites.
C. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” Proceedings of IEEE International Conference on Computers, Systems and Signal Processing , pp. 175–179, 1984
1984
Earlier work this paper cites.
E. Panarella, “Heisenberg uncertainty principle,” in Annales de la Fondation Louis de Broglie , vol. 12, no. 2, 1987, pp. 165–193
1987
Earlier work this paper cites.
R. C. Merkle, A Certified Digital Signature . New York, NY: Springer New York, 1990, pp. 218–238
1990
Earlier work this paper cites.
A. K. Ekert, “Quantum cryptography based on bell’s theorem,” Physical review letters , vol. 67, no. 6, p. 661, 1991
1991
Earlier work this paper cites.
C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental Quantum Cryptography,” Journal of Cryptology , vol. 5, no. 1, pp. 3–28, 1992
1992
Earlier work this paper cites.
C. H. Bennett, G. Brassard, and N. D. Mermin, “Quantum cryptography without bell’s theorem,” Physical Review Letters , vol. 68, no. 5, p. 557, 1992
1992
Earlier work this paper cites.
C. H. Bennett, “Quantum cryptography using any two nonorthogonal states,” Physical review letters , vol. 68, no. 21, p. 3121, 1992
1992
Earlier work this paper cites.
P. W. Shor, “Algorithms for Quantum Computation: Discrete Logarithms and Factoring,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science , ser. SFCS ’94. Washington, DC, USA: IEEE Computer Society, 1994, pp. 124–134
1994
Earlier work this paper cites.
L. Grover, “A Fast Quantum Mechanical Algorithm For Database Search,” Bell Labs, New Jersey, Tech. Rep., 1996
1996
Earlier work this paper cites.
R. Jozsa, “Entanglement and Quantum Computation,” in Geometric Issues in the Foundations of Science , S. Huggett, L. Mason, K. Tod, S. Tsou, and N. Woodhouse, Eds. Oxford University Press, July 1997
1997
Earlier work this paper cites.
S. Bone and M. Castro, “A Brief History of Quantum Computing,” Surveys and Presentations in Information Systems Engineering (SURPRISE) , vol. 4, no. 3, pp. 20–45, 1997, http://www.doc.ic.ac.uk/\~nd/surprise_97/journal/vol4/spb3/
1997
Earlier work this paper cites.
M. Ajtai and C. Dwork, “A Public-Key Cryptosystem With Worst-Case/Average-Case Equivalence,” Proceedings of The 29th Annual ACM Symposium on Theory of Computing - STOC ’97 , pp. 284–293., 1997
1997
Earlier work this paper cites.
O. Goldreich, S. Goldwasser, and S. Halevi, “Public-Key Cryptosystems from Lattice Reduction Problems,” Advances in Cryptology - {
1997
Earlier work this paper cites.
U. Vazirani, “On The Power of Quantum Computation,” Philosophical Transactions of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 356, no. 1743, pp. 1759–1768, 1998
1998
Earlier work this paper cites.
G. Brassard, P. Høyer, and A. Tapp, Quantum Cryptanalysis of Hash and Claw-Free Functions . Berlin, Heidelberg: Springer Berlin Heidelberg, 1998, pp. 163–169
1998
Earlier work this paper cites.
D. Bruß, “Optimal eavesdropping in quantum cryptography with six states,” Physical Review Letters , vol. 81, no. 14, p. 3018, 1998
1998
Earlier work this paper cites.
J. Hoffstein, J. Pipher, and J. H. Silverman, “NTRU: A Ring-Based Public Key Cryptosystem,” Algorithmic number theory , pp. 267–288, 1998
1998
Earlier work this paper cites.
P. Nguyen and J. Stern, Cryptanalysis of the Ajtai-Dwork Cryptosystem . Springer Berlin Heidelberg, 1998, pp. 223–242
1998
Earlier work this paper cites.
H. Bechmann-Pasquinucci and N. Gisin, “Incoherent and coherent eavesdropping in the six-state protocol of quantum cryptography,” Physical Review A , vol. 59, no. 6, p. 4238, 1999
1999
Earlier work this paper cites.
P. Nguyen, “Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem,” Advances in Cryptology - CRYPTO , vol. 1666, pp. 288–304, 1999
1999
Earlier work this paper cites.
G. Brassard, N. Lütkenhaus, T. Mor, and B. C. Sanders, “Security aspects of practical quantum cryptography,” in International conference on the theory and applications of cryptographic techniques . Springer, 2000, pp. 289–299
2000
Earlier work this paper cites.
N. J. Cerf, M. Levy, and G. Van Assche, “Quantum distribution of gaussian keys using squeezed states,” Physical Review A , vol. 63, no. 5, p. 052311, 2001
2001
Earlier work this paper cites.
D. Mayers, “Unconditional Security in Quantum Cryptography,” Journal of the ACM , vol. 48, no. 3, pp. 351–406, 2001
2001
Earlier work this paper cites.
F. Grosshans and P. Grangier, “Continuous variable quantum cryptography using coherent states,” Physical review letters , vol. 88, no. 5, p. 057902, 2002
2002
Cited alongside, same era.
C. Silberhorn, T. C. Ralph, N. Lütkenhaus, and G. Leuchs, “Continuous variable quantum cryptography: Beating the 3 db loss limit,” Physical review letters , vol. 89, no. 16, p. 167901, 2002
2002
Cited alongside, same era.
K. Inoue, E. Waks, and Y. Yamamoto, “Differential phase shift quantum key distribution,” Physical Review Letters , vol. 89, no. 3, p. 037902, 2002
2002
Cited alongside, same era.
S. J. Lomonaco, J. Kauffman, and L. H, “Quantum Hidden Subgroup Problems: A Mathematical Perspective,” Quantum , pp. 1–63., 2002
2002
Cited alongside, same era.
J. Proos and C. Zalka, “Shor’s Discrete Logarithm Quantum Algorithm for Elliptic Curves,” Quantum Info. Comput. , vol. 3, no. 4, pp. 317–344, 2003
R. Overbeck and N. Sendrier, “Code-based Cryptography,” in Post-Quantum Cryptography . Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 95–145
2009
Later among the works it cites.
P. S. Hirschhorn, J. Hoffstein, N. Howgrave-Graham, and W. Whyte, Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches . Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 437–455
2009
Later among the works it cites.
C. Paar and J. Pelzl, “Introduction to Public-Key Cryptography,” in Understanding Cryptography . Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 149–171
2010
Later among the works it cites.
D. Bernstein, E. Dahmen, and Buch, Introduction to Post-Quantum Cryptography . Springer-Verlag Berlin Heidelberg, 2010
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
National Security Agency, “National Policy on the Use of the Advanced Encryption Standard (AES) to Protect National Security Systems and National Security Information,” NSA, Tech. Rep., 2003
2003
Cited alongside, same era.
——, “Differential-phase-shift quantum key distribution using coherent light,” Physical Review A , vol. 68, no. 2, p. 022317, 2003
2003
Cited alongside, same era.
V. Scarani, A. Acin, G. Ribordy, and N. Gisin, “Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulse implementations,” Physical review letters , vol. 92, no. 5, p. 057901, 2004
2004
Cited alongside, same era.
A. Acin, N. Gisin, and V. Scarani, “Coherent-pulse implementations of quantum cryptography protocols resistant to photon-number-splitting attacks,” Physical Review A , vol. 69, no. 1, p. 012309, 2004
2004
Cited alongside, same era.
B.-G. Englert, D. Kaszlikowski, H. K. Ng, W. K. Chua, J. Řeháček, and J. Anders, “Efficient and robust quantum key distribution with minimal state tomography,” arXiv preprint quant-ph/0412075 , 2004
2004
Cited alongside, same era.
C. Weedbrook, A. M. Lance, W. P. Bowen, T. Symul, T. C. Ralph, and P. K. Lam, “Quantum cryptography without switching,” Physical review letters , vol. 93, no. 17, p. 170504, 2004
2004
Cited alongside, same era.
N. Gisin, G. Ribordy, H. Zbinden, D. Stucki, N. Brunner, and V. Scarani, “Towards practical and fast quantum cryptography,” arXiv preprint quant-ph/0411022 , 2004
2004
Cited alongside, same era.
2010
Later among the works it cites.
Z. Yuan, J. Dynes, and A. Shields, “Avoiding the Blinding Attack in QKD,” Nature Photonics , vol. 4, pp. 800–801, December 2010
2010
Later among the works it cites.
L. Lydersen, C. Wiechers, C. Wittmann, D. Elser, J. Skaar, and V. Makarov, “Avoiding the Blinding Attack in QKD,” Nature Photonics , vol. 4, pp. 801–801, December 2010
2010
Later among the works it cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , 10th ed. New York, NY, USA: Cambridge University Press, 2011
2011
Later among the works it cites.
J. Buchmann, E. Dahmen, and A. Hülsing, “XMSS-a Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions,” Post-Quantum Cryptography , pp. 117–129, 2011
2011
Later among the works it cites.
H. Singh, D. Gupta, and A. Singh, “Quantum key distribution protocols: A review,” Journal of Computational Information Systems , vol. 8, pp. 2839–2849, 2012
2012
Later among the works it cites.
D. Stehle and R. Steinfeld, “Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices,” Cryptology ePrint Archive, Report 2013/004, 2013
2013
Later among the works it cites.
C. Tao, A. Diene, S. Tang, and J. Ding, “Simple Matrix Scheme for Encryption,” in International Workshop on Post-Quantum Cryptography . Springer, 2013, pp. 231–242
2013
Later among the works it cites.
H. Andreas, W-OTS+ –Shorter Signatures for Hash-Based Signature Schemes . Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 173–188
2013
Later among the works it cites.
J. Muhonen and T. Dehollain, “Storing Quantum Information For 30 Seconds In a Nanoelectronic Device,” Nature Nanotechnology , vol. 9, pp. 986–991, 2014
2014
Later among the works it cites.
Z. Kirsch, “Quantum Computing: The Risk to Existing Encryption Methods,” Ph.D. dissertation, Tufts University, Massachusetts, 2015, http://www.cs.tufts.edu/comp/116/archive/fall2015/zkirsch.pdf
2015
Later among the works it cites.
M. Campagna and C. Xing, “Quantum Safe Cryptography and Security: An Introduction, Benefits, Enablers and Challenges,” ETSI, Tech. Rep. 8, 2015
2015
Later among the works it cites.
2015
Later among the works it cites.
W. Buchanan and A. Woodward, “Will Quantum Computers be the End of Public Key Encryption?” Journal of Cyber Security Technology , vol. 1, no. 1, pp. 1–22, 2016
2016
Later among the works it cites.
L. Chen, S. Jordan, Y.-K. Liu, D. Moody, R. Peralta, R. Perlner, and D. Smith-Tone, “NIST: Report on Post-Quantum Cryptography,” NIST, Tech. Rep., 2016
2016
Later among the works it cites.
N. Koblitz and A. Menezes, “A riddle wrapped in an enigma,” IEEE Security Privacy , vol. 14, no. 6, pp. 34–42, Nov 2016
2016
Later among the works it cites.
D. J. Bernstein, C. Chuengsatiansup, T. Lange, and C. van Vredendaal, “NTRU Prime,” IACR Cryptology ePrint Archive , vol. 2016, p. 461, 2016
2016
Later among the works it cites.
W. Tichy, “Is quantum computing for real?: An interview with catherine mcgeoch of d-wave systems,” Ubiquity , vol. 2017, no. July, pp. 2:1–2:20, Jul. 2017. [Online]. Available: http://doi.acm.org/10.1145/3084688
2017
Later among the works it cites.
L. S. Bishop, S. Bravyi, A. Cross, J. M. Gambetta, and J. Smolin, “Quantum volume,” Technical report, 2017., Tech. Rep., 2017
2017
Later among the works it cites.
D. Moody, “The ship has sailed: The nist post-quantum crypto competition.” [Online]. Available: https://csrc.nist.gov/CSRC/media//Projects/Post-Quantum-Cryptography/documents/asiacrypt-2017-moody-pqc.pdf
2017
Later among the works it cites.