Characterization of some of the biggest discrete structures, which do not belong to any of the infinite families (like Johnson and Hamming schemes), by using their intersection array. The biggest among them is an object related to the sporadic simple finite Suzuki group. In this way we characterized this remarkable group using only seven parameters. This is a sporadic primitive object with 22,880 vertices and valency 280 - before that the record mark was a primitive object on 819 vertices, and in general on 4096 vertices.
COBISS.SI-ID: 14632537
Information, transactions, management and technological procedures in the e-connected society are exclusively based on digital technologies. Therefore, the use of cryptography is a key element for data security and secure transmission of sensitive data. As such, it is a key element for secure society as a whole. The article introduces a modified security model and discusses the role of cryptography within this model. In the new model, the emphasis is no longer on protection of a given territory (perimeter), instead the goal is to protect and secure individual data structures and applications.
COBISS.SI-ID: 1799397
The amount of collected personal data is constantly increasing. These data are often used for research, where the most specific information is desired. At the same time it is necessary to assure privacy of personal data. If data are too general, the researchers have more difficulties when searching for correlations. If data are too specific, some sensitive personal information could be revealed. That is why the balance between the usefulness and the privacy of data has to be found. For this purpose the use of the anonymized data, which ensure usability and anonymity, was suggested.
COBISS.SI-ID: 1024081748
The aim of this paper was to relax the notion of 1-homogeneous graphs, while trying to maintain most of their algebraic properties.
COBISS.SI-ID: 14632793
The nonexistence of a distance-regular graphs with intersection array {74,54,15;1,9,60} and {4r^3+8r^2+6r+1, 2r(r+1)(2r+1), 2r^2+2r+1;1,2r(r+1), (2r+1)(2r^2+2r+1)}, with r a positive integer was proven. Both cases serve to illustrate a technique, which can help determine the structural properties for distance-regular graphs and association schemes with a sufficient number of vanishing Krein parameters.
COBISS.SI-ID: 15264601