Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.