Cellular Automaton Public-Key Cryptosystem
نویسنده
چکیده
A public-key cryptosystem based on inhomogeneous cellu lar automata is prop osed . The running time of all known algorithms for br eaking t he system grows exponenti ally with the cipher block length.
منابع مشابه
A Cryptosystem Based on the Composition of Reversible Cellular Automata
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 ce...
متن کاملCryptosystems Based on Reversible Cellular Automata
We propose the use of reversible cellular automata (RCA) as eecient encryp-tion and decryption devices. The eeciency is due to their inherent parallelism. They can be used both as classical secret-key cryptosystems and as public-key systems.
متن کاملA New Iterative Secret Key Cryptosystem Based on Reversible and Irreversible Cellular Automata
Many cryptosystems have been released to secure electronic data on internet. Some data are very critical to be transmitted as plaintext. Thus, to ensure the data confidentiality and integrity, a list of cryptosystems have been elaborated. The most important ones are divided into two categories: symmetric algorithms encrypting and decrypting data in blocks using a single secret key; and asymmetr...
متن کاملColor Image Encryption by Cellular Automata
This paper presents a proposed cryptosystem to encrypt color images using cellular automata. A reversible cellular automaton has the characteristic of being able to return in the evolution of the automata, and is therefore, that in this paper are used to generate a symmetric key used to encrypt images.
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 1 شماره
صفحات -
تاریخ انتشار 1987