Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption Application
This article presents a cryptographic encryption standard whose model is based on Serpent presented by Eli Biham, Ross Anderson, and Lars Knudsen. The modification lies in the design of the Cipher, we have used power associative (PA) loop and group of permutations. The proposed mathematical structur...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10080958/ |
| _version_ | 1797855312687923200 |
|---|---|
| author | Sadam Hussain Muhammad Asif Tariq Shah Abid Mahboob Sayed M. Eldin |
| author_facet | Sadam Hussain Muhammad Asif Tariq Shah Abid Mahboob Sayed M. Eldin |
| author_sort | Sadam Hussain |
| collection | DOAJ |
| description | This article presents a cryptographic encryption standard whose model is based on Serpent presented by Eli Biham, Ross Anderson, and Lars Knudsen. The modification lies in the design of the Cipher, we have used power associative (PA) loop and group of permutations. The proposed mathematical structure is superior to Galois Field (GF) in terms of complexity and has the ability to create arbitrary randomness due to a larger key space. The proposed method is simple and speedy in terms of computations, meanwhile it affirms higher security and sensitivity. In contrast to GF, PA-loop are non-isomorphic and have several Cayley table representations. This validates the resistance to cryptanalytic attacks, particularly those targeting mathematical structures. This cryptographic scheme’s full description of encryption and decryption is measured and rigorously assessed to support its multimedia applications. The observed speed of this technique, which uses a key of 256 bits and a block size of 128 bits, is comparable to three-key triple-DES. |
| first_indexed | 2024-04-09T20:21:40Z |
| format | Article |
| id | doaj.art-14f9022a1afc42308b6ec5b3ed44721a |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-09T20:21:40Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-14f9022a1afc42308b6ec5b3ed44721a2023-03-30T23:01:05ZengIEEEIEEE Access2169-35362023-01-0111296982971010.1109/ACCESS.2023.326156810080958Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption ApplicationSadam Hussain0https://orcid.org/0000-0001-6474-0452Muhammad Asif1https://orcid.org/0000-0001-5684-4737Tariq Shah2https://orcid.org/0000-0002-6587-1638Abid Mahboob3Sayed M. Eldin4Department of Mathematics, Government Graduate College, Qila Didar Singh, Gujranwala, PakistanDepartment of Mathematics, University of Management and Technology, Sialkot Campus, Sialkot, PakistanDepartment of Mathematics, Quaid-i-Azam University, Islamabad, PakistanDepartment of Mathematics, Division of Science and Technology, University of Education, Lahore, PakistanCenter of Research, Faculty of Engineering, Future University in Egypt, New Cairo, EgyptThis article presents a cryptographic encryption standard whose model is based on Serpent presented by Eli Biham, Ross Anderson, and Lars Knudsen. The modification lies in the design of the Cipher, we have used power associative (PA) loop and group of permutations. The proposed mathematical structure is superior to Galois Field (GF) in terms of complexity and has the ability to create arbitrary randomness due to a larger key space. The proposed method is simple and speedy in terms of computations, meanwhile it affirms higher security and sensitivity. In contrast to GF, PA-loop are non-isomorphic and have several Cayley table representations. This validates the resistance to cryptanalytic attacks, particularly those targeting mathematical structures. This cryptographic scheme’s full description of encryption and decryption is measured and rigorously assessed to support its multimedia applications. The observed speed of this technique, which uses a key of 256 bits and a block size of 128 bits, is comparable to three-key triple-DES.https://ieeexplore.ieee.org/document/10080958/Non-associativitypower associative loopS-boxesimage encryption |
| spellingShingle | Sadam Hussain Muhammad Asif Tariq Shah Abid Mahboob Sayed M. Eldin Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption Application IEEE Access Non-associativity power associative loop S-boxes image encryption |
| title | Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption Application |
| title_full | Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption Application |
| title_fullStr | Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption Application |
| title_full_unstemmed | Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption Application |
| title_short | Redesigning the Serpent Algorithm by PA-Loop and Its Image Encryption Application |
| title_sort | redesigning the serpent algorithm by pa loop and its image encryption application |
| topic | Non-associativity power associative loop S-boxes image encryption |
| url | https://ieeexplore.ieee.org/document/10080958/ |
| work_keys_str_mv | AT sadamhussain redesigningtheserpentalgorithmbypaloopanditsimageencryptionapplication AT muhammadasif redesigningtheserpentalgorithmbypaloopanditsimageencryptionapplication AT tariqshah redesigningtheserpentalgorithmbypaloopanditsimageencryptionapplication AT abidmahboob redesigningtheserpentalgorithmbypaloopanditsimageencryptionapplication AT sayedmeldin redesigningtheserpentalgorithmbypaloopanditsimageencryptionapplication |