Exploration of 2D Cellular Automata as Binary Sequence Generators

Author(s):  
Efthymia Arvaniti ◽  
Ilias Mavridis ◽  
Athanasios Kakarountas
2009 ◽  
Vol 19 (10) ◽  
pp. 3407-3415 ◽  
Author(s):  
LIN CHEN ◽  
FANGYUE CHEN ◽  
WEIFENG JIN ◽  
FANGFANG CHEN ◽  
GUANRONG CHEN

In this paper, it is shown that elementary cellular automata rule 172, as a member of the Chua's robust period-1 rules and the Wolfram class I, is also a nonrobust Bernoulli-shift rule. This rule actually exhibits complex Bernoulli-shift dynamics in the bi-infinite binary sequence space. More precisely, in this paper, it is rigorously proved that rule 172 is topologically mixing and has positive topological entropy on a subsystem. Hence, rule 172 is chaotic in the sense of both Li–Yorke and Devaney. The method developed in this paper is also applicable to checking the subshifts contained in other robust period-1 rules, for example, rules 168 and 40, which also represent nonrobust Bernoulli-shift dynamics.


2001 ◽  
Vol 11 (PR3) ◽  
pp. Pr3-205-Pr3-212
Author(s):  
G. Ch. Sirakoulis ◽  
I. Karafyllidis ◽  
A. Thanailakis
Keyword(s):  

1998 ◽  
Vol 4 (4) ◽  
pp. 49-54
Author(s):  
V.А. Val'kovskii ◽  
◽  
D.D. Zerbino ◽  
Keyword(s):  

2014 ◽  
Vol 2014 (1) ◽  
pp. 37-44 ◽  
Author(s):  
Arighna Sarkar ◽  
◽  
Debarka Mukhopadhyay ◽  

Author(s):  
Satvir Singh

Steganography is the special art of hidding important and confidential information in appropriate multimedia carrier. It also restrict the detection of  hidden messages. In this paper we proposes steganographic method based on dct and entropy thresholding technique. The steganographic algorithm uses random function in order to select block of the image where the elements of the binary sequence of a secret message will be inserted. Insertion takes place at the lower frequency  AC coefficients of the  block. Before we insert the secret  message. Image under goes dc transformations after insertion of the secret message we apply inverse dc transformations. Secret message will only be inserted into a particular block if  entropy value of that particular block is greater then threshold value of the entropy and if block is selected by the random function. In  Experimental work we calculated the peak signal to noise ratio(PSNR), Absolute difference , Relative entropy. Proposed algorithm give high value of PSNR  and low value of Absolute difference which clearly indicate level of distortion in image due to insertion of secret message is reduced. Also value of  relative entropy is close to zero which clearly indicate proposed algorithm is sufficiently secure. 


Author(s):  
Mohd Javed ◽  
Khaleel Ahmad ◽  
Ahmad Talha Siddiqui

WiMAX is the innovation and upgradation of 802.16 benchmarks given by IEEE. It has numerous remarkable qualities, for example, high information rate, the nature of the service, versatility, security and portability putting it heads and shoulder over the current advancements like broadband link, DSL and remote systems. Though like its competitors the concern for security remains mandatory. Since the remote medium is accessible to call, the assailants can undoubtedly get into the system, making the powerless against the client. Many modern confirmations and encryption methods have been installed into WiMAX; however, regardless it opens with up different dangers. In this paper, we proposed Elliptic curve Cryptography based on Cellular Automata (EC3A) for encryption and decryption the message for improving the WiMAX security


Sign in / Sign up

Export Citation Format

Share Document