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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
