Mohammed H. Yacoub
Research Subjects
Mohammed H. Yacoub has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Lobna A. Said
3 shared publicationsWafaa S. Sayed
2 shared publicationsAhmed G. Radwan
1 shared publication- Bishoy K. Sharobim
Nanoelectronics Integrated Systems Center (NISC), Nile University, Giza, Egypt
1 shared publication - Heba Aslan
Center for Informatics Science, School of Information Technology and Computer Science, Nile University, Giza 12588, Egypt
1 shared publication Mahmoud H. AbdElbaky
1 shared publication
Latest Publications
- 21 January 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 159
Efficient hardware implementations of trigonometric functions and their application to sine-based modified logistic map
- 21 January 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 159
Efficient hardware implementations of trigonometric functions and their application to sine-based modified logistic map
- 18 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 83-88
Pseudo Random Number Generators Employing Three Numerical Solvers of Chaotic Generators
Pseudo-Random Number Generator (PRNG) is required for various applications, especially cryptography. PRNGs are employed in symmetric-key algorithms, where a single key is used as a seed to the PRNG to generate a sequence of random numbers that are employed to encrypt and decrypt certain data. This work proposes a PRN G system that employs the time series generated from the numerical solution of systems of chaotic-generators Differential Equations (DEs) utilizing three different DEs solvers; Euler, Runge-Kutta 4th order, and Runge-Kutta 5th order. Various systems were solved using each of the three methods and their randomness was evaluated by several tests. The PRNGs passed the NIST test and reached an entropy of 7.9998, very close to 8 which is the optimal value, proving the robustness of this method for encryption applications.
- 18 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 83-88
Pseudo Random Number Generators Employing Three Numerical Solvers of Chaotic Generators
Pseudo-Random Number Generator (PRNG) is required for various applications, especially cryptography. PRNGs are employed in symmetric-key algorithms, where a single key is used as a seed to the PRNG to generate a sequence of random numbers that are employed to encrypt and decrypt certain data. This work proposes a PRN G system that employs the time series generated from the numerical solution of systems of chaotic-generators Differential Equations (DEs) utilizing three different DEs solvers; Euler, Runge-Kutta 4th order, and Runge-Kutta 5th order. Various systems were solved using each of the three methods and their randomness was evaluated by several tests. The PRNGs passed the NIST test and reached an entropy of 7.9998, very close to 8 which is the optimal value, proving the robustness of this method for encryption applications.