Generation of proper families of functions
From MaRDI portal
Publication:2172878
Recommendations
Cites work
- A novel cryptosystem based on abstract automata and Latin cubes
- Algorithms for checking some properties of \(n\)-quasigroups
- An algorithm for checking the existence of subquasigroups
- Efficient verification of polynomial completeness of quasigroups
- Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes
- Generating uniformly distributed random latin squares
- Generation of multivariate quadratic quasigroups by proper families of Boolean functions
- Introduction to probability models
- Latin squares over quasigroups
- Nonassociative algebraic structures in cryptography and coding
- On the use of binary operations for the construction of a multiply transitive class of block transformations
- One-to-one correspondense between proper families of Boolean functions and unique sink orientations of cubes
- Quasigroups in cryptology
- The complexity of recognizing unique sink orientations
- The number of unique-sink orientations of the hypercube
- Using binary operations to construct a transitive set of block transformations
Cited in
(5)- Matrices and graphs of essential dependence of proper families of functions
- Proper families of functions and their applications
- A criterion of properness for a family of functions
- Generation of n-quasigroups by proper families of functions
- The school of V. B. Kudryavtsev at the chair of mathematical theory of intelligent systems: traditions and development
This page was built for publication: Generation of proper families of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172878)