Cellular automata computations and secret key cryptography

被引：84

作者：

Seredynski, F

Bouvry, P

Zomaya, AY

机构：

[1] Polish Japanese Inst Informat Technol, PL-02008 Warsaw, Poland

[2] Polish Acad Sci, Inst Comp Sci, PL-01237 Warsaw, Poland

[3] Luxembourg Univ 6, Fac Sci Technol & Commun, L-1359 Luxembourg, Luxembourg

[4] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia

来源：

PARALLEL COMPUTING | 2004年 / 30卷 / 5-6期

关键词：

cellular automata; cellular programming; random number generators; symmetric key cryptography; Vernam cipher;

D O I：

10.1016/j.parco.2003.12.014

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, cellular automata (CAs) are used to design a symmetric key cryptography system based on Vernam cipher. CAs are applied to generate a pseudo-random numbers sequence (FINS) which is used during the encryption process. The quality of PNSs highly depends on the set of applied CA rules. Rules of radius r = 1 and 2 for nonuniform one-dimensional CAs have been considered. A new set of rules has been discovered using an evolutionary technique called cellular programming. This set provides very high quality encryption, and the system is very resistant to attempts of breaking the cryptography key. (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：753 / 766

页数：14

共 16 条

[1]

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

[2]

GUTOWITZ H, 1993, CELLULAR AUTOMATA CO

[3]

HABUTSU T, 1991, P EUR 91, P127

[4] PARALLEL RANDOM NUMBER GENERATION FOR VLSI SYSTEMS USING CELLULAR AUTOMATA [J].

HORTENSIUS, PD ;

MCLEOD, RD ;

CARD, HC .

IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (10) :1466-1472

[5]

Kari J., 1992, COMMUNICATION

[6]

Knuth D. E., 1981, SEMINUMERICAL ALGORI, V1

[7]

MARSAGLIA G, 1998, DIEHARD

[8]

Menezes AJ., 1997, HDB APPL CRYPTOGRAPH

[9]

MROCZKOWSKI A, 2002, THESIS WARSAW U TECH

[10] THEORY AND APPLICATIONS OF CELLULAR-AUTOMATA IN CRYPTOGRAPHY [J].

NANDI, S ;

KAR, BK ;

CHAUDHURI, PP .

IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (12) :1346-1357

← 1 2 →