Skip to main content
SpringerLink
Log in

On Non-Polynomial Latin Squares

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. D. Belousov, Foundations of the Theory of Quasigroups and Loops, Nauka, Moscow (1967). (In Russian.)

    Google Scholar 

  2. R. A. Brualdi and H. J. Ryser, Combinatorial Matrix Theory, Cambridge University Press, Cambridge (1991).

    Google Scholar 

  3. V. Čanda and T. V. Trung, Scalable block ciphers based on Feistel-like structure, Tatra Mountains Mathematical Pub., Vol. 25 (2002) pp. 39–66.

    Google Scholar 

  4. J. Dénes and A. D. Keedwell, Latin Squares and their Applications, Akadémiai Kiadó, Budapest (1974).

    Google Scholar 

  5. C. Ding, D. Pei and A. Salomaa, Chinese Remainder Theorem. Applications in Computing, Coding, Cryptography, World Scientific, Singapore (1996).

    Google Scholar 

  6. O. GroŠek, K. Nemoga and L. Satko, Generalized perfectly nonlinear functions, Tatra Mountains Pub., Vol. 20 (2000) pp. 121–131.

    Google Scholar 

  7. O. GroŠek and W. Wei, Bent-like functions on groupoids, Pure Mathematics and Applications, Vol. 10 No. 3, SAAS Ltd. SAAS Publishing (1999) pp. 267–278.

    Google Scholar 

  8. O. GroŠek, K. Nemoga and L. Satko, Ideal difference tables from an algebraic point of view. In Pino Cabalero Gil and Candelaria Hernandez Goya (eds.), Ammendment to Criptologa y Seguridad de la Información, RA-MA, Madrid (2000), pp. 43–53.

    Google Scholar 

  9. C. D. Godsil and B. D. McKay, Asymptotic enumeration of Latin squares, J. Combinatorial Theory B, Vol. 48 (1990) pp. 19–44.

    Google Scholar 

  10. L. Satko, O. GroŠek and K. Nemoga, Extremal generalized S-boxes, Computing and Informatics No 1, Vol. 22 (2003) pp. 85–99.

    Google Scholar 

  11. Š. Schwarz, The role of semigroups in the elementary theory of numbers, Math. Slovaca, Vol. 31 (1981) pp. 369–395.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Slovak, University of Technology, 812 19 Bratislava, Slovakia

    Otokar Grošek

  2. University of Washington at Tacoma, 87402 Tacoma WA, U.S.A.

    Peter Horák

  3. 45326 Essen, Germany trung@exp-math.uni-essen.de

    Tran van Trung

Authors
  1. Otokar Grošek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Horák
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tran van Trung
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grošek, O., Horák, P. & van Trung, T. On Non-Polynomial Latin Squares. Designs, Codes and Cryptography 32, 217–226 (2004). https://doi.org/10.1023/B:DESI.0000029224.20896.8b

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DESI.0000029224.20896.8b

Search

Navigation