Abstract
A key distribution pattern is a combinatorial structure which provides a secure method of distributing secret keys among a number of participants in a cryptographic scheme. Inversive and Laguerre planes have been used to construct key distribution patterns with storage requirements lower than the trivial distribution system. In this note we construct key distribution patterns from Minkowski planes, the third of the so-calledcircle geometries.
Similar content being viewed by others
References
T. Beth, D. Jungnickel and H. Lenz,Design Theory, Cambridge University Press, Cambridge (1986).
A. Beutelspachen,Einführung in die endliche Geometrie II: Projektive Räume, Bibliographisches Institut, Mannheim (1983).
P. Dembowski,Finite Geometries, Springer-Verlag, Berlin Heidelberg (1968).
L. Gong and D. J. Wheeler, A matrix key-distribution scheme.J. Cryptology, Vol. 2 (1990) pp. 51–59.
C. J. Mitchell, Combinatorial techniques for key storage reduction in secure networks, Technical memo, Hewlett-Packard Laboratories, Bristol (1988).
C. J. Mitchell and F. C. Piper, Key storage in secure networks,Discrete Applied Mathematics, Vol. 21 (1988) pp. 215–228.
C. M. O'Keefe, Applications of finite geometries to information security,Australas. J. Combin., Vol. 7 (1993), pp. 195–212.
K. A. S. Quinn,Combinatorial Structures with Applications to Information Theory, Ph.D. thesis, RHBNC, University of London (1991).
G. J. Simmons (ed.),Contemporary Cryptology, IEEE Press, New York (1992).
J. A. Thas, Circle geometries and generalized quadrangles,Finite Geometries, Dekker, New York (1985) pp. 327–352.
Author information
Authors and Affiliations
Additional information
The author acknowledges the support of the Australian Research Council
Rights and permissions
About this article
Cite this article
O'Keefe, C.M. Key distribution patterns using Minkowski planes. Des Codes Crypt 5, 261–267 (1995). https://doi.org/10.1007/BF01388388
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388388