Error correcting codes, block designs, perfect secrecy and finite fields
type: Item
instance of: scholarly article
title: Error correcting codes, block designs, perfect secrecy and finite fields
zbMATH Open document ID: 1114.94007
author: Aiden A. Bruen
author: David Wehlau
author: Mario A. Forcinito
published in: Acta Applicandae Mathematicae
publication date: 2006-11-06T00:00:00Z
review text: This paper addresses a solution to the necessity of key exchange prior to a cryptographic communication between two parties. An algorithm to establish a common key through public discussion under the assumption that the communicants posses keys of a common length \(N\) which are not necessarily equal but whose mutual information is non-zero is analyzed. The algorithm in question was originally introduced by \textit{C. H. Bennett, F. Bessette, G. Brassard, L. Salvail} and \textit{J. Smolin} [Experimental quantum cryptography. J. Cryptol. 5, No. 1, 3--28 (1992; Zbl 1114.94005)] a preliminary version was given in [Advances in Cryptology-- Eurocrypt '90 Proceedings, Berlin-Heidelberg-New York: Springer, Lect. Notes Comput. Sci. 473, 253--265 (1991)]. In the paper under review, it is shown that under modest assumptions the algorithm does indeed converge to a non-empty key. In fact, the paper includes a method to calculate a good choice of \(N\) in order to efficiently arrive at a common key of a prefixed desired length \(n\).
reviewed by: Sergio R. López-Permouth
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 5070960
zbMATH Keywords: hash functions
zbMATH Keywords: finite fields
zbMATH Keywords: secret key distillation
zbMATH Keywords: perfect secrecy
MaRDI profile type: Publication
full work available at URL: s10440-006-9043-4
OpenAlex ID: W1984925593
cites work: Experimental quantum cryptography.
cites work: Generalized privacy amplification
cites work: Privacy Amplification by Public Discussion
cites work: Q3737429
cites work: Q3160277
cites work: A QUICK GLANCE AT QUANTUM CRYPTOGRAPHY
cites work: Secret key agreement by public discussion from common information
cites work: Q4364560
cites work: Q4869527
cites work: Communication Theory of Secrecy Systems*
cites work: A Mathematical Theory of Communication
DOI: 10.1007/S10440-006-9043-4
description: scientific article; zbMATH DE number 5070960