An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Key storage in secure networks
Discrete Applied Mathematics
Some constructions for key distribution patterns
Designs, Codes and Cryptography
Key distribution patterns using Minkowski planes
Designs, Codes and Cryptography
A Comparison of Key Distribution Patterns Constructed from Circle Geometries
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
| Hi-index | 0.00 |
The problem of key management in a communications network is of primary importance. A key distribution pattern is an incidence structure which provides a secure method of distributing keys in a large network reducing storage requirements. It is of interest to find explicit constructions for key distribution patterns. In O’Keefe [5–7], examples are shown using the finite circle geometries (Minkowski, Laguerre and inversive planes); in Quinn [12], examples are constructed from conics in finite projective and affine planes. In this paper, we construct some examples using the finite tangent-circle structures, introduced in Quattrocchi and Rinaldi [10] and we give a comparison of the storage requirements.