Fast Chaotic Encryption Using Circuits for Mobile and Cloud Computing: Investigations Under the Umbrella of Cryptography

Fast Chaotic Encryption Using Circuits for Mobile and Cloud Computing: Investigations Under the Umbrella of Cryptography

Shalini Stalin, Priti Maheshwary, Piyush Kumar Shukla, Akhilesh Tiwari, Ankur Khare
Copyright: © 2018 |Pages: 26
DOI: 10.4018/978-1-5225-3531-7.ch012
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In last few decades, a lot of work has been done in the field of cryptography; it is being considered one of the safe methods to protect data. It was first used to protect communication by individuals, armies, and organizational companies. With the help encryption method, anyone can protect their data from a third-party attack. Images are used in various areas like biometric authentication, medical science, military, etc., where they are being stored or transferred over the network and the safety of such images are very important. The newest movement in encryption is chaos-based, which is a better encryption technique than AES, DES, RSA, etc. It consists of different property such as sensitive independence on original situation, non-periodicity, non-convergence, etc. In recent times, many chaos-based image encryption algorithms have been proposed, but most of them are not sufficient to provide full protection to data. In this chapter, a survey of different chaos-based image encryption techniques is discussed.
Chapter Preview
Top

Introduction

A clandestine distribution plan (Abirami,2005; Elshamy, 2003; Orue, 2002) is a convention to share a mystery among members such that just specified subsets of members can recoup the mystery. In considering the security ideas of mystery sharing plans, a few creators have published ideas of security for mystery sharing plans taking into account diverse data measures. These data measures incorporate four imperative data measures: Shannon entropy, min entropy, Renyi entropy and Kolmogorov multifaceted nature. Shannon entropy is the most broadly utilized data measure, which is utilized to demonstrate limits on the offer size and on the data rate in mystery sharing plans (Fitwi, 2011; Akhvan, 2013; Pande, 2011; Soleymani,2014). As of late, min and Renyi entropies are additionally utilized as a part of investigation of the security of mystery sharing plans (Cristina, 2014; Pande, 2011).Picture stowing is a type of steganography that works by inserting information into a computerized media with the end goal of ID, annotation, and copyrighting. This paper presents a novel picture steganography framework, which implants (RGB) mystery picture inside (RGB) spread picture picked by an improved flexible back engendering neural system. The proposed framework incorporates inserting and extraction stages. Three principle stages are incorporated inside the inserting stage, which are; best cover picture determination and handling stage, mystery picture choice and preparing stage and best implanting limit choice stage separately. Best cover picture is performed utilizing SOM and ERBP calculations. Mystery picture is handled by isolating it into (Red, Green, and Blue) shading layers and DWT is then connected. The shading layers are then changed over to bit streams; altered FLFSR in turns will be utilized to scramble these streams to get more secure framework. ERBP is again used to choose the best implanting edge values. The execution has been assessed amid inserting and extraction stages considering utilizing a few spread and mystery pictures and considering a few sizes (Bakhache, 2011; Khare & Shukla, 2015).

Complete Chapter List

Search this Book:
Reset