In this chapter, we first overview the applications of combinatorics in cryptography. Then, we
take look at some historical applications of non-combinatorial squares and cubes in …

Perfectly-secure cryptography is a branch of information-theoretic cryptography. A perfectly-
secure cryptosystem guarantees that the malicious third party cannot guess anything …

A lower bound is presented for the minimal number of filled cells in a maximal partial Latin
hypercube of dimension d and order n. The result generalises and extends previous results …

Completing partial latin squares is NP-complete. Motivated by Ryser's theorem for latin
rectangles, in 1974, Cruse found conditions that ensure a partial symmetric latin square of …

Maximal designs and configurations - a survey Page 1 Acta Universitatis Matthiae Belii, series
Mathematics Volume 23 (2015), 9–25, ISSN 1338-712X, ISBN 978-80-557-1038-9 Online …

Perfectly secure cryptography is a branch of information-theoretic cryptography. A perfectly
secure cryptosystem guarantees that the malicious third party cannot guess anything …

For a graph G of order na maximal edge coloring is a proper edge coloring with χ′(K n)
colors such that adding any edge to G in any color makes it improper. Meszka and Tyniec …

We consider the problem of constructing Latin cubes subject to the condition that some
symbols may not appear in certain cells. We prove that there is a constant $\gamma> 0 …

For a graph $ G $ of order $ n $ a maximal edge coloring is a proper edge coloring with
$\chi'(K_n) $ colors such that adding any edge to $ G $ in any color makes it improper …

We consider the problem of constructing Latin cubes subject to the condition that some
symbols may not appear in certain cells. We prove that there is a constant γ> 0 such that if n …