Wafaa S. Sayed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wafaa S. Sayed has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Gomaa Radwan
Engineering Mathematics and Physics Department, Faculty of Engineering, Cairo University, Giza 12613, Egypt
32 shared publications - Lobna A. Said
Nanoelectronics Integrated Systems Center (NISC), Nile University, Giza, Egypt
16 shared publications - Salwa Kamal Abd‐El‐Hafiz
Cairo University
10 shared publications Hossam A. H. Fahmy
Cairo University
9 shared publications- Bishoy K. Sharobim
Nanoelectronics Integrated Systems Center (NISC), Nile University, Giza, Egypt
5 shared publications Lobna A. Said
Nile University,Nanoelectronics Integrated Systems Center (NISC),Giza,Egypt,12588
4 shared publications
Latest Publications
- Open Access
- 24 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 743
Enhanced image encryption via a newly modified hyperchaotic lorenz system and extended DNA computing
The growing threat of cyberattacks targeting digital images calls for robust, efficient encryption schemes to secure sensitive visual data. This paper proposes an enhanced RGB image encryption scheme that integrates a newly modified five-dimensional (5D) hyperchaotic Lorenz system featuring two positive Lyapunov eigenvalues and a Kaplan-Yorke dimension $$D_{KY}=3.809$$ with an extended eight-base DNA computing framework and a hash-based dynamic key generation mechanism. The chaotic sequences drive a three-stage encryption pipeline: DNA encoding and arithmetic operations for pixel-level confusion, adaptive circular permutation for spatial scrambling, and feedback-driven XOR diffusion for greater pixel dependency. Experimental evaluation on standard USC-SIPI benchmark images (512 $$\times $$ 512) demonstrated high security, achieving an average information entropy of 7.9993, NPCR of 99.62%, and UACI of 33.46 %, all within optimal thresholds. The proposed scheme features a key space exceeding $$2^{465}$$ , far exceeding the recommended $$2^{100}$$ threshold and successfully passing all 15 NIST 800-22 randomness tests. Encryption and decryption are completed in 1.24 s and 1.28 s, respectively, confirming practical computational effectiveness. Comparative evaluations prove robustness against statistical, differential, occlusion, cropping, known-plaintext, and chosen-plaintext attacks, confirming its suitability for secure image communication.- 24 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 743
Open AccessEnhanced image encryption via a newly modified hyperchaotic lorenz system and extended DNA computing
The growing threat of cyberattacks targeting digital images calls for robust, efficient encryption schemes to secure sensitive visual data. This paper proposes an enhanced RGB image encryption scheme that integrates a newly modified five-dimensional (5D) hyperchaotic Lorenz system featuring two positive Lyapunov eigenvalues and a Kaplan-Yorke dimension $$D_{KY}=3.809$$ with an extended eight-base DNA computing framework and a hash-based dynamic key generation mechanism. The chaotic sequences drive a three-stage encryption pipeline: DNA encoding and arithmetic operations for pixel-level confusion, adaptive circular permutation for spatial scrambling, and feedback-driven XOR diffusion for greater pixel dependency. Experimental evaluation on standard USC-SIPI benchmark images (512 $$\times $$ 512) demonstrated high security, achieving an average information entropy of 7.9993, NPCR of 99.62%, and UACI of 33.46 %, all within optimal thresholds. The proposed scheme features a key space exceeding $$2^{465}$$ , far exceeding the recommended $$2^{100}$$ threshold and successfully passing all 15 NIST 800-22 randomness tests. Encryption and decryption are completed in 1.24 s and 1.28 s, respectively, confirming practical computational effectiveness. Comparative evaluations prove robustness against statistical, differential, occlusion, cropping, known-plaintext, and chosen-plaintext attacks, confirming its suitability for secure image communication. - Open Access
- 30 October 2024
- Published by MDPI AG in Electronics
- Vol. 13 (21) , 4254
Hardware Implementation of a 2D Chaotic Map-Based Audio Encryption System Using S-Box
This paper presents a hardware-based audio encryption system using a 2D chaotic map and dynamic S-box design implemented on an Artix-7 FPGA platform. Three distinct chaotic maps—logistic–fraction (2D-LF), logistic–sine (2D-LS), and fraction–sine (2D-FS)—were investigated and implemented on an FPGA. The 2D-LF map was employed in the encryption system for its throughput and power efficiency performance. The proposed encryption system benefits from the randomness of chaotic sequences for block permutation and S-box substitution to enhance the diffusion and confusion properties of the encrypted speech signal. The system’s encryption strength is validated through performance evaluations, using the mean squared error (MSE), signal-to-noise ratio (SNR), correlation coefficients, and NIST randomness tests, which confirm the unpredictability of the encrypted speech signal. The hardware implementation results show a throughput of 2880 Mbps and power consumption of 0.13 W.
- 30 October 2024
- Published by MDPI AG in Electronics
- Vol. 13 (21) , 4254
Open AccessHardware Implementation of a 2D Chaotic Map-Based Audio Encryption System Using S-Box
This paper presents a hardware-based audio encryption system using a 2D chaotic map and dynamic S-box design implemented on an Artix-7 FPGA platform. Three distinct chaotic maps—logistic–fraction (2D-LF), logistic–sine (2D-LS), and fraction–sine (2D-FS)—were investigated and implemented on an FPGA. The 2D-LF map was employed in the encryption system for its throughput and power efficiency performance. The proposed encryption system benefits from the randomness of chaotic sequences for block permutation and S-box substitution to enhance the diffusion and confusion properties of the encrypted speech signal. The system’s encryption strength is validated through performance evaluations, using the mean squared error (MSE), signal-to-noise ratio (SNR), correlation coefficients, and NIST randomness tests, which confirm the unpredictability of the encrypted speech signal. The hardware implementation results show a throughput of 2880 Mbps and power consumption of 0.13 W.
- Open Access
- 6 May 2024
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 21 (3) , 1-16
Software and hardware realizations for different designs of chaos-based secret image sharing systems
Secret image sharing (SIS) conveys a secret image to mutually suspicious receivers by sending meaningless shares to the participants, and all shares must be present to recover the secret. This paper proposes and compares three systems for secret sharing, where a visual cryptography system is designed with a fast recovery scheme as the backbone for all systems. Then, an SIS system is introduced for sharing any type of image, where it improves security using the Lorenz chaotic system as the source of randomness and the generalized Arnold transform as a permutation module. The second SIS system further enhances security and robustness by utilizing SHA-256 and RSA cryptosystem. The presented architectures are implemented on a field programmable gate array (FPGA) to enhance computational efficiency and facilitate real-time processing. Detailed experimental results and comparisons between the software and hardware realizations are presented. Security analysis and comparisons with related literature are also introduced with good results, including statistical tests, differential attack measures, robustness tests against noise and crop attacks, key sensitivity tests, and performance analysis.
- 6 May 2024
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 21 (3) , 1-16
Open AccessSoftware and hardware realizations for different designs of chaos-based secret image sharing systems
Secret image sharing (SIS) conveys a secret image to mutually suspicious receivers by sending meaningless shares to the participants, and all shares must be present to recover the secret. This paper proposes and compares three systems for secret sharing, where a visual cryptography system is designed with a fast recovery scheme as the backbone for all systems. Then, an SIS system is introduced for sharing any type of image, where it improves security using the Lorenz chaotic system as the source of randomness and the generalized Arnold transform as a permutation module. The second SIS system further enhances security and robustness by utilizing SHA-256 and RSA cryptosystem. The presented architectures are implemented on a field programmable gate array (FPGA) to enhance computational efficiency and facilitate real-time processing. Detailed experimental results and comparisons between the software and hardware realizations are presented. Security analysis and comparisons with related literature are also introduced with good results, including statistical tests, differential attack measures, robustness tests against noise and crop attacks, key sensitivity tests, and performance analysis.
- 1 May 2024
- Published by Springer Nature
- p. 153-161
Compact Multiplier-less CORDIC-Based FPGA Implementation of Sine and Modified Sine Chaotic Maps
- 1 May 2024
- Published by Springer Nature
- p. 153-161
Compact Multiplier-less CORDIC-Based FPGA Implementation of Sine and Modified Sine Chaotic Maps
- 1 May 2024
- Published by Springer Nature
- p. 371-380
Generalized Fractional-Order Complex Logistic Map and Fractals on FPGA
- 1 May 2024
- Published by Springer Nature
- p. 371-380
Generalized Fractional-Order Complex Logistic Map and Fractals on FPGA
- 17 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 32-35
Modified Arnold Transform and DNA Manipulation for Chaos-Based RGB Image Encryption
Multimedia applications use image encryption algorithms extensively to safeguard and authenticate digital images. This paper presents an RGB image encryption method, which uses Chaos, DNA, pixel sum, and modified Arnold transform. The suggested algorithm is validated to be robust and resistant to visual, statistical, differential, and brute-force attacks. Additionally, the resulting encrypted images pass all tests of the NIST SP 800-22 test suite.
- 17 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 32-35
Modified Arnold Transform and DNA Manipulation for Chaos-Based RGB Image Encryption
Multimedia applications use image encryption algorithms extensively to safeguard and authenticate digital images. This paper presents an RGB image encryption method, which uses Chaos, DNA, pixel sum, and modified Arnold transform. The suggested algorithm is validated to be robust and resistant to visual, statistical, differential, and brute-force attacks. Additionally, the resulting encrypted images pass all tests of the NIST SP 800-22 test suite.
- Open Access
- 5 December 2023
- Published by MDPI AG in Electronics
- Vol. 12 (24) , 4895
A Lightweight Image Encryption Scheme Using DNA Coding and Chaos
Protecting transmitted multimedia data such as images is a significant concern. This work proposes an encryption algorithm for greyscale images using a Pseudo-Random Number Generator (PRNG), DNA coding, and pixel sum. The proposed approach is implemented on a Genesys 2 FPGA using minimal hardware resources and can operate at a maximum frequency of 110.8 MHz. In addition, several performance evaluation tests are conducted for multiple images, including statistical analysis of the encrypted image, keyspace analysis, and differential attack analysis. The system is compared to recent works with respect to encryption quality and used hardware resources. The proposed scheme outperformed recent chaos-based image encryption schemes.
- 5 December 2023
- Published by MDPI AG in Electronics
- Vol. 12 (24) , 4895
Open AccessA Lightweight Image Encryption Scheme Using DNA Coding and Chaos
Protecting transmitted multimedia data such as images is a significant concern. This work proposes an encryption algorithm for greyscale images using a Pseudo-Random Number Generator (PRNG), DNA coding, and pixel sum. The proposed approach is implemented on a Genesys 2 FPGA using minimal hardware resources and can operate at a maximum frequency of 110.8 MHz. In addition, several performance evaluation tests are conducted for multiple images, including statistical analysis of the encrypted image, keyspace analysis, and differential attack analysis. The system is compared to recent works with respect to encryption quality and used hardware resources. The proposed scheme outperformed recent chaos-based image encryption schemes.
- Open Access
- 22 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 38-45
Pixel-based Visual Secret Sharing Using Lorenz System
(n, n)-Visual Secret Sharing (VSS) allows a user to send an image in the form of shares to different participants. Every share can not reveal the secret alone, and only all shares together can reveal the secret with fast recovery. This paper proposes a pixel-based (n, n)-VSS system, where to share a pixel from the secret image, (n − 1) random pixels are generated from the Lorenz chaotic system for a varying set of (n − 1) shares. Then, the nth pixel is calculated for a random share using the secret pixel and the generated (n − 1) random pixels. The system is efficient, lossless, implemented for grayscale and color images, and has a simple XOR-based recovery scheme. It passed several security analysis tests and is robust against noise attacks. Moreover, performance analysis and comparisons with other VSS systems are presented, showing good results.
- 22 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 38-45
Open AccessPixel-based Visual Secret Sharing Using Lorenz System
(n, n)-Visual Secret Sharing (VSS) allows a user to send an image in the form of shares to different participants. Every share can not reveal the secret alone, and only all shares together can reveal the secret with fast recovery. This paper proposes a pixel-based (n, n)-VSS system, where to share a pixel from the secret image, (n − 1) random pixels are generated from the Lorenz chaotic system for a varying set of (n − 1) shares. Then, the nth pixel is calculated for a random share using the secret pixel and the generated (n − 1) random pixels. The system is efficient, lossless, implemented for grayscale and color images, and has a simple XOR-based recovery scheme. It passed several security analysis tests and is robust against noise attacks. Moreover, performance analysis and comparisons with other VSS systems are presented, showing good results.
- 25 August 2023
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 126
Artificial Neural Network Chaotic PRNG and simple encryption on FPGA
- 25 August 2023
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 126
Artificial Neural Network Chaotic PRNG and simple encryption on FPGA
- Open Access
- 3 March 2023
- Published by MDPI AG in Electronics
- Vol. 12 (5) , 1219
An Encryption Application and FPGA Realization of a Fractional Memristive Chaotic System
The work in this paper extends a memristive chaotic system with transcendental nonlinearities to the fractional-order domain. The extended system’s chaotic properties were validated through bifurcation analysis and spectral entropy. The presented system was employed in the substitution stage of an image encryption algorithm, including a generalized Arnold map for the permutation. The encryption scheme demonstrated its efficiency through statistical tests, key sensitivity analysis and resistance to brute force and differential attacks. The fractional-order memristive system includes a reconfigurable coordinate rotation digital computer (CORDIC) and Grünwald–Letnikov (GL) architectures, which are essential for trigonometric and hyperbolic functions and fractional-order operator implementations, respectively. The proposed system was implemented on the Artix-7 FPGA board, achieving a throughput of 0.396 Gbit/s.
- 3 March 2023
- Published by MDPI AG in Electronics
- Vol. 12 (5) , 1219
Open AccessAn Encryption Application and FPGA Realization of a Fractional Memristive Chaotic System
The work in this paper extends a memristive chaotic system with transcendental nonlinearities to the fractional-order domain. The extended system’s chaotic properties were validated through bifurcation analysis and spectral entropy. The presented system was employed in the substitution stage of an image encryption algorithm, including a generalized Arnold map for the permutation. The encryption scheme demonstrated its efficiency through statistical tests, key sensitivity analysis and resistance to brute force and differential attacks. The fractional-order memristive system includes a reconfigurable coordinate rotation digital computer (CORDIC) and Grünwald–Letnikov (GL) architectures, which are essential for trigonometric and hyperbolic functions and fractional-order operator implementations, respectively. The proposed system was implemented on the Artix-7 FPGA board, achieving a throughput of 0.396 Gbit/s.