A cellular automaton (CA) has several
characterizations. Recently it has become a target for many
researchers. For this reason, A CA is applied in many fields:
building, modeling, computer applications and simulation of
several natural systems. CA characteristics refer to building
the mathematical in a CA construction. Thereby, these have
given CA an advanced possibility to be applied in wide
domains. Cryptography is important in the security domain
to reserve the citizen and military information from
unauthorized disclosing and modification. Therefore, this
paper presents a new block cryptosystem by using threedimensional
cellular automata (3-D CA), whereas the block
of data fill a 3-D CA cells. An updating process of cells values
of 3-D CA is based upon the neighbor cells and the selected
rules that will be applied in the calculating of the next state
for CA.
Dr. Abdulwasea M. Obaid Alezzani : graduated in Mathematics
and computer, college of science, Sana’a University in 1994, MSc
in Computer Science at Technology University in 2001, and PhD in
Computer Science at Technology University in 2004. Vice Dean of
computer center, Sana'a University from December 2006 to
September 2007. Vice Dean of the Faculty of Computer &
Information Technology (FCIT) for the Academic Affairs & Higher
Studies, Student Affairs, and computer center at Sana'a University,
from 22 Sep. 2007 to 29 Jan. 2010. Head of Quality Assurance
Unit at the FCIT at Sana'a University, July 2008 to Jan. 2010. Vice
Dean of the FCIT for the Student Affairs, from 30 Jan. 2010 to 22
May 2012. Head of Quality Assurance Unit at FCIT at Sana'a
University, June 2014 to Jan. 2016. Currently, vice manager of
Computer Center at Sana’a University from 23 Jan. 2016 till now. I
am teaching a graduate and MSc postgraduate programs in
Computer Science at FCIT. He has published three papers, the
research interests lie in computer science, computer and
information security. He has association with Professor Hilal
Mohammed Yousif Al-Bayatti, Professor Ghaleb H. Al-Gaphari,
and associate Professor Sharaf A. Alhomdy.
Professor Hilal Mohammed Yousif Al-Bayatti : graduated in
Mathematics-college of science, Baghdad University in 1970, MSc
in Computer Science at University College London, University of
London in 1977, and PhD in Computer Science at Loughborough
University of Technology in 1986. Professor Al-Bayatti promoted to
professor in 1998. He joined Applied Science University as Vice
President for Academic Affairs and Development in 2007, and as
Advisor to VP Academic and Development since September 2015
till now. He has published over 50 scientific papers and book
chapters. Professor Al-Bayatti acted as a peer reviewer, and a
member of editorial boards of many scientific journals. Professor
Al-Bayatti supervised over 60 PhD/MSc students to completion. As
an academic, professor Al-Bayatti research interests lie in
computer science, computer and information security.
CBIR
Feature Extraction
Bag of Words
A new cryptosystem that presented in this paper is
designed by using a non - uniform of 3-D CA. This
cryptosystem implement two primitive cryptographic
techniques. These are confusion and diffusion to conceal
the relationship between the key and ciphertext and the
characteristics of the plaintext language. A cryptosystem is
immune to a various of a cryptanalysis methods and
performs an encryption and decryption operations in
efficiency that referred to its absence from floating point
operations.
[1] P. Sarkar, S. Maitra “Efficient Implementation of
“Large” Stream Cipher Systems”, 2001.
[2] E. F. Codd, “Cellular Automata”, Academic Press, Inc.
New York and London 1968.
[3] M. J. B. Robshaw, “Stream Ciphers”, RSA
Laboratories Technical Report Tr-701, Version 2.0-
July 25, 1995.
[4] B. Schneier, “Applied Cryptography”, Jhon Wiley and
Sons Inc., second Edition, 1997.
[5] Peter Gutmann, "Cryptography and Data Security",
University of Auckland.
[6] Olu Lafe, ”Cellular Automata Transforms, Theory and
Applications in Multimedia Compression, Encryption,
and Modeling”, Kluwer Academic Publishers, 2000.
[7] P. P. Chaudhuri, D. R. Chowdhry, S. Nandi, and S.
Chattopadhay,”Additive Cellular Automata, Theory
and Applications”, Volume I, IEEE Computer Society,
1997.
[8] Tim Tyler, “Cellular Automata”, http://cellauto.
com/largeinverse.
[9] http://www.alife.co.uk/ca
[10] A. M. Alazzani, ”a proposed block cipher system
Based on Three-Dimensional Cellular Automata”, PhD
thesis in Computer Science, Informatics Institute for
Postgraduate studies, University of Technology, 2004.
[11] Feng Bao, “Cryptanalysis of A New Cellular Automata
Cryptosystem”, Institute for Information Research,
Sengapore, 2002.
[12] S. Wolfram, “Cryptography With Cellular Automata”,
Institute for Advanced study, 1985.
[13] J. Kari, ”Cryptosystem Based on Reversible Cellular
Automata”, Mathematics Department, University of
Turku, Finland, April 16, 1992.
[14] S. Nandi, B. K. Kar, and P. P. Chadhuri,”Theory and
Applications of Cellular Automata in Cryptography”,
IEEE Transaction on Computers, Vol.43, No. 12,
December 1994.
[15] S. Nandi, B. K. Kar, and P. P. Chadhuri,”Theory and
Applications of Cellular Automata in Cryptography”,
IEEE Transaction on Computers, Vol.43, No. 12,
December 1994.
[16] H. Gutowitz, “Cryptography With Dynamical Sytems”,
ESPCI,Laboratoire d’Electronque, Paris, France, 1995.
[17] Sheng-Uei Guan and Shu Zhang,”An Encryption
Method Based on Dynamical Cellular Automata”,
Department of Electrical Engineering, National
University of Singapore, 2000. [18] Olu Lafe, “Data Compersion And Encryption Using
Cellular Automata Transforms”, Lafe
Technologies,USA, 1997.
[19] J. Urias, E. Ugalde, and G. Salazar, “A Cryptosystem
Based on Cellular Automata”, Mexico, 14 September
1998.
[20] Chunren Lai, “High-Spead Cellular–Automata Based
Block Cipher and Fault Tolerant Public-Key
Cryptosystems”, M. Sc. thesis, Department of
Computer Science, University of Regina 2000.
[21] M. Tomassini, M. Sipper, and M. Perrenoud “On the
Generation of High-Quality Random Numbers by Two-
Dimensional Cellular Automata”, IEEE Trans. on
Computers, v. 49, No. 10, October 2000, pp. 1140-
1151.
[22] M. Tomassini and M. Perrenoud, “Stream Ciphers with
One- and Two-Dimensional Cellular Automata”, in M.
Schoenauer at al. (Eds.) Parallel Problem Solving from
Nature - PPSN VI, LNCS 1917, Springer, (2000) 722-
731.
[23] M. Tomassini and M. Perrenoud, “Cryptography With
Cellular Automata”, Institute of Computer Science,
University of Lausanne, 1015 Lausanne, Switzerland, 4
July 2001.
[24] S. S. Essa.”Key Stream Generation Using Cellular
Automata”, M.Sc. thesis, Department of Computer
Science and Information Systems, University of
Technology, 2001.
[25] S. Sen, C. Shaw, D. R. Chowdhuri, N. Ganguly, and P.
P. Chaudhuri,” Cellular Automata Based Cryptosystem
(CAC)”, Computer Center, Calcutta, Indian, 2000.
[26] F. Seredynski, P. Bouvery, and A. Y. Zayama, ”Secret
Key Cryptography with Cellular Automata”, in
IPDPS’03/NIDISC, Nice (France), April 2003.
[27] F. Seredynski, P. Bouvery, and A. Y. Zayama,
”Cellular Programming and Symmetric Key
Cryptography Systems”, GECCO conference,
Published by Springer in LNCS, Chicago, USA, July
2003.
[28] M. Alfoseca and A. Ortegaa, “Representation of some
Cellular Automata by Means of Equivalent L Systems”,
Madrid, Spain, 2000.
[29] S. Wolfram, “A New Kind Of Science”, Wolfram
Media Inc., 2002.
