Zooming into chaos for a fast, light and reliable cryptosystem

01/10/2020
by   Jeaneth Machicao, et al.
0

In previous work, the k-logistic map [Machicao and Bruno, Chaos, vol. 27, 053116 (2017)] was introduced as a transformation operating in the k less significant digits of the Logistic map. It exploited the map's pseudo-randomness character that is present in its less significant digits. In this work, we comprehensively analyze the dynamical and ergodic aspects of this transformation, show its applicability to generic chaotic maps or sets, and its potential impact on enabling the creation of a cryptosystem that is fast, light and reliable.

READ FULL TEXT

page 1

page 7

research
11/04/2021

Chaotical PRNG based on composition of logistic and tent maps using deep-zoom

We proposed the deep zoom analysis of the composition of the logistic ma...
research
08/08/2018

Exploiting ergodicity of the logistic map using deep-zoom to improve security of chaos-based cryptosystems

This paper explores the deep-zoom properties of the chaotic k-logistic m...
research
11/18/2019

Fast 2D Map Matching Based on Area Graphs

We present a novel area matching algorithm for merging two different 2D ...
research
12/08/2020

An Efficient Analyses of the Behavior of One Dimensional Chaotic Maps using 0-1 Test and Three State Test

In this paper, a rigorous analysis of the behavior of the standard logis...
research
07/31/2023

Light, Reliable Spanners

A ν-reliable spanner of a metric space (X,d), is a (dominating) graph H,...
research
04/13/2023

Periodicity Analysis of the Logistic Map over Ring ℤ_3^n

Periodicity analysis of sequences generated by a deterministic system is...
research
09/12/2017

Persistence in sampled dynamical systems faster

We call a continuous self-map that reveals itself through a discrete set...

Please sign up or login with your details

Forgot password? Click here to reset