SPCBC: A Secure Parallel Cipher Block Chaining Mode of Operation based on logistic Chaotic Map

2018 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
Dafirius Lombu ◽  
Siska Dame Tarihoran ◽  
Irwan Gulo

Generally, the database access of a website lies in the user login. When the login data is not accompanied by security techniques, it is very easily accessible by other parties. One effort that can be done to solve the problem is to encode the login data of website users based on cryptographic technique algorithm. Triangle Chain Cipher (TCC) is one of the classic cryptographic algorithms that encode data doubly and generate keys randomly along the plain. The process of encryption and decryption are interdependent to be one of the advantages of this algorithm. This algorithm will be more effective when combined with the Cipher Block Chaining (CBC) operation mode that is widely used in modern cryptographic algorithms today. The feedback mechanism between the blocks in this mode of operation is the operating advantage. This study describes how to combine the mode of operation of block chaining cipher with triangle chain cipher algorithm so that cipher data login website generated more random and difficult to find its original meaning.


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 8 (3) ◽  
pp. 1090-1104
Author(s):  
Kelvin Lysander ◽  
Allwin M Simarmata ◽  
Denniel Lusandy ◽  
Iswandi Iswandi

Abstrak Algoritma kriptografi dapat digunakan untuk mengamankan citra. Salah satu algoritma kriptografi yang dapat digunakan untuk mengenkripsi citra adalah algoritma Serpent. Namun, algoritma Serpent memerlukan proses enkripsi dan dekripsi yang lama. Selain itu, pengenkripsian saja tidaklah cukup karena akan menimbulkan kecurigaan sehingga informasi akan rentan dicuri. Maka diperlukan teknik steganografi seperti metode Integer Wavelet Transform (IWT). Citra rahasia akan dienkripsi terlebih dahulu dengan menggunakan metode Modified Serpent, dimana modifikasi Serpernt mengubah proses transformasi substitusi byte (DES S-box) menjadi list bilangan prima 257 yang memiliki 128 generator untuk digunakan sebagai kunci di setiap putarannya. Pada proses penyisipan dengan metode IWT, perlu ditentukan posisi bit dan piksel pada cover image yang akan disisipkan sebuah pesan. Untuk menentukan posisi tersebut, maka digunakanlah fungsi chaos. Setelah itu, dapat dilakukan proses ekstraksi terhadap citra stego yang dihasilkan pada proses penyisipan untuk memperoleh kembali bit yang tersimpan didalamnya. Kumpulan bit tersebut dapat didekripsi sehingga akan diperoleh kembali citra rahasia semula.


2016 ◽  
Vol 3 (1) ◽  
pp. 20-35 ◽  
Author(s):  
Dhiraj Pandey ◽  
U. S. Rawat

Progressive Visual Cryptography (PVC) is quite suitable for sharing sensitive digital data.Previous research on PVC, such as Fang et al. (2006) and W.P.Fang et al.(2008) were all carrying pixel-expansion problem and also gives a poor visual quality on the recovered stacked image. Recently, Hou&Quan (2011) have developed a progressive scheme for secret sharing. It is observed that shares generated by the scheme are free from pixel expansion problem, but shares are not fully secure. In this paper, a new progressive sharing algorithm based on logistic chaotic map has been proposed to overcome the said limitation of Hou (2011) scheme. The irregular outputs of the logistic map are used to encode a secret digital information carrying image. The performance of the algorithm in the scheme of Hou (2011) is critically analyzed and compared with new suggested scheme. Empirical results are presented to showcase the performance of the authors' proposed scheme in terms of its effectiveness (imperceptibility and security) and feasibility.


2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Qiang Zhang ◽  
Xianglian Xue ◽  
Xiaopeng Wei

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.


2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Akugbe Martins Arasomwan ◽  
Aderemi Oluyinka Adewumi

This paper experimentally investigates the effect of nine chaotic maps on the performance of two Particle Swarm Optimization (PSO) variants, namely, Random Inertia Weight PSO (RIW-PSO) and Linear Decreasing Inertia Weight PSO (LDIW-PSO) algorithms. The applications of logistic chaotic map by researchers to these variants have led to Chaotic Random Inertia Weight PSO (CRIW-PSO) and Chaotic Linear Decreasing Inertia Weight PSO (CDIW-PSO) with improved optimizing capability due to better global search mobility. However, there are many other chaotic maps in literature which could perhaps enhance the performances of RIW-PSO and LDIW-PSO more than logistic map. Some benchmark mathematical problems well-studied in literature were used to verify the performances of RIW-PSO and LDIW-PSO variants using the nine chaotic maps in comparison with logistic chaotic map. Results show that the performances of these two variants were improved more by many of the chaotic maps than by logistic map in many of the test problems. The best performance, in terms of function evaluations, was obtained by the two variants using Intermittency chaotic map. Results in this paper provide a platform for informative decision making when selecting chaotic maps to be used in the inertia weight formula of LDIW-PSO and RIW-PSO.


2011 ◽  
Vol 341-342 ◽  
pp. 720-724 ◽  
Author(s):  
Wang Sheng Fang ◽  
Lu Lu Wu ◽  
Rong Zhang

One of the main purpose of the watermark preprocessing is to improve the robustness and security. For this reason,this paper presents an image encryption algorithm, which combines position scrambling and gray scrambling scrambled according to Arnold transform.Then all of the pixels of each sub-block are scambled by the algorithm based on Logistic chaotic map.Finally, all of the Pixels are redistributed and scrambled totally.Basing on image location scrambling,it takes advantage of multi-dimensional Arnold transformation and Logistic chaotic map, image gray scrambling is achieved. By histogram analysis,key sensitivity anslysis and correlation analysis of adjacent pixels of the results of the simulation, indicating that the scrambling effect of the algorithm is good,and the key space is large.


2016 ◽  
Vol 26 (07) ◽  
pp. 1650113 ◽  
Author(s):  
Abdessalem Abidi ◽  
Qianxue Wang ◽  
Belgacem Bouallegue ◽  
Mohsen Machhout ◽  
Christophe Guyeux

The cipher block chaining (CBC) mode of operation was invented by IBM (International Business Machine) in 1976. It presents a very popular way of encrypting that is used in various applications. In this paper, we have mathematically proven that, under some conditions, the CBC mode of operation can admit a chaotic behavior according to Devaney. Some cases will be properly studied in order to provide evidence for this idea.


Sign in / Sign up

Export Citation Format

Share Document