In this paper, a decimal first degree cellular automata (FDCA) based clustering algorithm is proposed where clusters are created based on reachability. Cyclic spaces are created and configurations which are in the same cycle are treated as the same cluster. Here, real-life data objects are encoded into decimal strings using Gödel number based encoding. The benefits of the scheme is, it reduces the encoded string length while maintaining the features properties. Candidate CA rules are identified based on some theoretical criteria such as self-replication and information flow. An iterative algorithm is developed to generate the desired number of clusters over three stages. The results of the clustering are evaluated based on benchmark clustering metrics such as Silhouette score, Davis Bouldin, Calinski Harabasz and Dunn Index. In comparison with the existing state-of-the-art clustering algorithms, our proposed algorithm gives better performance.

This paper discusses the potentiality of Cellular Automata (CAs) represented by first degree equations as source of randomness. These CAs are identified by eight constants, named as Parameters of First Degree CA. A greedy filtering technique is developed that uses existing chaotic parameters to identify the candidate CAs. Based on a theoretical strategy and experimental verification, a list of good first degree CA parameters are identified which remains as excellent source of randomness irrespective of change in number of states. Finally, we use these CAs as pseudo-random number generators.

Two cellular automata (CAs) are said to be isomorphic if their respective configuration transition diagrams are isomorphic. In this paper, we propose two schemes to determine the set of CAs that are isomorphic to any given cellular automaton (CA). Our first procedure works by permutation of the states of a set of cell positions of the CA. This methodology can be applied to generate at most $$(d!)^n -1$$ isomorphic cellular automata each of which will maintain the same neighborhood as the given n-cell d-state CA. Whereas, our second procedure does an exchange of the cells at different positions; we show that the isomorphic cellular automata generated in this manner may have larger neighborhood than the input CA, depending on the range of cell positions exchanged. An extensive experimentation has been done to establish the efficacy of our schemes.

An internet is backbone of all kind of communication such as unicast, broadcast and multicast, as multicast communication is more efficient because it provide a better communication than unicast and broadcast in the context of bandwidth utilization. The multicast communication is popular in the area of audio-conferencing, video-conferencing and data distribution. There are several schemes such as hashing technique, tree based Hashing and Hash tree signing technique. These schemes have a lot of issues like communication cost, hash computation technique. Aim of this work is to compute the growth of proposed work and compare the performance with existing schemes. An adaptive technique has been proposed for source authentication in multicast system. The new technique is named elliptic curve cryptography source authentication (ECCSA). It has less communication cost as compared to SHS, EMSS, and HMSA.