Double Random Phase Encoding Based Optical Encryption Systems Using Some Linear Canonical Transforms: Weaknesses and Countermeasures

Kumar, Pramod; Joseph, Joby; Singh, Kehar

doi:10.1007/978-1-4939-3028-9_13

Cited by 31 publications

(4 citation statements)

References 135 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DPRE process applies to a phase image a random phase mask followed by a Fourier transform twice in series. While the DPRE scheme maximizes the entropy of the encrypted image, the linearity of the scheme creates vulnerabilities [66], [67]. Thus, [62] proposed an encryption scheme that applies a chaotic pixel mapping based on the famous 3D Lorenz System after the first Fourier transform.…”

Section: Encryption Using Dst Algorithmsmentioning

confidence: 99%

Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms

Perera

Lingsch

2021

IEEE Access

View full text Add to dashboard Cite

This paper presents factorizations of each discrete sine transform (DST) matrices of types I, II, III, and IV into a product of sparse, diagonal, bidiagonal, and scaled orthogonal matrices. Based on the proposed matrix factorization formulas, reduced multiplication complexity, recursive, and radix-2 DST-I/II/III/IV algorithms are presented. We will present the lowest multiplication complexity DST-IV algorithm in the literature. The paper fills a gap in the self-recursive, exact, and radix-2 DST-I/II/III algorithms executed via diagonal, bidiagonal, scaled orthogonal, and simple matrix factors for any input n = 2 t (t ≥ 1). The paper establishes a novel relationship between DST-II and DST-IV matrices using diagonal and bidiagonal matrices. Similarly, a novel relationship between DST-I and DST-III matrices is proposed using sparse and diagonal matrices. These interweaving relationships among DST matrices enable us to bridge the existing factorizations of the DST matrices with the proposed factorization formulas. We present signal flow graphs to provide a layout for realizing the proposed algorithms in DST-based integrated circuit designs. Additionally, we describe an implementation of algorithms based on the proposed DST-II and DST-III factorizations within a double random phase encoding (DRPE) image encryption scheme.INDEX TERMS Discrete sine transforms, self/completely recursive and radix-2 algorithms, complexity and performance of algorithms, sparse and orthogonal matrices, signal flow graphs VOLUME ....

show abstract

Section: Encryption Using Dst Algorithmsmentioning

confidence: 99%

Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms

Perera

Lingsch

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…4) The algorithms include a set of weak keys (a sequence of consecutive 1's or 0's) that further weakens the algorithm [15]. 5) The same process of encryption is repeated for a predetermined number of rounds irrespective of the significance of data.…”

Section: Issues In Conventional Symmetric Algorithmsmentioning

confidence: 99%

FPGA Implementation of Non-Linear Cryptography

Prabakar¹,

Lakshmi²,

Seetharaman³

2016

View full text Add to dashboard Cite

The paper focuses on the design and Field Programmable Gate Array (FPGA) implementation of embedded system for time based dual encryption scheme with Delay Compulsion Function (DCF) and also illustrates the application of DCF in time based cryptography. Further, the strength of the time based FPGA encryption algorithm with and without using DCF is analyzed using a Nios II processor. This proposed scheme enhances the security of vital data against Brute force attack by incorporating a temporal key distribution where two different keys encrypt the data simultaneously, one being the regular key and the other being the time. The time is included using a dynamically varying number of shifts thereby allowing the system to wait for the duration and this forms the second dimension of the key. Presently, available encryption systems suffer from Brute Force attack in which all the key combinations are tried in order to find the correct key. In such a case, the time taken for breaking the key depends on the speed of the system used for cryptanalysis. The proposed system adds complexity by using dynamically varying sequence of operations, by including the time as a second dimension of the key besides minimizing the possibility of Brute Force attack and increasing the time required for cryptanalysis irrespective of the system capability. As the proposed system needs concurrent execution and real time processing, the system is implemented using Altera Stratix II FPGA and the results are presented.

show abstract

“…In the meantime, Refregier and Javidi [2] proposed DRPE and it has practised countless enhancements and enlargements by hosting few parameters such as wavelength, propagation distance, and polarization. Various transforms such as discrete cosine transforms (DCT) [3][4][5][6], Fresnel transforms (FrT) [7][8][9][10][11][12], Gyrator transforms (GT) [13][14][15], Hartley transforms (HT) [16][17][18], Fractional Fourier Transforms (FrFT) [19][20][21][22][23][24][25][26][27][28] and LCT [29][30][31][32][33][34][35][36][37][38] are pooled with DRPE system. These transforms are prepared with symmetric cryptosystem.…”

Section: Introductionmentioning

confidence: 99%

Cryptanalysis of DRPE using complex S-Box based on linear canonical transform

Girija

Singh

Abirami

2022

Multimed Tools Appl

View full text Add to dashboard Cite

During recent decades, double random phase encoding grasped more attention for researchers. To achieve nonlinearity, it had been done with random S-Box. We exhibit this involvement that DRPE system is much vulnerable in the above methodology. Concatenating anything with DRPE needs an imaginary value, wherein s-box unsuccessful in it. Used S-box has been reformed into various sizes. Due to this scenario, S-box values are replicating. So, complex S-box has been employed and proposed size of the s-box is similar to an input image. Numerical simulations have been performed out to validate the practicability and trustworthiness of traditional DRPE system with complex S-box.

show abstract

Double Random Phase Encoding Based Optical Encryption Systems Using Some Linear Canonical Transforms: Weaknesses and Countermeasures

Cited by 31 publications

References 135 publications

Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms

Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms

FPGA Implementation of Non-Linear Cryptography

Cryptanalysis of DRPE using complex S-Box based on linear canonical transform

Contact Info

Product

Resources

About