Implementation of a Double Sequence Encryption Scheme Based on Chaotic Map

2013 ◽  
Vol 765-767 ◽  
pp. 1073-1076
Author(s):  
Fu Xiang Zhao

this paper presents a new scheme for enhancing the security of full disk encryption relying on the double sequence encryption based on chaotic map in order to improve the performance of its practical implementation. The aims of the proposed scheme are to design a keystream generator for the tweakable enciphering mode in space or time sequence using the real-time embedded device through sequential change detection on the disk read-and-write request. This design of the scheme is based on re-keying principle and derived from information-theoretical evaluation. Analyses show that the scheme is provably secure and can prevent inner and outer attackers from attacking. To the best of our knowledge, the scheme offers the first comprehensive solution to the watermarking attack in the same sector.

Author(s):  
Keith M. Martin

In this chapter, we consider some of the cryptography which can be used to protect data stored on personal devices. We begin by looking at various forms of cryptographic file protection, including full disk encryption. We then consider the cryptography which can be used to support two applications widely used on personal devices, namely, email and asynchronous messaging. To illustrate the latter, we discuss the cryptography deployed by the application WhatsApp. Finally, we obtain a slightly different perspective by providing an overview of the cryptography supported by one particular device platform, Apple’s iOS operating system.


2019 ◽  
Vol 1 ◽  
pp. 223-237
Author(s):  
Terlumun Gbaden

The widespread use of images in various sectors of life makes its protection increasingly necessary and important. An improvement over encryption and decryption algorithm using exponential logistic chaotic map was proposed. In this work, we adopt an encryption/decryption strategy for colour images using the exponential logistic chaotic map. The proposed encryption/decryption algorithms are implemented in MATLAB for computer simulation. The experimental results indicate that the proposed algorithms can be used successfully to encrypt/decrypt images with secret keys. The performance analysis using histogram uniformity analysis and correlation coefficient show that the algorithms give larger space, quick speed and easy to realize. The encrypted images have good encryption effect and low correlation coefficient rendering it a good candidate for confidential and secure means of transmitting image information in untrusted networks.


2021 ◽  
Vol 2026 (1) ◽  
pp. 012013
Author(s):  
Zhen Tang ◽  
Zhixiang Yin ◽  
Jing Yang ◽  
Rujie Xu ◽  
Xiyuan Wang ◽  
...  

Author(s):  
Kazuhiko Minematsu ◽  
Tetsu Iwata

At CT-RSA 2017, List and Nandi proposed two variable input length pseudorandom functions (VI-PRFs) called PMACx and PMAC2x, and a deterministic authenticated encryption scheme called SIVx. These schemes use a tweakable block cipher (TBC) as the underlying primitive, and are provably secure up to the query complexity of 2n, where n denotes the block length of the TBC. In this paper, we falsify the provable security claims by presenting concrete attacks. We show that with the query complexity of O(2n/2), i.e., with the birthday complexity, PMACx, PMAC2x, and SIVx are all insecure.


2021 ◽  
pp. 2150406
Author(s):  
Wanbo Yu ◽  
Hao Wang

Chaotic map is applied to numerous research fields, such as encryption of data and information. In this paper, a novel bit-level scrambling encryption based on three-dimensional trigonometric chaotic sequence is proposed. This encryption is operated on grayscale images because pixel value of which is between 0 and 255, which can be converted into 8-bit binary number, then each image can be converted into eight binary images. Combine binary images a three-dimensional matrix as input, which have three index values width, height, and page. Generate three numbers by the chaotic sequence to locate the value of the matrix need to be changed. After the value is located, change its value 0 to 1 or 1 to 0, this is the basic encryption scheme. This paper makes a three-dimensional binary matrix with 32 images to test the encryption scheme, and get average value of images’ number of pixel change rate at 0.9603, unified averaged change intensity at 31.27%, information entropy at 7.9891, also the histograms. And correlation coefficients of each pixel from three directions are small. There are comparisons with other encryptions too. The key space of this encryption is more than 10[Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document