Pages that link to "Item:Q2573599"
From MaRDI portal
The following pages link to A secret sharing scheme based on cellular automata (Q2573599):
Displayed 16 items.
- Hyperchaotic encryption based on multi-scroll piecewise linear systems (Q670799) (← links)
- Secret image sharing based on cellular automata and steganography (Q733203) (← links)
- Exploring semi-bent Boolean functions arising from cellular automata (Q831678) (← links)
- Permutation and sampling with maximum length CA or pseudorandom number generation (Q870167) (← links)
- A verifiable multi-secret sharing scheme based on cellular automata (Q991230) (← links)
- Randomness quality of permuted pseudorandom binary sequences (Q1005204) (← links)
- A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction (Q1666751) (← links)
- On the dynamical behaviour of linear higher-order cellular automata and its decidability (Q2215107) (← links)
- Mutually orthogonal Latin squares based on cellular automata (Q2291667) (← links)
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860) (← links)
- SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA (Q3500226) (← links)
- A (2, n)-SECRET SHARING SCHEME BASED ON LINEAR CELLULAR AUTOMATA (Q3631062) (← links)
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption (Q6064475) (← links)
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures (Q6104673) (← links)
- Inversion of Mutually Orthogonal Cellular Automata (Q6163604) (← links)
- An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption (Q6179977) (← links)