DocumentCode :
640338
Title :
Low-density random matrices for secret key extraction
Author :
Hongchao Zhou ; Chandar, Venkat ; Wornell, Gregory
Author_Institution :
Res. Lab. of Electron., Massachusetts Inst. of Technol., Cambridge, MA, USA
fYear :
2013
fDate :
7-12 July 2013
Firstpage :
2607
Lastpage :
2611
Abstract :
Secret key extraction, the task of extracting a secret key from shared information that is partially known by an eavesdropper, has important applications in cryptography. Motivated by the requirements of high-speed quantum key distribution, we study secret-key extraction methods with simple and efficient hardware implementations, in particular, linear transformations based on low-density random matrices. We show that this method can achieve the information-theoretic upper bound (conditional Shannon entropy) on efficiency for a wide range of key-distribution systems. In addition, we introduce a numerical method that allows us to tightly estimate the quality of the generated secret key in the regime of finite block length, and use this method to demonstrate that low-density random matrices achieve very high performance for secret key extraction.
Keywords :
cryptography; information theory; matrix algebra; conditional Shannon entropy; cryptography applications; finite block length; high speed quantum key distribution; information theoretic upper bound; linear transformation; low density random matrix; secret key extraction method; shared information; Cryptography; Data mining; Entropy; Field programmable gate arrays; Information theory; Sparse matrices; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
ISSN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2013.6620698
Filename :
6620698
Link To Document :
بازگشت