SHARING SECRETS USING ELEMENTARY CELLULAR AUTOMATA

A. Martín Del Rey () and G. Rodríguez Sánchez ()
Additional contact information
A. Martín Del Rey: Department of Applied Mathematics, E. P. S. de Ávila, Universidad de Salamanca, C/Hornos Caleros 50, 05003-Ávila, Spain
G. Rodríguez Sánchez: Department of Applied Mathematics, E. P. S. de Zamora, Universidad de Salamanca, Avda. Requejo 33, 49022-Zamora, Spain

International Journal of Modern Physics C (IJMPC), 2007, vol. 18, issue 11, 1707-1716

Abstract: In this paper, a new cryptographic protocol to securely share a secret among a set of participants is presented. It is based on the use of non-reversible elementary cellular automata with rule numbers 90 and 150. The protocol is shown to be perfect and ideal.

Keywords: Elementary cellular automata; secret sharing; threshold schemes; cryptography; 05.65.+b; 89.70.+c; 89.75.-k (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183107011613
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:18:y:2007:i:11:n:s0129183107011613

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183107011613

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().