In the implementation of Radio Frequency Identification (RFID) systems concerns have been raised regarding information security and violations of end-user privacy. There is a large collection of literature available on efficient and inexpensive cryptographic engines, but they are still extravagant solutions for low cost RFID systems. Security and privacy provided by low cost RFID is both directly and indirectly limited by a number of factors that are unique to low cost RFID. This paper examines security and privacy issues regarding RFID and presents the challenges that arise in view of the unique environment presented by low cost RFID systems.

A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computation with the help of only local information. Researchers, scientists and practitioners from different fields have exploited the CA paradigm of local information, decentralized control and universal computation for modeling different applications. This article provides a survey of available literature of some of the methodologies employed by researchers to utilize cellular automata for modeling purposes. The survey introduces the different types of cellular automata being used for modeling and the analytical methods used to predict its global behavior from its local configurations. It further gives a detailed sketch of the efforts undertaken to configure the local settings of CA from a given global situation; the problem which has been traditionally termed as the inverse problem. Finally, it presents the different fields in which CA have been applied. The extensive bibliography provided with the article will be of help to the new entrant as well as researchers working in this field.

The cipher systems based on Cellular Automata proposed by Nandi et al. [3] are affine and are insecure. Index Terms --- Cryptography, block ciphers, stream ciphers, cellular automata, affine group. This author's research supported by EPSRC Research Grant No. GR/H23719. y This author acknowledges the support of the Nuffield Foundation z This author's research supported by a Lloyd's of London Tercentenary Foundation Research Fellowship. In [3], the authors present cryptographic transformations based on Cellular Automata. These transformations are used to define block ciphers and stream ciphers. It is claimed that the cryptographic transformations generate the alternating group and that the cryptosystems are secure. Both of these claims are incorrect. The systems in [3] are based on permutations of the vector space VN of dimension N over GF (2). These permutations are obtained from Cellular Automata. The specific permutations used (called fundamental transformations in [3]) are...

Abstract. One-way hash functions are an important toolinachieving authentication and data integrity. The aim of this paper is to propose anovel one-way hash function based on cellular automata whose cryptographic properties have been extensivelystudiedover 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 asdigital identi cation cards and electronic cash payment protocols, 1

this paper, a low-complexity Programmable Cellular Automata (PCA) based versatile modular multiplier in GF(2 ) is presented. The proposed versatile multiplier increases flexibility in using the same multiplier in different security environments, and it reduces the user's cost. Moreover, the multiplier can be easily extended to high order of m for more security, and low-cost serial implementation is feasible in restricted computing environments, such as smart cards and wireless devices

evaluate the randomness of these CCA PRNGs. The results show that their randomness is better than that of conventional CA and PCA PRNGs while they do not lose the structure simplicity of 1-d CA. Moreover, their randomness can be comparable to that of 2-d CA PRNGs. Furthermore, we integrate six different types of CCA PRNGs to form CCA PRNG groups to see if the randomness quality of such groups could exceed that of any individual CCA PRNG. Genetic Algorithm (GA) is used to evolve the configuration of the CCA PRNG groups. Randomness test results on the evolved CCA PRNG groups show that the randomness of the evolved groups is further improved compared with any individual CCA PRNG. Key words: cellular automata, randomness test, pseudorandom number generator, genetic algorithm

Abstract A novel Cellular Automata (CA) ⎯ Controllable CA (CCA) is proposed in this paper. Further, CCA are applied in Pseudorandom Number Generation. Randomness test results on CCA Pseudorandom Number Generators (PRNGs) show that they are better than 1-d CA PRNGs and can be comparable to 2-d ones. But they do not lose the structure simplicity of 1-d CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired. Key words: cellular automata, randomness test, pseudorandom number generator, controllable, hybrid 1.

In this paper, we analyze attraction properties of elementary (i.e. Boolean, one-dimensional, bi-infinite) cellular automata (for short, CA). To overcome the well-known undecidability constraints met by these systems, in addition to the classical extensive use of computer simulations, we introduce composition: we first characterize basis CA, which we then use as building blocks to understand a whole family of CA-based systems obtained by composing them using logic disjunction. The compositional approach allows deep structured investigations, and it permits to define a new notion of dynamical complexity. 1 Experimental analysis of cellular automata Cellular automata. Cellular automata (for short, CA) are massively parallel systems obtained by composition of myriads of simple agents interacting locally, i.e. with their closest neighbors. In spite of their simplicity, the dynamics of CA is potentially very rich, and ranges from attracting stable configurations to spatio-temporal ...

Abstract—In this paper, we have proposed a novel blind watermarking architecture towards its hardware implementation in VLSI. In order to facilitate this hardware realization, cellular automata (CA) concept is introduced. The CA has been already accepted as an attractive structure for VLSI implementation because of its modularity, parallelism, high performance and reliability. The hardware realizable multiresolution spread spectrum watermarking techniques are very few in numbers in spite of their best ever resiliency against signal impairments. This is because of the computational cost and complexity associated with their different filter banks and lifting techniques. The concept of cellular automata theory in order to form a new transform domain technique i.e. Cellular Automata Transform (CAT) have been incorporated. Since CA provides spreading sequences having very low cross-correlation properties, the CA based pseudorandom sequence generator is considered in the present work. Considering the watermarking technique as a digital communication process, an error control coding (ECC) must be incorporated in the data hiding schemes. Besides the hardware implementation of entire CA based data hiding technique, the individual blocks of the algorithm using CA provide the best result than that of some other methods irrespective of the hardware and software technique. The Cellular Automata Transform, CA based PN sequence generator, and CA ECC are the requisite blocks that are developed not only to meet the reliable hardware requirements but also for the basic spread spectrum watermarking features. The proposed algorithm shows statistical invisibility and resiliency against various common signal-processing operations. This algorithmic design utilizes the existing allocated bandwidth in the data transmission channel in a more efficient manner.

We propose a lightweight block cipher that supports 128bit block size with 128-, 192- and 256-bit keys, to confirm with the Advanced Encryption Standard (AES) specification. All components of LCASE are chosen to be cellular automata-based so as to achieve higher parallelism and simplify the implementation. Apart from that, the other virtues of LCASE are its high speed and cheap cost along with being resistant against timing analysis attacks.