scholarly journals Cryptographic Techniques Based on Bio-Inspired Systems

Cryptography ◽  
2020 ◽  
pp. 99-119
Author(s):  
Petre Anghelescu
Keyword(s):  
Cellular Automata ◽  
Communication Systems ◽  
High Speed ◽  
Statistical Tests ◽  
Experimental Results ◽  
Network Communication ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
Security Systems ◽  
Cryptographic Techniques

In this chapter, bio-inspired techniques based on the cellular automata (CAs) and programmable cellular automata (PCAs) theory are used to develop information security systems. The proposed cryptosystem is composed from a combination of a CA as a pseudorandom number generator (PRNG) and a PCA that construct the ciphering functions of the designed enciphering scheme. It is presented how simple elements named „cells” interact between each other using certain rules and topologies to form a larger system that can be used to encrypt/decrypt data sent over network communication systems. The proposed security system was implemented in hardware in FPGA devices of type Spartan 3E – XC3S500E and was analyzed and verified, including NIST statistical tests, to assure that the system has good security and high speed. The experimental results proves that the cryptographic techniques based on bio-inspired algorithms provides an alternative to the conventional techniques (computational methods).

Cryptographic Techniques Based on Bio-Inspired Systems

2016 ◽  
pp. 59-77
Author(s):  
Petre Anghelescu
Keyword(s):  
Cellular Automata ◽  
Communication Systems ◽  
High Speed ◽  
Statistical Tests ◽  
Experimental Results ◽  
Network Communication ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
Security Systems ◽  
Cryptographic Techniques

In this chapter, bio-inspired techniques based on the cellular automata (CAs) and programmable cellular automata (PCAs) theory are used to develop information security systems. The proposed cryptosystem is composed from a combination of a CA as a pseudorandom number generator (PRNG) and a PCA that construct the ciphering functions of the designed enciphering scheme. It is presented how simple elements named „cells” interact between each other using certain rules and topologies to form a larger system that can be used to encrypt/decrypt data sent over network communication systems. The proposed security system was implemented in hardware in FPGA devices of type Spartan 3E – XC3S500E and was analyzed and verified, including NIST statistical tests, to assure that the system has good security and high speed. The experimental results proves that the cryptographic techniques based on bio-inspired algorithms provides an alternative to the conventional techniques (computational methods).

scholarly journals A New Two-Dimensional Mutual Coupled Logistic Map and Its Application for Pseudorandom Number Generator

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Xuan Huang ◽  
Lingfeng Liu ◽  
Xiangjun Li ◽  
Minrong Yu ◽  
Zijie Wu
Keyword(s):  
Statistical Tests ◽  
Chaotic Map ◽  
Logistic Map ◽  
Security Analysis ◽  
Three Dimensional ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
Two Dimensional ◽  
Practical Applications

Given that the sequences generated by logistic map are unsecure with a number of weaknesses, including its relatively small key space, uneven distribution, and vulnerability to attack by phase space reconstruction, this paper proposes a new two-dimensional mutual coupled logistic map, which can overcome these weaknesses. Our two-dimensional chaotic map model is simpler than the recently proposed three-dimensional coupled logistic map, whereas the sequence generated by our system is more complex. Furthermore, a new kind of pseudorandom number generator (PRNG) based on the mutual coupled logistic maps is proposed for application. Both statistical tests and security analysis show that our proposed PRNG has good randomness and that it can resist all kinds of attacks. The algorithm speed analysis indicates that PRNG is valuable to practical applications.

Design and Test of Pseudorandom Number Generator Using a Star Network of Lorenz Oscillators

2017 ◽  
Vol 27 (12) ◽  
pp. 1750184 ◽  
Author(s):  
Kenichiro Cho ◽  
Takaya Miyano
Keyword(s):  
Stream Cipher ◽  
Statistical Tests ◽  
New Method ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
Lorenz Equations ◽  
Dynamical Models ◽  
Pseudorandom Numbers ◽  
Star Network

We have recently developed a chaos-based stream cipher based on augmented Lorenz equations as a star network of Lorenz subsystems. In our method, the augmented Lorenz equations are used as a pseudorandom number generator. In this study, we propose a new method based on the augmented Lorenz equations for generating binary pseudorandom numbers and evaluate its security using the statistical tests of SP800-22 published by the National Institute for Standards and Technology in comparison with the performances of other chaotic dynamical models used as binary pseudorandom number generators. We further propose a faster version of the proposed method and evaluate its security using the statistical tests of TestU01 published by L’Ecuyer and Simard.

scholarly journals Design and Evaluation of Cell Interaction Based Vedic Multiplier Using Quantum-Dot Cellular Automata

Electronics ◽  
2020 ◽  
Vol 9 (6) ◽  
pp. 1036
Author(s):  
Nuriddin Safoev ◽  
Jun-Cheol Jeon
Keyword(s):  
Cellular Automata ◽  
Quantum Dot ◽  
Communication Networks ◽  
Communication Systems ◽  
High Speed ◽  
Digital Signal ◽  
Cell Interaction ◽  
Quantum Dot Cellular Automata ◽  
Vedic Multiplier ◽  
Ripple Carry Adder

A multiplier is one of the main units for digital signal processing and communication systems. In this paper, a high speed and low complexity multiplier is designed on the basis of quantum-dot cellular automata (QCA), which is considered promising nanotechnology. We focus on Vedic multiplier architectures according to Vedic mathematics from ancient Indian sculptures. In fact, an adder is an important block in the design of almost all types of multipliers and a ripple carry adder is used to design simple multiplier implementations. However, a high-speed multi-bit multiplier requires high-speed adder owing to carry propagation. Cell-interaction-based QCA adders have better improvements over conventional majority-gate-based adders. Therefore, a two-bit Vedic multiplier is proposed in QCA and it is used to implement a four-bit form of the multiplier. The proposed architecture has a lower cell count and area compared to other existing structures. Moreover, simulation results demonstrate that the proposed design is sustainable and can be used to realize complex circuit designs for QCA communication networks.

Sign in / Sign up

Export Citation Format

Share Document