Security Research on an Information-Theoretically Secure Secret Key Agreement Using LDPC Matrices

Secret key agreement is a major task in network security solutions using secret-key cryptosystems. An information-theoretically secure secret key agreement protocol using LDPC matrices was introduced by Jun Muramatsu. In this paper, the enemy can obtain not only full transmitted messages but also partial side information. We are interested in the equivocation of the generated key to this more powerful enemy. A relation between the security of the secret key agreement protocol and the LDPC matrices used in it is also discussed.