Publications
Sort:
Open Access Research Article Issue
A computational approach to analyze the Hadamard quasigroup product
Electronic Research Archive 2023, 31(6): 3245-3263
Published: 15 June 2023
Abstract PDF (599.3 KB) Collect
Downloads:1

Based on the binary product described by any Latin square, the Hadamard quasigroup product is introduced in this paper as a natural generalization of the classical Hadamard product of matrices. The successive iteration of this new product is endowed with a cyclic behaviour that enables one to define a pair of new isomorphism invariants of Latin squares. Of particular interest is the set of Latin squares for which this iteration preserves the Latin square property, which requires the existence of successive localized Latin transversals within the Latin square under consideration. In order to enumerate and classify, up to isomorphism, these Latin squares, we propose a computational algebraic geometry approach based on the computation of reduced Gröbner bases. To illustrate this point, we obtain the classification of the sought Latin squares, for order up to six, by using the open computer algebra system for polynomial computations Singular.

Open Access Research Article Issue
Optimal secret share distribution in degree splitting communication networks
Networks and Heterogeneous Media 2023, 18(4): 1713-1746
Published: 15 December 2023
Abstract PDF (672.4 KB) Collect
Downloads:1

Dynamic coloring has recently emerged as a valuable tool to optimize cryptographic protocols based on secret sharing, which enforce data security in communication networks and have significant importance in both online storage and cloud computing. This type of graph labeling enables the dealer to distribute secret shares among the nodes of a communication network so that everybody can recover the secret after a minimum number of rounds of communication. This paper delves into this topic by dealing with the dynamic coloring problem for degree splitting graphs. The topological structure of the latter enables the dealer to avoid dishonesty by adding control nodes that supervise all those participants with a similar influence in the network. More precisely, we solve the dynamic coloring problem for degree splitting graphs of any regular graph. The irregular case is partially solved by establishing a lower bound for the corresponding dynamic chromatic number. As illustrative examples, we solve the dynamic coloring problem for the degree splitting graphs of cycles, cocktail, book, comb, fan, jellyfish, windmill and barbell graphs.

Total 2