Keyed hash function using Bernoulli shift map

2017 ◽  
Vol 9 (3) ◽  
pp. 250
Author(s):  
S. Durga Bhavani ◽  
P. Jhansi Rani
Keyword(s):  
Hash Function ◽  
Bernoulli Shift ◽  
Shift Map ◽  
Keyed Hash Function

scholarly journals Probing bacterial cell wall growth by tracing wall-anchored protein complexes

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Yi-Jen Sun ◽  
Fan Bai ◽  
An-Chi Luo ◽  
Xiang-Yu Zhuang ◽  
Tsai-Shun Lin ◽  
...  
Keyword(s):  
Cell Wall ◽  
Cell Shape ◽  
Bernoulli Shift ◽  
Protein Complexes ◽  
Axial Direction ◽  
Cell Wall Growth ◽  
Flagellar Motors ◽  
Shift Map ◽  
Dynamic Assembly ◽  
Wall Growth

AbstractThe dynamic assembly of the cell wall is key to the maintenance of cell shape during bacterial growth. Here, we present a method for the analysis of Escherichia coli cell wall growth at high spatial and temporal resolution, which is achieved by tracing the movement of fluorescently labeled cell wall-anchored flagellar motors. Using this method, we clearly identify the active and inert zones of cell wall growth during bacterial elongation. Within the active zone, the insertion of newly synthesized peptidoglycan occurs homogeneously in the axial direction without twisting of the cell body. Based on the measured parameters, we formulate a Bernoulli shift map model to predict the partitioning of cell wall-anchored proteins following cell division.

Chaotic keyed hash function based on feedforward–feedback nonlinear digital filter

2007 ◽  
Vol 362 (5-6) ◽  
pp. 439-448 ◽  
Author(s):  
Jiashu Zhang ◽  
Xiaomin Wang ◽  
Wenfang Zhang
Keyword(s):  
Digital Filter ◽  
Hash Function ◽  
Keyed Hash Function

On the use of chaotic iterations to design keyed hash function

2017 ◽  
Vol 22 (S1) ◽  
pp. 905-919 ◽  
Author(s):  
Zhuosheng Lin ◽  
Christophe Guyeux ◽  
Simin Yu ◽  
Qianxue Wang ◽  
Shuting Cai
Keyword(s):  
Hash Function ◽  
Chaotic Iterations ◽  
Keyed Hash Function

Efficient JPEG Encoding Using Bernoulli Shift Map for Secure Communication

2021 ◽  
Author(s):  
Nisar Ahmad ◽  
Muhammad Usman Younus ◽  
Muhammad Rizwan Anjum ◽  
Gulshan Saleem ◽  
Zaheer Ahmed Gondal ◽  
...  
Keyword(s):  
Secure Communication ◽  
Communication Systems ◽  
Bernoulli Shift ◽  
Random Number Generator ◽  
Lossless Compression ◽  
Jpeg Compression ◽  
Digital Data ◽  
Compression Scheme ◽  
Encrypt Data ◽  
Shift Map

Abstract Digital data must be compressed and encrypted to maintain confidentiality and efficient bandwidth usage. These two parameters are essential for information processing in most communication systems. Image compression and encryption may result in reduced restoration quality and degraded performance. This study attempts to provide a compression and encryption scheme for digital data named as Secure-JPEG. This scheme is built on the JPEG compression format, the most widely used lossy compression scheme. It extends the standard JPEG compression algorithm to encrypt data during compression. Secure-JPEG scheme provides encryption along with the process of compression, and it could be altered easily to provide lossless compression. On the other hand, the lossless compression provides less compression ratio and is suitable only in specific scenarios. The paper address the problem of security lacks due to the use of a simple random number generator which can not be cryptographically secure. The improved security characteristics are provided through Generalized Bernoulli Shift Map, which has a chaotic system with demonstrated security. The algorithm's security is tested by several cryptographic tests and the chaotic system’s behavior is also analyzed.

scholarly journals Chaotic Behavior of One-Dimensional Cellular Automata Rule 24

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Zujie Bie ◽  
Qi Han ◽  
Chao Liu ◽  
Junjian Huang ◽  
Lepeng Song ◽  
...  
Keyword(s):  
Cellular Automata ◽  
Characteristic Function ◽  
Symbolic Dynamics ◽  
Bernoulli Shift ◽  
Chaotic Behavior ◽  
Class Ii ◽  
Chaotic Attractors ◽  
One Dimensional ◽  
Dynamical Behaviors ◽  
Shift Map

Wolfram divided the 256 elementary cellular automata rules informally into four classes using dynamical concepts like periodicity, stability, and chaos. Rule 24, which is Bernoulliστ-shift rule and is member of Wolfram’s class II, is said to be simple as periodic before. Therefore, it is worthwhile studying dynamical behaviors of four rules, whether they possess chaotic attractors or not. In this paper, the complex dynamical behaviors of rule 24 of one-dimensional cellular automata are investigated from the viewpoint of symbolic dynamics. We find that rule 24 is chaotic in the sense of both Li-Yorke and Devaney on its attractor. Furthermore, we prove that four rules of global equivalenceε52of cellular automata are topologically conjugate. Then, we use diagrams to explain the attractor of rule 24, where characteristic function is used to describe the fact that all points fall into Bernoulli-shift map after two iterations under rule 24.

Sign in / Sign up

Export Citation Format

Share Document