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

DOI10.1016/J.DAM.2015.06.033zbMATH Open1448.94198OpenAlexW1908044368MaRDI QIDQ5117055FDOQ5117055

Authors: M. M. Glukhov 

Publication date: 20 August 2020

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

Full work available at URL: http://mathnet.ru/eng/pdm29

Recommendations

• Some applications of quasigroups in cryptology
• An application of quasigroups in cryptology
• Quasigroups in cryptology
• Applications of quasigroups to cryprography
• scientific article; zbMATH DE number 1931056
• An application of quasigroups in constructing secure cipher text
• Quasigroups and rings in coding theory and cryptography
• Some applications of arithmetic groups in cryptography
• Cryptographic primitives with quasigroup transformations
• Design of crypto primitives based on quasigroups

zbMATH Keywords

one-way functionsciphersapplications of quasigroupsconstruction of authentication codes

Mathematics Subject Classification ID

Cryptography (94A60) Loops, quasigroups (20N05) Authentication, digital signatures and secret sharing (94A62)

Cited In (30)

• Constructions of polynomially complete quasigroups of arbitrary order
• Applications of quasigroups to cryprography
• Strong polynomial completeness of almost all quasigroups
• Orthomorphisms of abelian groups with minimum possible pairwise distances
• Hypergroupoids and cryptosystems
• Hyperidentities and related concepts. II
• Automata over finite T-quasigroups
• Обобщенные квази-адамаровы преобразования на конечных группах
• Nilpotent algebras, implicit function theorem, and polynomial quasigroups
• Title not available (Why is that?)
• Algorithms for checking some properties of \(n\)-quasigroups
• Format-preserving encryption: a survey
• Efficient verification of polynomial completeness of quasigroups
• A criterion of properness for a family of functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Application of non-associative structures to the construction of public key distribution algorithms
• Fractal magmas and public-key cryptography
• Title not available (Why is that?)
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
• The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of abelian groups
• The complexity of checking the polynomial completeness of finite quasigroups
• Properties of proper families of Boolean functions
• Minimal degrees of invariants of (super)groups – a connection to cryptology
• Quasigroups and their applications
• One-to-one correspondense between proper families of Boolean functions and unique sink orientations of cubes
• Title not available (Why is that?)
• Latin squares over quasigroups
• Polynomially complete quasigroups of prime order
• Automata over abstract finite quasigroups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117055)