Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices

Jun MURAMATSU  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A   No.7   pp.2036-2046
Publication Date: 2006/07/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.7.2036
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Theory
Keyword: 
common information,  cryptography,  linear codes,  low density parity check codes,  multi-terminal source coding,  secret key agreement,  secret key capacity,  

Full Text: PDF>>
Buy this Article




Summary: 
This paper deals with a secret key agreement problem from correlated random numbers. It is proved that there is a pair of linear matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. A relation between the coding problem of correlated sources and a secret key agreement problem from correlated random numbers are also discussed.