Wyniki wyszukiwania - BazTech

1

S-Box modification for the block cipher algorithms

Shawky Zied Нamed, Gamal Abdellatif Ahmed, Ibrahim Salem Ahmed

Przegląd Elektrotechniczny

|

2023

|

R. 99, nr 4

278--281

EN

Block cipher algorithm also known as a symmetric key cryptography that depends on substitution boxes (S-boxes) for the purpose of providing the element of data confusion. Therefore, the cryptographic system is being affected by S-box. Performing an effective S-box has become a new defiance for the purpose of bringing up an efficient and safe encryption algorithm. Throughout this paper, Rubik’s cube is utilized for the reason of generating AES S-boxes (as an example of the block cipher algorithm) and the shuffling process is executed under the domination of the secret key. The reason of making the security analysis of the modified AES is to discuss the performance of developed AES. The analysis assures that the modified AES is safe for securing vital data. Finally, the experimental results and security analysis show that the proposed modification of the s-box boosts the block cipher security (AES).

PL

Algorytm szyfrowania blokowego znany również jako kryptografia z kluczem symetrycznym, który polega na polach podstawienia (Sboxach) w celu zapewnienia elementu pomieszania danych. Dlatego S-box ma wpływ na system kryptograficzny. Wykonanie skutecznego S-boxa stało się nowym wyzwaniem w celu stworzenia wydajnego i bezpiecznego algorytmu szyfrowania. W całym artykule kostka Rubika jest wykorzystywana do generowania S-boxów AES (jako przykład algorytmu szyfrowania blokowego), a proces tasowania odbywa się pod dominacją tajnego klucza. Powodem przeprowadzenia analizy bezpieczeństwa zmodyfikowanego AES jest omówienie wydajności rozwiniętego AES. Analiza zapewnia, że zmodyfikowany algorytm AES jest bezpieczny dla zabezpieczenia ważnych danych. Wreszcie wyniki eksperymentów i analiza bezpieczeństwa pokazują, że proponowana modyfikacja S-box zwiększa bezpieczeństwo szyfru blokowego (AES).

2

An improved chaotic system-based 1D logistic map applied to gray scale images encryption

Belilita Fairouz, Bekkouche Tewfik, Amardjia Nourredine

Przegląd Elektrotechniczny

|

2022

|

R. 98, nr 5

130--133

EN

In this paper, we propose an improved chaotic system inspired from the classical 1D Logistic map. The main idea consists in enhancing the performance of the control parameter by extending its chaotic range. The improved Logistic map (ILM) is applied to gray scale encryption images using the confusion-diffusion architecture. The input image is first chaotically scrambled before performing an element by element recursive XOR on its successive chosen blocks of ሺ8 ൈ 8ሻ or ሺ16 ൈ 16ሻ. Obtained result is reshaped to give the encrypted image. Computer simulations prove the performances of this method in terms of histogram analysis, correlation and sensitivity analysis.

PL

W tym artykule proponujemy ulepszony chaotyczny system inspirowany klasyczną mapą logistyczną 1D. Główną ideą jest zwiększenie wydajności parametru kontrolnego poprzez rozszerzenie jego chaotycznego zakresu. Ulepszona mapa logistyczna (ILM) jest stosowana do obrazów szyfrowania w skali szarości przy użyciu architektury pomyłek-rozproszenia. Obraz wejściowy jest najpierw chaotycznie zaszyfrowany przed wykonaniem element po elemencie rekurencyjnego XOR na jego kolejnych wybranych blokach (8×8) lub (16×16). Otrzymany wynik jest przekształcany w celu uzyskania zaszyfrowanego obrazu. Symulacje komputerowe potwierdzają wydajność tej metody w zakresie analizy histogramu, korelacji i analizy wrażliwości.

3

Double-image encryption scheme based on the phase-truncated multiple-parameter Fresnel transform

Zhou Ling, Zhou Hang, Ma Yan, Zhou Nan-Run

Optica Applicata

|

2022

|

Vol. 52, nr 2

163--177

EN

A double-image encryption algorithm is proposed with the phase-truncated multiple-parameter Fresnel transform. Firstly, the pixel positions of two plaintext images are scrambled and then the results are merged into one image with the scrambling operation. Subsequently, the resulting image is encrypted by phase truncation and phase reservation in the multiple-parameter Fresnel transform domain. The phase information is scrambled by the affine transform and then recombined with the amplitude information. The final encryption image is obtained with the pixel scrambling and diffusion methods to further enhance the security of the image encryption system, where the scrambling and diffusion operations are based on logistic map, logistic-sine system and 2D logistic-adjusted-sine map. The image encryption scheme is robust against the common attacks due to the nonlinear properties of diffusion and phase truncation. Numerical simulation results verify the performance and the security of the proposed double-image algorithm based on the phase-truncated multiple-parameter Fresnel transform.

4

Optimal steganographic method based on image encryption

Al-Bdour Nashat, Mansour Ayman M.

Przegląd Elektrotechniczny

|

2021

|

R. 97, nr 6

10--14

EN

The paper investigates an image encryption method for the implementation of steganographic information protection. This paper aims to increase the volume of a secret message with fixed sized image. The proposed system represents an image in the form of a binary code. Each pixel code consists of 24 bits, which encode blue, green and red colors. The resulting image code is encrypted using a key set of encrypt codes generated by a pseudo-random number generator. The generation is based on cellular automata with active cells. As a result, the best bits in the color bytes of each pixel have been identified. The method provides a high degree of encryption due to the fact that, in addition to encrypting the selected bits of the pixel codes, the codes are changed due to the introduction of the bits of the secret message. The bits of the secret message have a random order since the secret message is determined by its internal content. Each new message is different from other messages and is additionally encrypted. This makes it possible to use several encrypt keys in conceal a message in an image.

PL

W artykule omówiono metodę szyfrowania obrazu w celu realizacji steganograficznej ochrony informacji. Ten artykuł ma na celu zwiększenie objętości tajnej wiadomości z obrazem o stałym rozmiarze. Proponowany system przedstawia obraz w postaci kodu binarnego. Każdy kod piksela składa się z 24 bitów, które kodują kolory niebieski, zielony i czerwony. Wynikowy kod obrazu jest szyfrowany przy użyciu zestawu kluczy szyfrujących kodów generowanych przez generator liczb pseudolosowych. Generacja oparta jest na automatach komórkowych z aktywnymi komórkami. W rezultacie zidentyfikowano najlepsze bity w bajtach koloru każdego piksela. Metoda zapewnia wysoki stopień szyfrowania dzięki temu, że oprócz szyfrowania wybranych bitów kodów pikselowych, kody ulegają zmianie w wyniku wprowadzenia bitów tajnej wiadomości.

5

Reversible data-hiding-through-encryption scheme using rotated stream cipher

Manikandan V. M.

Computer Science

|

2021

|

T. 22 (2)

267–291

EN

Research into the domain of reversible data-hiding has received a great deal of attention in recent years due to its wide applications in medical image transmission and cloud computing. Reversible data-hiding during image encryption is a recently emerged framework for hiding secret data in an image during the image-encryption process. In this manuscript, we propose a new reversible data-hiding-through-encryption scheme that will ensure a high embedding rate without bringing any additional overhead of key handling. The proposed algorithm can use any secure symmetric encryption scheme, and the encryption and/or decryption key should be shared with the receiver for data extraction and image recovery. As per the proposed scheme, the data hider can hide threebits of a secret message in an image block of a size of B × B pixels. The data extraction and image recovery will be carried out by analyzing the closeness between adjacent pixels. The simulation of the new scheme carried out on the USC-SIPI dataset shows that the proposed scheme outperforms the well-known existing schemes in terms of embedding rates and bit error rates.

6

Image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellin transform

Wang Mengmeng, Pousset Yannis, Carré Phillippe, Perrine Clency, Zhou Nanrun, Wu Jianhua

Optica Applicata

|

2020

|

Vol. 50, nr 3

477--495

EN

An image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellintrans form (GARPFrMT) is proposed. The GARPFrMT was realized in the diffraction domain.The Gaussian aperture, like a soft aperture, improved the amount of light that passed through the lens compared to a hard aperture and reduced the light leakage at the edge of the lens, assisting to some extent in resisting direct attacks. In the proposed scheme, the reality-preserving transform was constructed in the diffraction domain to ensure that the cipher-text is real. The GARPFrMT is a nonlinear transformation used for eliminating potential insecurity existing in the linear image encryption system. In order to further enhance the security of the encryption system, an Arnold transform, and a bitwise XOR operation were employed for permutation and scrambling in the encryption process. Simulation results and theoretical analysis show that the proposed algorithm is feasible and capable of with standing several common attacks.

7

Image encryption based on permutation polynomials over finite fields

Wu Jianhua, Liu Hai, Zhu Xishun

Optica Applicata

|

2020

|

Vol. 50, nr 3

357--376

EN

In this paper, we propose an image encryption algorithm based on a permutation polynomial over finite fields proposed by the authors. The proposed image encryption process consists of four stages: i) a mapping from pixel gray-levels into finite field, ii) a pre-scrambling of pixels’ positions based on the parameterized permutation polynomial, iii) a symmetric matrix transform over finite fields which completes the operation of diffusion and, iv) a post-scrambling based on the permutation polynomial with different parameters. The parameters used for the polynomial parameterization and for constructing the symmetric matrix are used as cipher keys. Theoretical analysis and simulation demonstrate that the proposed image encryption scheme is feasible with a high efficiency and a strong ability of resisting various common attacks. In addition, there are not any round-off errors in computation over finite fields, thus guaranteeing a strictly lossless image encryption. Due to the intrinsic nonlinearity of permutation polynomials in finite fields, the proposed image encryption system is nonlinear and can resist known-plaintext and chosen-plaintext attacks.

8

Image encryption based on Chebyshev chaotic map and S8 S-boxes

Hussain Iqtadar, Anees Amir, Alkhaldi Ali Hussain, Aslam Muhammad, Siddiqui Nasir, Ahmed Rehan

Optica Applicata

|

2019

|

Vol. 49, nr 2

317--330

EN

The encryption of image data is artful as compare to others due to some special characteristics such as entropy, contrast, the correlation between the pixels, intensity, and homogeneity. During encryption process, it is conventionally not easy to manage these characteristics with non-chaotic cryptosystems. Therefore for the sake of strong encryption algorithms, in last decades many cryptographers have presented invulnerable schemes for image encryption based on the chaotic maps. This manuscript aims to propose a strong encryption scheme based on a symmetric group of permutation advanced encryption standard (AES) substitution boxes and modified Chebyshev map. Principally, the secret key depends upon the parameters of Chebyshev map to create confusion in the main image and is encrypted by the scheme made from the S8 AES S-boxes and chaotic map. By this procedure, one can obtain an encrypted image that is entirely twisted. The results of analyses showed that the presented image encryption is strong and invulnerable.

9

Image compression and encryption algorithm with wavelet-transform-based 2D compressive sensing

Fan Jing-Hui, Liu Xian-Bao, Chen Yan-Bin

Optica Applicata

|

2019

|

Vol. 49, nr 3

461--472

EN

By combining a wavelet transform with chaos scrambling, an image compression and encryption algorithm based on 2D compressive sensing is designed. The wavelet transform is employed to obtain the sparse representation of a plaintext image. The sparse image is measured in two orthogonal directions by compressive sensing. Then, the result of 2D compressive sensing is confused by the Arnold transform and the random pixel scrambling. The combination of four-dimensional chaos and logistic map is exploited to generate the first row of the key-controlled circulant matrix. The proposed algorithm not only carries out image compression and encryption simultaneously, but also reduces the consumption of the key by controlling the generation of measurement matrix. Experimental results reveal that the proposed image compression and encryption algorithm is resistant to noise attacks with good compression performance and high key sensitivity.

10

Image compression and encryption algorithm based on advanced encryption standard and hyper-chaotic system

Nie Zhe, Liu Zheng-Xin, He Xiang-Tao, Gong Li-Hua

Optica Applicata

|

2019

|

Vol. 49, nr 4

545--558

EN

An image compression and encryption algorithm by combining the advanced encryption standard (AES) with the hyper-chaotic system is designed, in which Arnold map is employed to eliminate part of the block effect in the image compression process. The original image is compressed with the assistance of a discrete cosine transform and then its transform coefficients are encrypted with the AES algorithm. Besides, the hyper-chaotic system is adopted to introduce the nonlinear processfor image encryption. Numerical simulations and theoretical analyses demonstrate that the proposed image compression and encryption algorithm is of high security and good compression performance.

11

Compressive-sensing-based double-image encryption algorithm combining double random phase encoding with Josephus traversing operation

Jiang Hao, Nie Zhe, Zhou Nanrun, Zhang Wenquan

Optica Applicata

|

2019

|

Vol. 49, nr 3

445--459

EN

A double-image encryption scheme based on compressive sensing is designed by combining a double random phase encoding technique with Josephus traversing operation. Two original images are first compressed and encrypted by compressive sensing in the discrete wavelet domain and then connected into a complex image according to the order of the alternate rows. Moreover, the resulting image is re-encrypted into stationary white noise by a double random phase encoding technique. Lastly, Josephus traversing method is utilized to scramble the transformed image. The initial states of the Henon chaotic map are the secret keys of this double-image encryption algorithm, which can be used to control the construction of the measurement matrix in compressive sensing and generation of the random-phase mask in double random phase encoding. Simulation results show that the proposed double-image encryption algorithm is effective and secure.

12

Image compression-encryption algorithm combining compressive sensing with log operation

Chen R.-L., Zhou Y., Luo M., Zhang A.-D., Gong L.-H.

Optica Applicata

|

2018

|

Vol. 48, nr 4

563--573

EN

Based on compressive sensing and log operation, a new image compression-encryption algorithm is proposed, which accomplishes encryption and compression simultaneously. The proposed image compression-encryption algorithm takes advantage of not only the physical realizability of partial Hadamard matrix, but also the resistance of the chosen-plaintext attack since all the elements in the partial Hadamard matrix are 1, –1 or log 1 = 0. The proposed algorithm is sensitive to the key and it can resist various common attacks. The simulation results verify the validity and reliability of the proposed image compression-encryption algorithm.

13

Color image encryption using singular value decomposition in discrete cosine Stockwell transform domain

Vaish A., Kumar M.

Optica Applicata

|

2018

|

Vol. 48, nr 1

25--38

EN

In this paper, an image encryption technique using singular value decomposition (SVD) and discrete cosine Stockwell transform (DCST) is proposed. The original source image is encrypted using bands of DCST along with the SVD decomposed images. The number of bands in DCST, parameters used to mask the singular values, the way of permutation used to shuffle the values of SVD transformed images and the way of arrangement of SVD matrices are used as encryption keys. It is necessary to have correct knowledge of all the keys along with their respective values, for correct decryption of encrypted images. The robustness and the quality measurement of proposed work are analyzed by comparing it with some existing works.

14

Nonlinear optical double image encryption using random-optical vortex in fractional Hartley transform domain

Singh H.

Optica Applicata

|

2017

|

Vol. 47, nr 4

557--578

EN

This paper proposed an enhanced asymmetric cryptosystem scheme for optical image encryption in the fractional Hartley transform domain. Grayscale and binary images have been encrypted separately using double random phase encoding. Phase masks based on optical vortex and random phase masks have been jointly used in spatial as well as in the Fourier planes. The images to be encrypted are first multiplied by optical vortex and random phase mask and then transformed with direct and inverse fractional Hartley transform for obtaining the encrypted images. The images are recovered from their corresponding encrypted images by using the correct parameters of the fractional Hartley transform and optical vortex, whose digital implementation has been performed using MATLAB 7.6.0 (R2008a). The random phase masks, optical vortex and transform orders associated with the fractional Hartley transform are extra keys that cause difficulty to an unauthorized user. Thus, the proposed asymmetric scheme is more secure as compared to conventional techniques. The efficacy of the proposed asymmetric scheme is verified by computing the mean squared error between recovered and the original images. The sensitivity of the asymmetric scheme is also verified with encryption parameters, noise and occlusion attacks. Numerical simulation results demonstrate the effectiveness and security performance of the proposed system.

15

Image encryption algorithm by using the logistic map and discrete fractional angular transform

Yu J., Li Y., Xie X., Zhou N., Zhou Z.

Optica Applicata

|

2017

|

Vol. 47, nr 1

141--155

EN

A new image encryption scheme based on logistic map and discrete fractional angular transform has been proposed. In the proposed scheme, the original image is encrypted with the random sequence generated by the logistic map, and the encrypted image is subsequently processed by the discrete fractional angular transform, which produces the ciphertext after double encryptions. The parameters of the logistic map and the order of the discrete fractional angular transform serve as the main keys of the image encryption algorithm. Simulation results show that the proposed image encryption algorithm can effectively resist the attacks of statistical analysis, and has acceptable encryption effect and security.

16

A known-plaintext attack on iterative random phase encoding in fractional Fourier domains

Yin F., He Q., Liu Z.

Optica Applicata

|

2017

|

Vol. 47, nr 1

131--139

EN

Known-plaintext attack is considered for decrypting the image generated by iterative random phase encoding in fractional Fourier transform domains. The double random phase encoding in Fourier domains is introduced to design the known-plaintext attack procedure. The decryption test is explored without both fractional order and these random phase masks. Some numerical simulations are made to demonstrate the validity of the known-plaintext attack.

17

Wybrane zagadnienia implementacyjne zaawansowanych algorytmów kryptografii wizualnej

Wiśniewski P., Ogiela M. R.

Pomiary Automatyka Kontrola

|

2014

|

R. 60, nr 12

1185--1188

PL

W publikacji scharakteryzowano dwa zaawansowane algorytmy kryptografii wizualnej: tzw. rozszerzoną kryptografię wizualną, w której istnieje możliwość umieszczenia fałszywych danych w sekretnych częściach obrazu, oraz skuteczną technikę szyfrowania obrazów kolorowych. Zaprezentowano także przykładową aplikację umożliwiającą użycie jednej z czterech metod oraz odczyt utajnionej informacji. Otrzymane wyniki działania opisywanych algorytmów potwierdzają wysoką skuteczność tego rodzaju technik kryptograficznych oraz zasadność ich praktycznego zastosowania.

EN

The paper presents two advanced visual cryptography algorithms: extended visual cryptography (EVCS) [2], where it is possible to place false information in shares of an image, and an effective encryption method for color images. This publication also presents an example application, which allows its user to execute one of four visual cryptography algorithms and to decrypt the secret information by joining shares. The first section shows the purpose of encrypting image data and main advantages of visual cryptography. In the second section an idea of secret sharing is presented. The third section describes visual cryptography techniques, where it is possible to create meaningful shares by encoding false information into shadow images. An example of (2,4)-threshold EVCS scheme is presented for a secret binary image. The fourth section presents a visual cryptography algorithm suitable for color images, which was analysed using a sample image. In the fifth section a visual cryptography system is proposed and its main features are presented, including procedure descriptions and obtained execution times of encryption algorithms. The summary presents the advantages of advanced visual cryptography algorithms and the utility of the application created for research. The obtained results of executing the described algorithms confirm the efficiency of these cryptographic techniques and the validity of its practical applications.

18

A Novel Image Encryption Scheme Based on Generalized Multi-sawtooth Maps

Ye R.

Fundamenta Informaticae

|

2014

|

Vol. 133, nr 1

87--104

EN

In this paper, a generalized multi-sawtooth map based image encryption scheme with an efficient permutation-diffusion mechanism is proposed. In the permutation process, a generalized multi-sawtooth map is utilized to generate one chaotic orbit used to get one index order sequence for the permutation of image pixel positions, while in the diffusion process, two generalized multi-sawtooth maps are employed to yield two pseudo-random grey value sequences for a twoway diffusion of pixel grey values. The yielded grey value sequences are not only sensitive to the control parameters and initial conditions of the considered chaotic maps, but also strongly depend on the plain-image processed, therefore the proposed scheme can effectively resist statistical attack, differential attack, known-plaintext as well as chosen-plaintext attack. Experimental results show that the new image encryption scheme has satisfactory security thanks to its large key space and robust permutation-diffusion mechanism, which makes it a potential candidate for designing image encryption schemes.

19

Image encryption using edge diffusion and selective permutations in orthogonal polynomials based transformation domain

Krishnamoorthi R., Sheba Kezia Malarchelvi P. D.

Image Processing & Communications

|

2009

|

Vol. 14, no 4

13-27

EN

This paper proposes a new image encryption technique in orthogonal polynomials based transformation domain (OPT) with edge diffusion and selective combinational permutations for secure transmission of images. In this technique, we propose the use of the polynomials based edge detection algorithm to decompose the image blocks into edge blocks and non-edge blocks. The edge blocks are first encrypted with a cryptographic algorithm and then a selective combinational permutation is applied over the low frequency coefficients of the edge as well as non-edge blocks in order to reduce the number of bits to be permuted. Then a combinational shuffling of bits, coefficients and blocks are carried out in addition to sign bit encryption. A symmetric key based cryptographically secure pseudo random process controls the entire encryption process. Experimental results reveal that the proposed encryption scheme provides very low encryption PSNRs and security analyses prove that the proposed technique offers effective encryption.

20

A Digital Image Encryption Algorithm Based on Hyper-chaotic Cellular Neural Network

Peng J., Zhang D., Liao X.

Fundamenta Informaticae

|

2009

|

Vol. 90, nr 3

269-282

EN

Using Chaotic characteristics of dynamic system is a promising direction to design cryptosystems that play a pivotal role in a very important engineering application of cognitive informatics, i.e., information assurance and security. However, encryption algorithms based on the lowdimensional chaotic maps face a potential risk of the keystream being reconstructed via return map technique or neural network method. In this paper, we propose a new digital image encryption algorithm that employs a hyper-chaotic cellular neural network. To substantiate its security characteristics, we conduct the following security analyses of the proposed algorithm: key space analysis, sensitivity analysis, information entropy analysis and correlation coefficients analysis of adjacent pixels. The results demonstrate that the proposed encryption algorithm has desirable security properties and can be deployed as a cornerstone in a sound security cryptosystem. The comparison of the proposed algorithm with five other chaos-based image encryption algorithms indicates that our algorithm has a better security performance.