A secret sharing scheme based on cellular automata

DOI10.1016/J.AMC.2005.01.026zbMath1083.94536OpenAlexW2095759561MaRDI QIDQ2573599

Yanyan Li

Publication date: 22 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.026

zbMATH Keywords

CryptographyDiscrete dynamical systemsThreshold scheme

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Authentication, digital signatures and secret sharing (94A62)

Related Items (16)

Exploring semi-bent Boolean functions arising from cellular automata ⋮ Permutation and sampling with maximum length CA or pseudorandom number generation ⋮ A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction ⋮ Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) ⋮ SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA ⋮ Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption ⋮ Secret Sharing Schemes for (k, n)-Consecutive Access Structures ⋮ Inversion of Mutually Orthogonal Cellular Automata ⋮ An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption ⋮ On the dynamical behaviour of linear higher-order cellular automata and its decidability ⋮ Hyperchaotic encryption based on multi-scroll piecewise linear systems ⋮ A verifiable multi-secret sharing scheme based on cellular automata ⋮ Secret image sharing based on cellular automata and steganography ⋮ Mutually orthogonal Latin squares based on cellular automata ⋮ Randomness quality of permuted pseudorandom binary sequences ⋮ A (2, n)-SECRET SHARING SCHEME BASED ON LINEAR CELLULAR AUTOMATA

Cites Work

• Random sequence generation by cellular automata
• An explication of secret sharing schemes
• An explicit similarity transform between cellular automata and LFSR matrices
• A \((t,n)\) multi-secret sharing scheme
• How to share a secret
• Analysis of Pseudo Random Sequences Generated by Cellular Automata
• ONE-DIMENSIONAL CELLULAR AUTOMATA WITH MEMORY: PATTERNS FROM A SINGLE SITE SEED
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A secret sharing scheme based on cellular automata