Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP
暂无分享,去创建一个
[1] R. Gallager. Information Theory and Reliable Communication , 1968 .
[2] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[3] Gilles Brassard,et al. Quantum Cryptography, or Unforgeable Subway Tokens , 1982, CRYPTO.
[4] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] W. Wootters,et al. A single quantum cannot be cloned , 1982, Nature.
[6] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[7] Stephen Wiesner,et al. Conjugate coding , 1983, SIGA.