Abstract
Key distribution patterns (KDPs) are finite incidence structures satisfying a certain property which enables them to be applied to a problem in network key distribution. Very few useful examples of KDPs are known. We discuss some ideas which can lead to constructions for KDPs and apply these ideas to construct infinite families of KDPs from conics in finite projective and affine planes.
Similar content being viewed by others
References
Blom, R., An optimal class of symmetric key generation systems,Advances in Cryptology: Proceedings of Eurocrypt 84, Springer-Verlag, Berlin. Lecture Notes in Computer Science, Vol. 209 (1985), pp. 335–338.
Gong, L. and Wheeler, D.J., A matrix key-distribution scheme.J. Cryptology, Vol. 2 (1990), pp. 51–59.
Hughes, D.R. and Piper F.C.,Design Theory, Cambridge, MA: Cambridge University Press (1988).
Jungnickel, D. and Vedder, K., On the geometry of planar difference sets,Europ. J. Comb., Vol. 5 (1984), pp. 143–148.
Mitchell, C.J., Combinatorial techniques for key storage reduction in secure networks. Technical memo, Hewlett Packard Laboratories, Bristol, (1988).
Mitchell, C.J. and Piper, F.C., Key storage in secure networks,Discrete Applied Mathematics, Vol. 21 (1988), pp. 215–228.
Author information
Authors and Affiliations
Additional information
Communicated by R. Mullin
Rights and permissions
About this article
Cite this article
Quinn, K.A.S. Some constructions for key distribution patterns. Des Codes Crypt 4, 177–191 (1994). https://doi.org/10.1007/BF01578871
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01578871