Orabe Almanaseer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Orabe Almanaseer has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Abeer Al-Hyari
Electrical Engineering Department, Al-Balqa Applied University, As Salt 19117, Jordan
2 shared publications - Ismail Altaharwa
Department of Computer Information Systems, The University of Jordan, Aqaba, Jordan
2 shared publications - Mua'Ad Abu-Faraj
Department of Computer Information Systems, School of Information Technology and Systems, The University of Jordan, Aqaba 77110, Jordan
2 shared publications - Charlie Obimbo
School of Computer Science, University of Guelph, Guelph, ON N1G 2W1, Canada
1 shared publication - Khaled Aldebei
Department of Information Technology, The University of Jordan, Aqaba, Jordan
1 shared publication - Malik Al-Essa
Department of Computer Science, The University of Jordan, Amman 11942, Jordan
1 shared publication
Latest Publications
- Open Access
- 5 November 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (6) , 81
Authenticated Content-Aware Image Encryption Using HMAC-SHA-256, Dynamic DNA Coding, and a 2D-LSCM Hyperchaotic Map
Chaos-based ciphers are widely proposed for sensitive images on 5G and Internet of Things links. Three faults recur: a key stream derived from the image that the receiver cannot reproduce, chaos that is claimed but not verified, and ciphertext that is not authenticated. This article presents an image cipher that removes all three. A shared secret key, a fresh per-image random value, and a digest of the image are combined through a keyed hash to derive every parameter; the digest travels masked, so the receiver rebuilds the key stream exactly and the header reveals nothing about the image. A two-dimensional chaotic map with a measured operating range and arithmetic that every platform reproduces bit-for-bit drives a pixel permutation and a DNA coding whose rules change from byte to byte. A tag over header and ciphertext is checked before decryption, and a standard ChaCha20 stream can replace the chaotic stage. On the Kodak suite the ciphertexts reach 7.9995 bits of entropy per byte, pixel correlation below 0.01, and differential statistics inside their acceptance bands; on 3330 further remote sensing, medical, and mixed content images the tests reject at their nominal rates, and NIST SP 800-22 passes under five independent keys. The security evidence is empirical and design-level; standardized authenticated encryption remains preferable where a formal proof is required.
- 5 November 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (6) , 81
Open AccessAuthenticated Content-Aware Image Encryption Using HMAC-SHA-256, Dynamic DNA Coding, and a 2D-LSCM Hyperchaotic Map
Chaos-based ciphers are widely proposed for sensitive images on 5G and Internet of Things links. Three faults recur: a key stream derived from the image that the receiver cannot reproduce, chaos that is claimed but not verified, and ciphertext that is not authenticated. This article presents an image cipher that removes all three. A shared secret key, a fresh per-image random value, and a digest of the image are combined through a keyed hash to derive every parameter; the digest travels masked, so the receiver rebuilds the key stream exactly and the header reveals nothing about the image. A two-dimensional chaotic map with a measured operating range and arithmetic that every platform reproduces bit-for-bit drives a pixel permutation and a DNA coding whose rules change from byte to byte. A tag over header and ciphertext is checked before decryption, and a standard ChaCha20 stream can replace the chaotic stage. On the Kodak suite the ciphertexts reach 7.9995 bits of entropy per byte, pixel correlation below 0.01, and differential statistics inside their acceptance bands; on 3330 further remote sensing, medical, and mixed content images the tests reject at their nominal rates, and NIST SP 800-22 passes under five independent keys. The security evidence is empirical and design-level; standardized authenticated encryption remains preferable where a formal proof is required.
- Open Access
- 7 April 2023
- Published by MDPI AG in Cryptography
- Vol. 7 (2) , 20
Protecting Digital Images Using Keys Enhanced by 2D Chaotic Logistic Maps
This research paper presents a novel digital color image encryption approach that ensures high-level security while remaining simple and efficient. The proposed method utilizes a composite key r and x of 128-bits to create a small in-dimension private key (a chaotic map), which is then resized to match the color matrix dimension. The proposed method is uncomplicated and can be applied to any image without any modification. Image quality, sensitivity analysis, security analysis, correlation analysis, quality analysis, speed analysis, and attack robustness analysis are conducted to prove the efficiency and security aspects of the proposed method. The speed analysis shows that the proposed method improves the performance of image cryptography by minimizing encryption–decryption time and maximizing the throughput of the process of color cryptography. The results demonstrate that the proposed method provides better throughput than existing methods. Overall, this research paper provides a new approach to digital color image encryption that is highly secure, efficient, and applicable to various images.
- 7 April 2023
- Published by MDPI AG in Cryptography
- Vol. 7 (2) , 20
Open AccessProtecting Digital Images Using Keys Enhanced by 2D Chaotic Logistic Maps
This research paper presents a novel digital color image encryption approach that ensures high-level security while remaining simple and efficient. The proposed method utilizes a composite key r and x of 128-bits to create a small in-dimension private key (a chaotic map), which is then resized to match the color matrix dimension. The proposed method is uncomplicated and can be applied to any image without any modification. Image quality, sensitivity analysis, security analysis, correlation analysis, quality analysis, speed analysis, and attack robustness analysis are conducted to prove the efficiency and security aspects of the proposed method. The speed analysis shows that the proposed method improves the performance of image cryptography by minimizing encryption–decryption time and maximizing the throughput of the process of color cryptography. The results demonstrate that the proposed method provides better throughput than existing methods. Overall, this research paper provides a new approach to digital color image encryption that is highly secure, efficient, and applicable to various images.