A simple, sensitive and secure image encryption algorithm based on hyper-chaotic system with only one round diffusion process

Based on hyper-chaotic systems, a novel image encryption algorithm is introduced in this paper. The advantages of our proposed approach are that it can be realized easily in one round diffusion process and is computationally very simple while attaining high security level, high key sensitivity, high...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Multimedia tools and applications Ročník 71; číslo 3; s. 1469 - 1497
Hlavní autoři:	Norouzi, Benyamin, Mirzakuchaki, Sattar, Seyedzadeh, Seyed Mohammad, Mosavi, Mohammad Reza
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.08.2014 Springer Springer Nature B.V
Témata:	Algorithms Applied sciences Artificial intelligence Chaos theory Coding, codes Computer Communication Networks Computer Science Computer science; control theory; systems Computer systems and distributed systems. User interface Cryptography Data encryption Data Structures and Information Theory Design Diffusion Encryption Exact sciences and technology Image quality Information, signal and communications theory Multimedia Multimedia computer applications Multimedia Information Systems Pattern recognition. Digital image processing. Computational geometry Pixels Security Sensitivity analysis Signal and communications theory Software Special Purpose and Application-Based Systems Studies Telecommunications and information theory Diffusion process Image encryption Sensitivity Security NPCR UACI Chaos Histogram Image processing Decryption Multimedia communication Optimization Image coding High sensitivity Cryptography Computer security Correlation coefficient Computer vision Differential cryptanalysis Sensitivity analysis Stream ciphering Risk analysis Plaintext attack Differential analyzer Experimental result Level Summation Security key
ISSN:	1380-7501, 1573-7721
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!