On Non-Polynomial Latin Squares

Authors:
Otokar Grošek;Peter Horák;Tran Van Trung
Affiliations:
Department of Mathematics, Slovak University of Technology, 812 19 Bratislava, Slovakia grosek@kmat.elf.stuba.sk;Interdisciplinary Arts & Sciences, University of Washington at Tacoma, 87402 Tacoma WA, U.S.A. horak@u.washington.edu;Institut für Experimentelle Mathematik, Universität Duisburg-Essen, Ellernstraße 29, 45326 Essen, Germany trung@exp-math.uni-essen.de
Venue:
Designs, Codes and Cryptography
Year:
2004

Citing 2
Cited 0

Asymptotic enumeration of Latin rectangles

Journal of Combinatorial Theory Series B
Chinese remainder theorem: applications in computing, coding, cryptography

Chinese remainder theorem: applications in computing, coding, cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

It turns out that Latin squares which are hard to approximate by a polynomial are suitable to be used as a part of block cipher algorithms (BCA). In this paper we state basic properties of those Latin squares and provide their construction.