A secret sharing scheme based on cellular automata

被引：53

作者：

del Rey, AM

Mateus, JP

Sánchez, GR

机构：

[1] Univ Salamanca, Dept Appl Math, Avila 05003, Spain

[2] Tech Univ Guarda, Dept Math, P-6300 Guarda, Portugal

[3] Univ Salamanca, Dept Appl Math, Zamora 49022, Spain

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2005年 / 170卷 / 02期

关键词：

cellular automata; cryptography; discrete dynamical systems; secret sharing; threshold scheme;

D O I：

10.1016/j.amc.2005.01.026

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A new secret sharing scheme based on a particular type of discrete delay dynamical systems: memory cellular automata, is proposed. Specifically, Such scheme consists of a (k, n)-threshold scheme where the text to be shared is considered as one of the k initial conditions of the memory cellular automata and the n shares to be distributed are n consecutive configurations of the evolution Of Such cellular automata. It is also proved to be perfect and ideal. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：1356 / 1364

页数：9

共 20 条

[1]

Alonso-Sanz R., 2003, Complex Systems, V14, P99

[2] One-dimensional cellular automata with memory:: Patterns from a single site seed [J].

Alonso-Sanz, R ;

Martín, M .

INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2002, 12 (01) :205-226

[3]

[Anonymous], 2002, CRYPTOGRAPHY THEORY

[4]

BARDELL PH, 1990, PROCEEDINGS : INTERNATIONAL TEST CONFERENCE 1990, P762, DOI 10.1109/TEST.1990.114093

[5]

Blakley G.R., 1979, P 1979 AFIPS NAT COM, V48, P313, DOI [10.1109/MARK.1979.8817296, DOI 10.1109/MARK.1979.8817296]

[6]

Cattell K., 1998, Finite Fields and their Applications, V4, P239, DOI 10.1006/ffta.1998.0212

[7]

Guan P., 1987, Complex Systems, V1, P51

[8]

GUTOWITZ H, 1993, NATO ADV SCI INST SE, V396, P237

[9]

Hernández-Encinas L, 2002, 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL I, PROCEEDINGS, P471

[10]

LEN RD, 2003, INT J PURE APPL MATH, V4, P87

← 1 2 →