Error Detection and Authentication in Quantum Key Distribution

Detecting errors in a raw key and authenticating a private key are crucial for quantum key distribution schemes. Our aim is to propose practical methods for error detection and authentication in quantum key distribution schemes. We introduce several concepts about neighborhood collision free properties of Boolean functions, which are closely related to hash functions, and propose methods based on neighborhood collision free functions and error correcting codes such as Reed-Solomon code. We also examine whether or not widely used cryptographic hash functions SHA-1 and MD5 satisfy the neighborhood collision free property by computation experiments.

[1]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[2]  G. S. Vernam,et al.  Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.

[3]  Gilles Brassard,et al.  Experimental Quantum Cryptography , 1990, EUROCRYPT.

[4]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[5]  Charles H. Bennett,et al.  Quantum cryptography using any two nonorthogonal states. , 1992, Physical review letters.

[6]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[7]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..

[8]  D. Bouwmeester,et al.  The Physics of Quantum Information , 2000 .

[9]  Ronald L. Rivest,et al.  The MD5 Message-Digest Algorithm , 1992, RFC.

[10]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.