Random sequence generation by cellular automata
Advances in Applied Mathematics
Cellular Automata Based Authentication (CAA)
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Distributed fault detection of wireless sensor networks
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
An Efficient Design of Cellular Automata Based Cryptographically Robust One-Way Function
VLSID '07 Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems
Behaviors of single attractor cellular automata over galois field GF(2p)
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
An efficient test design for CMPs cache coherence realizing MESI protocol
VDAT'12 Proceedings of the 16th international conference on Progress in VLSI Design and Test
| Hi-index | 0.00 |
The single attractor cellular automata (SACA) is of prime interest in devising schemes for different applications specially in authentication and cryptography. The synthesis of SACA in linear/additive domain has been proposed in literature. This work reports characterization of such a special class of CA beyond linear domain. The characterization is based on the analysis of individual CA rule and its potential to form the single length cycle attractors (point states). The proposed characterization targets design of a CA based scheme for detection of faulty nodes in a wireless sensor network. It enables identification of faults even in multiple nodes with out major computation overhead.