Finite Semi-group Modulo and Its Application to Symmetric Cryptography
Frank Emmanuel Akpan, Udoaka Otobong Gabriel · International Journal of Pure Mathematics · 2022
In this paper, the application of finite semigroup structure S is studied.In particular, the study uses finite semi-group modulo n , p n FS to generate Mutually Orthogonal Latin Squares (MOLS) and applied same to symmetric cryptography.It is shown in the study that for any 1 n , the maximum number of mutually orthogonal Latin squares in a finite semi-group modulo n , p n FS , 1 ......... , 3 , 2 , 1 , 0