Image encryption using finite-precision error

Lucas G. Nardo, Erivelton G. Nepomuceno, Janier Arias-Garcia and Denis N. Butusov

Chaos, Solitons & Fractals, 2019, vol. 123, issue C, 69-78

Abstract: Chaotic systems are broadly adopted to generate pseudo-random numbers used in encryption schemes. However, when implemented on a finite precision computer, chaotic systems end up in dynamical degradation of chaotic properties. Many works have been proposed to address this issue. Nevertheless, little attention has been paid to exploit the finite precision as a source of randomness rather a feature that should be mitigated. This paper proposes a novel plain-image encryption using finite-precision error. The error is obtained by means of the implementation of a chaotic system using two natural different interval extensions. The generated sequence has passed all NIST test, which means it has sufficient randomness to be used in encryption. Several benchmark images have been effectively encrypted using the proposed approach.

Keywords: Image encryption; Finite-precision error; Natural interval extension; Lower bound error; Computer arithmetic; NIST tests (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077919300918
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:123:y:2019:i:c:p:69-78

DOI: 10.1016/j.chaos.2019.03.026

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().