SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA

DOI10.1142/S0129183107011613zbMath1170.94340MaRDI QIDQ3500226

No author found.

Publication date: 3 June 2008

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

zbMATH Keywords

cryptographysecret sharingthreshold schemeselementary cellular automata

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A (2, n)-SECRET SHARING SCHEME BASED ON LINEAR CELLULAR AUTOMATA

Cites Work

• Unnamed Item
• Modelling nonlinear sequence generators in terms of linear cellular automata
• Inverse rules of ECA with rule number 150
• Tesselations with local transformations
• A secret sharing scheme based on cellular automata
• How to share a secret
• On secret sharing systems
• ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA

This page was built for publication: SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA