Path: Top -> Journal -> Jurnal Internasional -> King Saud University -> 2021 -> Volume 33, Issue 5, June
A randomized CPA-secure asymmetric-key chaotic color image encryption scheme based on the Chebyshev mappings and one-time pad
Oleh : Ali Shakiba, King Saud University
Dibuat : 2022-02-14, dengan 0 file
Keyword : Chaotic encryption, One-time pad, Color image encryption, Asymmetric-key encryption, Chebyshev mapping, Chosen Plaintext Attack (CPA)
Url : http://www.sciencedirect.com/science/article/pii/S1319157818311832
Sumber pengambilan dokumen : web
In this paper, a novel randomized chaotic asymmetric-key algorithm is proposed for color image encryption. Using the multiplicative coupled Chebyshev-based encryption algorithm, a novel chaotic key establishment algorithm using Chebyshev polynomials is proposed. This key establishment algorithm is used to generate three chaotic pseudo-random number sequences to permute the rows and the columns of the plain image randomly. Then, each pixel is XORed with respect to a random value obtained based on its new position to mask its value. The whole encryption algorithm is randomized, so it can resist chosen plaintext attacks. The experimental and security analysis of the proposed algorithm shows that the proposed algorithm has a large keyspace, a good level of security, and an acceptable level of robustness.
Deskripsi Alternatif :In this paper, a novel randomized chaotic asymmetric-key algorithm is proposed for color image encryption. Using the multiplicative coupled Chebyshev-based encryption algorithm, a novel chaotic key establishment algorithm using Chebyshev polynomials is proposed. This key establishment algorithm is used to generate three chaotic pseudo-random number sequences to permute the rows and the columns of the plain image randomly. Then, each pixel is XORed with respect to a random value obtained based on its new position to mask its value. The whole encryption algorithm is randomized, so it can resist chosen plaintext attacks. The experimental and security analysis of the proposed algorithm shows that the proposed algorithm has a large keyspace, a good level of security, and an acceptable level of robustness.
Beri Komentar ?#(0) | Bookmark
| Properti | Nilai Properti |
|---|---|
| ID Publisher | gdlhub |
| Organisasi | King Saud University |
| Nama Kontak | Herti Yani, S.Kom |
| Alamat | Jln. Jenderal Sudirman |
| Kota | Jambi |
| Daerah | Jambi |
| Negara | Indonesia |
| Telepon | 0741-35095 |
| Fax | 0741-35093 |
| E-mail Administrator | elibrarystikom@gmail.com |
| E-mail CKO | elibrarystikom@gmail.com |
Print ...
Kontributor...
- Editor: Calvin