Találati lista | Tudóstér

001-es BibID:	BIBFORM121767
035-os BibID:	(WoS)000769957000001 (Scopus)85124754177
Első szerző:	Abduljabbar, Zaid Ameen
Cím:	Provably Secure and Fast Color Image Encryption Algorithm Based on S-Boxes and Hyperchaotic Map / Zaid Ameen Abduljabbar, Iman Qays Abduljaleel, Junchao Ma, Mustafa A. Al Sibahee, Vincent Omollo Nyangaresi, Dhafer G. Honi, Ayad I. Abdulsada, Xianlong Jiao
Dátum:	2022
ISSN:	2169-3536
Megjegyzések:	The World Wide Web is experiencing a daily increase in data transmission because of developments in multimedia technologies. Consequently, each user should prioritize preventing illegal access of this data by encrypting it before moving it over the Internet. Numerous color image encryption schemes have been developed to protect data security and privacy, indifferent to the computation cost. However, most of these schemes have high computational complexities. This research proposes a fast color image scrambling and encryption algorithm depending on different chaotic map types and an S-box that relies on a hyperchaotic map principle. The first step involves converting color image values from decimal representation to binary representation in the scrambling stage by changing the location of the bits according to a proposed swapping algorithm. Next, in the second scrambling stage, the same process occurs after returning color image values from binary representation to decimal representation and generating an S-box with the assistance of two types of chaotic map,namely,a 2D Zaslavsky map and a 3D Hénon map.Thus,this S-box is relied upon to swap the locations of the pixels in the color image. The encryption procedure begins with the production of three key matrices using a hybrid technique that employs two low-complexity types of chaotic map, namely, a 1D Logistic map and a 3D Hénon map, followed by an XORed as a lightweight process between each key generated for the three matrices and the corresponding red, green, and blue image channels. According to the findings, the proposed scheme demonstrates the most efficiency in terms of lowering the computational cost and shows its effectiveness against a wide range of cryptographic attacks.
Tárgyszavak:	Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény külföldi lapban folyóiratcikk Pixel mixing chaos fast encryption S-box Zaslavsky map color image
Megjelenés:	IEEE Access. - 10 (2022), p. 26257-26270. -
További szerzők:	Abduljaleel, Iman Qays Ma, Junchao Sibahee, Mustafa A. Al Nyangaresi, Vincent Omollo Alshuwaili, Dhafer Gheni Honi (1991) (Informatics)(PhD) Abdulsada, Ayad I. Jiao, Xianlong
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: