Finite geometry and combinatorics has been very useful in modelling and benchmarking many problems arising from digital communications, information security and cryptography, by facilitating the study of the essential structures and their interactions. While using existing combinatorial objects to provide constructions and benchmarks for various applications has been productive, more in-depth consideration of whether the properties of these objects are strictly what is required in the applications can also yield interesting insights, and some applications can also provide inspirations and results in other areas. I would like to talk about some structures in finite geometry arising from some applications in information security, with the aim that we might come to a better understanding of their properties and their relationships to existing structures, and that this might give us further avenues of research.