|
|||||
|
|
On Non-Polynomial Latin Squares |
|
| Authors: | Otokar Grošek Peter Horák Tran van Trung |
| Institution: | 1. Department of Mathematics, Slovak, University of Technology, 812 19 Bratislava, Slovakia 2. University of Washington at Tacoma, 87402 Tacoma WA, U.S.A. 3. 45326 Essen, Germany trung@exp-math.uni-essen.de |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |