Cryptographic Puzzles and Complex Systems

2001

Cryptosystems for binary information are based on two primitives: an indexed family of permutations of binary words and a generator of pseudorandom sequences of indices. A very efficient implementation of the primitives is constructed using the phenomenon of synchronization in cellular automata.

New cryptographic hash functions based on cellular automaton have been proposed in the last years . Most of this algorithms are based on the well-known Merkle-Damgård construction . I investigated the possibility to use a complete different approach in order to generate new cryptographic hash functions with the use of simple cellular automaton in the spirit of NKS ("Simple rules can produce complex behavior" S.Wolfram). In order to prove the quality of the proposed cryptographic hash functions i used the standard Avalanche and Collision Tests [1,2].

Informatics Control Measurement in Economy and Environment Protection, 2018

Software solution for cryptographic hash functions based on sponge construction with inner state implemented as two-dimensional cellular automata (CA) has been developed. To perform pseudorandom permutation in round transformation function several combinations of CA rules 30, 54, 86, 150 and 158 have been proposed. The developed hashing mechanism provides effective parallel processing, ensures good statistical and scattering properties, enables one to obtain hash of a varying length and reveals strong avalanche effect.

This paper presents a symmetric key cryptography technique that uses cellular automata(CA). Proposed cryptosystem has been implemented in C. State transitions of programmable cellular automata (PCA) are the basis to define certain fundamental transformations to encrypt and decrypt in the cryptographic system. Different rule configurations are used to form group cellular automata that would be used in encryption and decryption.

ACM Computing Surveys, 2021

Cryptographic algorithms have been used not only to create robust ciphertexts but also to generate cryptograms that, contrary to the classic goal of cryptography, are meant to be broken. These cryptograms, generally called puzzles, require the use of a certain amount of resources to be solved, hence introducing a cost that is often regarded as a time delay—though it could involve other metrics as well, such as bandwidth. These powerful features have made puzzles the core of many security protocols, acquiring increasing importance in the IT security landscape. The concept of a puzzle has subsequently been extended to other types of schemes that do not use cryptographic functions, such as CAPTCHAs, which are used to discriminate humans from machines. Overall, puzzles have experienced a renewed interest with the advent of Bitcoin, which uses a CPU-intensive puzzle as proof of work. In this article, we provide a comprehensive study of the most important puzzle construction schemes avail...

International Journal of Computing

This paper deals with the development of two symmetric encryption algorithms on the basis of cellular automata: a block cipher, that is based on AES and uses three-dimensional cellular automata; a stream cipher, that exploits a hardware-software entropy generation (tracking of keystrokes and mouse pointer movement), as well as the developed hash function, based on “cryptographic sponge” architecture of SHA-3, modified by cellular automata transformations. The block cipher is designed in architecture of SP-network and uses the AES substitution block. Permutation layer and key generation is designed on the basis of cellular automata rules (rules “22”, “105” and “150”). The optimal number of rounds to achieve maximum crypto resistance is determined. The stream cipher is designed on the basis of hardware-software entropy generation and uses the cryptographic hash-function in the SHA-3 architecture. Permutation function is developed on the basis of cellular automata rules (rules “30” and...

2004

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 (PNS) 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.

IEEE Transactions on Computers, 1994

This paper deals with the theory and application of Cellular Automata (CAI for a class of block ciphers and stream ciphers. Based on CA state transitions certain fundamental transformations are defined which are block ciphering functions of the proposed enciphering scheme. These fundamental transformations are found to generate the simple (alternating) group of even permutations which in turn is a subgroup of the permutation group. These functions are implemented with a class of programmable cellular automata (PCA) built around rules 51, 153, and 195. Further, high quality pseudorandom pattern generators built around rule 90 and 150 programmable cellular automata with a rule selector (Le., combining function) has been proposed as running key generators in stream ciphers. Both the schemes provide better security against different types of attacks. With a simple, regular, modular and cascadable structure of CA, hardware implementation of such schemes idealy suit for VLSI implementation.

Lecture Notes in Computer Science, 1998

One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular automata whose cryptographic properties have been extensively studied over the past decade or so. Furthermore, security of the proposed one-way hash function is analyzed by the use of very recently published results on applications of cellular automata in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. An important feature of the proposed one-way hash function is that it is especially suitable for compact and fast implementation in hardware, which is particularly attractive to emerging security applications that employ smart cards, such as digital identification cards and electronic cash payment protocols,

Lecture Notes in Computer Science, 2004

International Journal of Electrical and Computer Engineering (IJECE), 2023

The cryptographic hash functions are the most fundamental cryptographic concept. These functions are used as basic building blocks for digital signatures and message authentication. Boolean functions are the core of hash functions. These functions are expected to provide pseudo-randomness as well as input sensitivity. Cellular automata are a form of Boolean function that exhibits strong cryptography properties as well as chaotic behavior. This paper proposes a hash function, designed on the principle of cellular automata. The proposed algorithm is secure and meets the requirements for a successful hashing scheme. The hash function has strong statistical and cryptographic characteristics, according to the findings of the avalanche test and the National Institute of Standards and Technology (NIST) Statistical Test Suite. The modularity of different operations of this algorithm makes it suitable for a high-capacity processing environment to produce efficient performance.

Advances in Intelligent Systems and Computing

Hash functions serve as the fingerprint of a message. They also serve as an authentication mechanism in many applications. Nowadays, hash functions are widely used in blockchain technology and bitcoins. Today, most of the work concentrates on the design of lightweight hash functions which needs minimal hardware and software resources. This paper proposes a lightweight hash function which makes use of Cellular Automata (CA) and sponge functions. This hash function accepts arbitrary length message and produces fixed size hash digest. An additional property of this function is that the size of the hash digest may be adjusted based on the application because of the inherent property of varying length output of sponge function. The proposed hash function can be efficiently used in resource constraint environments in a secure and efficient manner. In addition, the function is resistant to all known generic attacks against hash functions and is also preimage resistant, second preimage resistant and collision resistant.

2003

Abstract The paper presents new results concerning application of cellular automata (CA) to secret key cryptography extending results presented in Tomassini and Perrenoud (2000), and Tomassini and Sipper (2000). One dimensional, nonuniform CA is considered as a generator of pseudorandom number sequences (PNS) used in cryptography with the secret key. The quality of PNS highly depends on a set of applied CA rules. To find such rules nonuniform CA with two types of rules is considered.

Acta Applicandae Mathematicae, 2006

In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear sequence generators has been modelled in terms of linear cellular automata. The algorithm that converts the given generator into a linear model based on automata is very simple and is based on the concatenation of a basic structure. Once the generator has been linearized, a cryptanalytic attack that exploits the weaknesses of such a model has been developed. Linear cellular structures easily model sequence generators with application in stream cipher cryptography.

International Journal of Applied Metaheuristic Computing, 2017

Cryptanalysis refers to finding the plaintext from the given cipher text. The problem reduces to finding the correct key from a set of possible keys, which is basically a search problem. Many researchers have put in a lot of effort to accomplish this task. Most of the efforts used conventional techniques. However, soft computing techniques like Genetic Algorithms are generally good in optimized search, though the applicability of such techniques to cryptanalysis is still a contentious point. This work carries out an extensive literature review of the cryptanalysis techniques, finds the gaps there in, in order to put the proposed technique in the perspective. The work also finds the applicability of Cellular Automata in cryptanalysis. A new technique has been proposed and verified for texts of around 1000 words. Each text is encrypted 10 times and then decrypted using the proposed technique. The work has also been compared with that employing Genetic Algorithm. The experiments carrie...