A Cryptosystem Based on the Composition of Reversible Cellular Automata

被引：4

作者：

Clarridge, Adam ^{[1
]}

Salomaa, Kai ^{[1
]}

机构：

[1] Queens Univ, Kingston, ON, Canada

来源：

LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS | 2009年 / 5457卷

关键词：

D O I：

10.1007/978-3-642-00982-2_27

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We conclude with a discussion on security and practical considerations for the cryptosystem and give several ideas for future work.

引用

页码：314 / 325

页数：12

共 15 条

[1]

Amoroso S., 1972, Journal of Computer and System Sciences, V6, P448, DOI 10.1016/S0022-0000(72)80013-8

[2]

ANGHELESCU P, 2007, HIS 2007, P132

[3] MARKER AUTOMORPHISMS OF THE ONE-SIDED D-SHIFT [J].

ASHLEY, J .

ERGODIC THEORY AND DYNAMICAL SYSTEMS, 1990, 10 :247-262

[4]

Charbouillot S, 2006, IEEE I C ELECT CIRC, P1232

[5]

CLARRIDGE A, 2008, 2008549 QUEENS U SCH

[6]

Franti E, 2005, CAS 2005: INTERNATIONAL SEMICONDUCTOR CONFERENCE, V1-2, P463

[7]

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

[8]

Gutowitz HA, 1994, US Patent, Patent No. [5,365,589, 5365589]

[9] REVERSIBILITY AND SUBJECTIVITY PROBLEMS OF CELLULAR-AUTOMATA [J].

KARI, J .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 48 (01) :149-182

[10]

Kari J., 1992, Cryptosystems based on reversible cellular automata

← 1 2 →