Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.

DOI10.1016/j.dam.2015.06.033zbMath1338.20063OpenAlexW1908044368MaRDI QIDQ906427

S. Chakrabarti, S. K. Pal, Vyacheslav A. Artamonov

Publication date: 21 January 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.06.033

zbMATH Keywords

algorithmsLatin squaresisotopiesfinite quasigroupspolynomial completenesspolynomially complete quasigroups

Mathematics Subject Classification ID

Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (10)

Format-preserving encryption: a survey ⋮ Unnamed Item ⋮ A massively parallel evolutionary algorithm for the partial Latin square extension problem ⋮ Квазигруппы и их приложения ⋮ Algebraic properties of subquasigroups and construction of finite quasigroups ⋮ Solving linear equations by fuzzy quasigroups techniques ⋮ Polynomially complete quasigroups of prime order ⋮ Automorphisms of finite quasi-groups without sub-quasi-groups ⋮ A historical perspective of the theory of isotopisms ⋮ Constructions of polynomially complete quasigroups of arbitrary order

Uses Software

• Edon80

Cites Work

• Modern Cryptography Primer
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.