LoBa128, a Lorenz-based PRNG for wireless sensor networks

Silva, Rui; Crespo, Rui Gustavo; Nunes, Mário Serafim

doi:10.1504/ijcnds.2009.027596

Cited by 7 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the key space is reduced by the ineluctable errors of the components values and the signal redundancy. Many cryptanalyses are then possible . For these different disadvantages, we are not going to consider analog chaotic systems in the rest of this paper.…”

Section: Related Workmentioning

confidence: 99%

“…To improve nonlinearity and immunity against differential attacks, cascading multiple chaotic structures seems to be interesting . The cryptanalysis will be more complex as the output is established by many mixed chaotic orbits.…”

Section: The Proposed Algorithms For S‐box Designmentioning

confidence: 99%

“…It is applied to many different domains such as physics, robotics, biology, finance and encryption. The main important characteristics of chaotic systems are the great dependency on initial conditions (ICs) and parameters variation , ergodicity, the random‐like behavior, and simplicity. These properties attract the researchers to develop chaotic secure communication and crypto‐systems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient and secure chaotic S‐Box for wireless sensor network

Zaibi

Peyrard

Kachouri

et al. 2013

Security Comm Networks

View full text Add to dashboard Cite

Information security using chaotic dynamics is a novel topic in the wireless sensor network (WSN) research field. After surveying analog and digital chaotic security systems, we give a state of the art of chaotic S-Box design. The substitution tables are nonlinear maps that strengthen and enhance block crypto-systems. This paper deals with the design of new dynamic chaotic S-Boxes suitable for implementation on wireless sensor nodes. Our proposed schemes are classified into two categories: S-Box based on discrete chaotic map with floating point arithmetic (cascading piecewise linear chaotic map and a three-dimensional map) and S-Box based on discrete chaotic map with fixed-point arithmetic (using discretized Lorenz map and logistic-tent map). The security analysis and implementation process on WSN are discussed. The proposed methods satisfy Good S-Box design criteria and exceed the performance of Advanced Encryption Standard static S-Box in some cases. The energy consumption of different proposals and existing chaotic S-Box designs are investigated via a platform simulator and a real WSN testbed equipped with TI MSP430f1611 micro-controller. The simulations and the experimental results show that our proposed S-Box design with fixed-point arithmetic Lorenz map has the lowest energy-consuming profile compared with the other studied and proposed S-Box design.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: The Proposed Algorithms For S‐box Designmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient and secure chaotic S‐Box for wireless sensor network

Zaibi

Peyrard

Kachouri

et al. 2013

Security Comm Networks

View full text Add to dashboard Cite

show abstract

Investigation of Strength and Security of Pseudo Random Number Generators

Sathya¹,

Premalatha²,

Rajasekar³

2021

IOP Conf. Ser.: Mater. Sci. Eng.

View full text Add to dashboard Cite

Security is a key factor in today’s fast communicating world. Many cryptographic algorithms are tested and put into use efficiently. Random numbers are used in diverse forms like nonces, secret key, initialization vector, etc. They find place in encryption, digital signature, hashing algorithms. A deterministic algorithms takes an intial seed value as input and produces pseudo random numbers with falsely induced randomness. This research work extensively surveys large set of state-of-the-art PRNGs and categorizes them based on methodology used to produce them. We compared their statistical results obtained from various statistical test tools like NIST SP 800-22, TestU01. Finally, security analyses of various PRNGs were done quantitatively for their key space, key sensitivity, entropy, speed of bit generation, linear complexity. At last, we concluded the results with some future directions for researchers to carry out their research in improving the PRNGs.

show abstract