Application of ternary quasigroups to string processing
From MaRDI portal
Cites work
- 10.17686/sced_rusnauka_2008-1040
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
- scientific article; zbMATH DE number 4171233 (Why is no real title available?)
- scientific article; zbMATH DE number 3775602 (Why is no real title available?)
- scientific article; zbMATH DE number 3442309 (Why is no real title available?)
- scientific article; zbMATH DE number 6288955 (Why is no real title available?)
- scientific article; zbMATH DE number 3340244 (Why is no real title available?)
- scientific article; zbMATH DE number 3397673 (Why is no real title available?)
- scientific article; zbMATH DE number 7826074 (Why is no real title available?)
- Nonassociative algebraic structures in cryptography and coding
This page was built for publication: Application of ternary quasigroups to string processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295220)