Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
From MaRDI portal
Publication:5117055
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
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
- Automata over finite T-quasigroups
- Hyperidentities and related concepts. II
- Обобщенные квази-адамаровы преобразования на конечных группах
- Algorithms for checking some properties of \(n\)-quasigroups
- Nilpotent algebras, implicit function theorem, and polynomial quasigroups
- Efficient verification of polynomial completeness of quasigroups
- Format-preserving encryption: a survey
- A criterion of properness for a family of functions
- scientific article; zbMATH DE number 1931056 (Why is no real title available?)
- scientific article; zbMATH DE number 7312512 (Why is no real title available?)
- Application of non-associative structures to the construction of public key distribution algorithms
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
- Fractal magmas and public-key cryptography
- scientific article; zbMATH DE number 7310171 (Why is no real title available?)
- The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of abelian groups
- Quasigroups generated by shift registers and Feistel networks
- 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
- scientific article; zbMATH DE number 1929306 (Why is no real title available?)
- 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)
