2021
DOI: 10.1155/2021/5510125
|View full text |Cite
|
Sign up to set email alerts
|

A Secure Asymmetric Optical Image Encryption Based on Phase Truncation and Singular Value Decomposition in Linear Canonical Transform Domain

Abstract: A new asymmetric optical double image encryption algorithm is proposed, which combines phase truncation and singular value decomposition. The plain text is encrypted with two-stage phase keys to obtain a uniformly distributed cipher text and two new decryption keys. These keys are generated during the encryption process and are different from encryption keys. It realizes asymmetric encryption and improves the security of the system. The unscrambling keys in the encryption operation are mainly related to plain … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 84 publications
(84 reference statements)
0
5
0
Order By: Relevance
“…The singular-value decomposition of a matrix means that for a non-zero real number matrix A of any size M × N , it can be expressed as the product of two-unit orthogonal matrices and a diagonal matrix [ 37 ]. The singular-value decomposition can be written in the following form: where S is a singular-value matrix, S = diag , the diagonal elements of S matrix are r singular values of matrix A , U and V are two orthogonal matrices, and each column element of U and V represents the left singular vector and the right singular vector, respectively—that is, , .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The singular-value decomposition of a matrix means that for a non-zero real number matrix A of any size M × N , it can be expressed as the product of two-unit orthogonal matrices and a diagonal matrix [ 37 ]. The singular-value decomposition can be written in the following form: where S is a singular-value matrix, S = diag , the diagonal elements of S matrix are r singular values of matrix A , U and V are two orthogonal matrices, and each column element of U and V represents the left singular vector and the right singular vector, respectively—that is, , .…”
Section: Methodsmentioning
confidence: 99%
“…The singular-value decomposition of a matrix means that for a non-zero real number matrix A of any size M × N, it can be expressed as the product of two-unit orthogonal matrices and a diagonal matrix [37]. The singular-value decomposition can be written in the following form:…”
Section: Singular-value Decompositionmentioning
confidence: 99%
“…According to the computed RMSE and PSNR values, the obtained image can be practically same to the original image. Table 1 presents the comparison results of the computed RMSE and PSNR values of the proposed method of PE-DRPE with Qasim et al [15], Girija et al [34], and Sangwan et al [35] in the LCT domain.…”
Section: Performance Analysismentioning
confidence: 99%
“…These obtained results for NPCR and UACI values demonstratet that the proposed scheme is very sensitive with respect to original image. Table 4 demonstrates the comparison results of the computed NPCR and UACI values of the proposed method with Qasim et al [15], and Sangwan et al [35] in the LCT domain.…”
Section: Attack Analysismentioning
confidence: 99%
“…In asymmetric scheme with the knowledge of only encryption key, it is challenging to retrieve the image. Therefore, other asymmetric schemes [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26] were also proposed. The issue of optical axis alignment affects the traditional DRPE method.…”
Section: Introductionmentioning
confidence: 99%