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.
KeywordsBoolean Function Error Detection Quantum Channel Classical Channel Redundancy Part
Unable to display preview. Download preview PDF.
- 1.Bennett, C.H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. Proc. Int. Conf. on Computers, Systems and Signal Processing, Bangalore, India (1984) 175–179Google Scholar
- 7.Chor, B., Goldreich, O., Hastad, J., Freidmann, J., Rudich, S., Smolensky, R.: The Bit Extraction Problem or t-resilient Functions. 26th IEEE Symp. Foundations of Computer Science, (1985) 396–407Google Scholar
- 9.FIPS 180-1: Secure Hash Standard, Federal Information Processing Standard (FIPS), Publication 180-1, National Institute of Standards and Technology, US Department of Commerce, Washington D.C., April (1995)Google Scholar
- 12.Rivest, R.L.: The MD5 Message-digest algorithm, Request for Comments (RFC) 1321, Internet Activities Board, Internet Task Force, April (1992)Google Scholar
- 14.Vernam, G.S.: Cipher Printing Telegraph Systems for Secret Wire and Radio Telegraphic Communications. J. Amer. Inst. Elect. Eng. 55 (1926) 109–115Google Scholar