HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Efficient Almost Strongly Universal Hash Function for Quantum Key Distribution

Abstract : Quantum Key Distribution (QKD) technology, based on principles of quantum mechanics, can generate unconditional security keys for communication parties. Information-theoretically secure (ITS) authentication, the compulsory procedure of QKD systems, avoids the man-in-the-middle attack during the security key generation. The construction of hash functions is the paramount concern within the ITS authentication. In this extended abstract, we proposed a novel Efficient NTT-based ε-Almost Strongly Universal Hash Function. The security of our NTT-based ε-ASU hash function meets ε ≤ L(n + 1)/2n − 2. With ultra-low computational amounts of construction and hashing procedures, our proposed NTT-based ε-ASU hash function is suitable for QKD systems.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Monday, February 13, 2017 - 2:31:29 PM
Last modification on : Thursday, March 5, 2020 - 4:47:14 PM
Long-term archiving on: : Sunday, May 14, 2017 - 2:02:53 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Bo Liu, Baokang Zhao, Chunqing Wu, Wanrong Yu, Ilsun You. Efficient Almost Strongly Universal Hash Function for Quantum Key Distribution. 3rd International Conference on Information and Communication Technology-EurAsia (ICT-EURASIA) and 9th International Conference on Research and Practical Issues of Enterprise Information Systems (CONFENIS), Oct 2015, Daejon, South Korea. pp.282-285, ⟨10.1007/978-3-319-24315-3_29⟩. ⟨hal-01466229⟩



Record views


Files downloads