A fast cryptosystem using reversible cellular automata

Abstract

This article defines a new algorithm for a secret key cryptosystem using cellular automata which is a promising approach to cryptography. Our algorithm is based on cellular automata built on a set of reversible rules which have the ability to construct unpredictable secret keys using MARGOLUS neighborhood. To prove the feasibility of the algorithm, we present some tests of encryption, decryption and diffusion; a CPU time comparison with an encryption algorithm by blocks as for instance AES-256 is established. On the other hand, the security of the algorithm is proved and the implemented algorithm resists against a brute force attack.

Authors and Affiliations

Said BOUCHKAREN, Saiida LAZAAR

Keywords

Related Articles

A Proposed Textual Graph Based Model for Arabic Multi-document Summarization

Text summarization task is still an active area of research in natural language preprocessing. Several methods that have been proposed in the literature to solve this task have presented mixed success. However, such meth...

Improvement of Brain Tissue Segmentation Using Information Fusion Approach

The fusion of information is a domain of research in full effervescence these last years. Because of increasing of the diversity techniques of images acquisitions, the applications of medical images segmentation, in whic...

Improving Video Streams Summarization Using Synthetic Noisy Video Data

For monitoring public domains, surveillance camera systems are used. Reviewing and processing any subsequences from large amount of raw video streams is time and space consuming. Many efficient approaches of video summar...

Cloud Based Public Collaboration System in Developing Countries

Governments in developing countries are increasingly making efforts to provide more access to information and services for citizens, businesses, and civil servants through smart devices. However, providing strategically...

Value-Driven use Cases Triage for Embedded Systems: A Case Study of Cellular Phone

A well-defined and prioritized set of use cases enables the enhancement of an entire system by focusing on more important use cases identified in the previous iteration. These use cases are given more opportunities to be...

Download PDF file
  • EP ID EP157715
  • DOI 10.14569/IJACSA.2014.050531
  • Views 92
  • Downloads 0

How To Cite

Said BOUCHKAREN, Saiida LAZAAR (2014). A fast cryptosystem using reversible cellular automata. International Journal of Advanced Computer Science & Applications, 5(5), 207-210. https://europub.co.uk/articles/-A-157715