مواقع التدريسيينجامعة الكوفة
د. حيدر رحيم هاشم الموسوي
أستاذ مساعد

د. حيدر رحيم هاشم الموسوي

English Version
0بحث منشور
0محاضرة
0اهتمام بحثي

الملف الشخصي

حاصل على درجة البكالوريوس في الرياضيات من كلية العلوم, جامعة الكوفة , العراق وبمعدل 90.3% وبتسلسل الاول على القسم و الكلية.
حاصل على درجة الماجستير من جامعة أمبوريا ستيت الامريكية في عام 2010 .
حاصل على شهادات تقديرية في برنامج اللغة الإنكليزية المكثف في جامعة امبوريا ستيت.
حاصل على درجة الماجستير في الرياضيات(نظرية الاعداد) من قسم الرياضيات وعلوم الحاسوب والاقتصاد من جامعة أمبوريا ستيت, الولايات المتحدة الامريكية وبتقدير امتياز(2013) .
عضو في مكتب التعليم الدولي في جامعة أمبوريا ستيت (2011-2013).
مدرس مساعد في علوم الحاسوب والرياضيات/قسم الرياضيات, جامعة الكوفة منذ 17-12-2013 .
مقرر قسم الرياضيات للدراسات الأولية -2017-2014 .
-حاصل على شهادة الدكتوراه في الرياضيات/ نظرية الاعداد من جامعة دبرسن في هنغاريا في 2017-2021.

الاهتمامات البحثية

5

البحوث المنشورة

13
2026

A Number-Theoretic Generalization of the ElGamal Cryptosystem with Applications to Digital Signatures and Image Encryption

الباحثونحيدر رحيم هاشم
المجلةComputation
التاريخ2026-08-12
مختصر البحث

In this paper, we propose an image encryption and digital signature scheme based on a modification of ElGamal cryptosystem over a large modulus represented by (Formula presented.), where p is a large prime number and (Formula presented.) is a dynamic exponent derived from a shared secret established by the communicating participants through a modification of the Diffie–Hellman Key Exchange Protocol. The proposed scheme combines a modified ElGamal framework with image encryption and digital signature mechanisms to support confidentiality, image authentication and integrity verification while preserving the standard security assumptions of discrete-logarithm-based cryptography. Empirical performance and image-statistical evaluations, including histogram analysis, entropy, correlation coefficients, NPCR and UACI, are conducted on applying the procedures of the proposed scheme on four standard images. The experimental results demonstrate the correctness and favorable empirical image-statistical behavior of the proposed scheme for grayscale image encryption and authentication under the classical DLP assumptions. Furthermore, comparisons with representative symmetric and asymmetric cryptographic schemes are provided to evaluate the performance of the proposed scheme.

2026

GENERALIZED LUCAS PRIMES IN THE FERMAT-EULER EQUATION

الباحثونحيدر رحيم هاشم
المجلةJournal of Algebraic Systems
التاريخ2026-01-03
مختصر البحث

The property of having infinitely many prime numbers award these numbers to have many applications in various fields of sciences. One of the most important applications is their use in the creation of many public key cryptosystems’ private keys. Therefore, the main aim of this paper is considering a well known form of primes generated by the Fermat-Euler equation p = x2 + dy2 and studying whether or not this form keeps the property of generating infinitely many primes if the unknowns x, y and p are terms in certain binary recurrence sequences called the Lucas sequences of the first kind {un(a, b)} or the second kind {vn(a, b)}. In other words, in this paper we present a technique for investigating the integer solutions (x, y, p) of the equation p = x2 +dy2, where the unknowns are terms in {un(a, b)} or {vn(a, b)}. We also apply this technique for determining the solutions (x, y, p) = (ti(a, b), tj(a, b), tk(a, b)) with 1 ≤ i ≤ j ≤ k, where tn(a, b) represents the general term un(a, b) or vn(a, b) under certain conditions on the integers a and b

2026

A Diophantine Equation Involving Padovan Numbers

الباحثونحيدر رحيم هاشم
المجلةLobachevskii Journal of Mathematics
التاريخ2026-06-01
مختصر البحث

Suppose that is a generalized Padovan sequence defined by the relation,,,, where and. In this paper, we give a general result for determining the positive integer solutions of the equation

2021

CRYPTANALYSIS OF ITRU

الباحثونHayder R. Hashim، Alexandra Molnár and Szabolcs Tengely
المجلةRAD HAZU. MATEMATICKE ZNANOSTI
مختصر البحث

ITRU cryptosystem is a public key cryptosystem and one of the known variants of NTRU cryptosystem. Instead of working in a truncated polynomial ring, ITRU cryptosystem is based on the ring of integers. The authors claimed that ITRU has better features comparing to the classical NTRU, such as having a simple parameter selection algorithm, invertibility, and successful message decryption, and better security. In this paper, we present an attack technique against the ITRU cryptosystem, and it is mainly based on a simple frequency analysis on the letters of ciphertexts.

2021

Curious properties of generalized Lucas numbers

الباحثونHayder Raheem Hashim، -
المجلةSpringer Nature
مختصر البحث

Studying the solutions of some Diophantine equations related to Lucas sequences.

2017

A PROPOSED METHOD FOR TEXT ENCRYPTION USING SYMMETRIC AND ASYMMETRIC CRYPTOSYSTEMS

الباحثونHayder Raheem Hashim، Mohammed Abdul Hameed Jasem Alkufi
المجلةInternational Journal of Computer Trends and Technology
مختصر البحث

This proposed method focuses on encrypting texts that are written in English or Arabic language using symmetric and asymmetric cryptosystems respectively. The symmetric and asymmetric cryptosystems presented by Vigenere Cipher and RSA Cryptosystem respectively. Therefore, a plaintext encrypted using Vigenere Cipher, then the obtained ciphertext must be encrypted again using RSA Cryptosystem in a way that makes this method programmed using MATLAB. Therefore, this suggested method has a higher level of security than either Vigenere Cipher or RSA Cryptosystem since its security relies on the hardness of factoring the product of two large prime numbers, the factoring problem and on the secrecy of the keyword of the Vigenere Cipher. Therefore, this method gives us the confidence of using Vigenere cipher over text messages as a part of asymmetric cryptography and suggests a new method for encrypting text messages

2017

An Algorithm Based on GSVD for Image Encryption

الباحثونMohammed Abdul Hameed، Hayder Raheem Hashim Ameer Mohammed Hussein Hind Rustum Mohammed
المجلةMath. Comput. Appl.
مختصر البحث

This paper represents a new image encryption algorithm based on modifying generalized singular value decomposition (GSVD) by decomposing the plain‐image into two segments using GSVD with an exchanged key‐image to produce the cipher‐image. The exchanged key‐image is used as an encrypting and decrypting image. Mathematically, this procedure is represented by transforming the plain‐image’s matrix into two different matrices and applying the GSVD with the exchanged key‐image’s matrix to obtain the cipher‐image’s matrix. The two encoded segments can be kept in several places or assigned to a group of authorized persons. No one can obtain the information of the image easily without the knowledge of the decrypting key. This proposed algorithm is represented as one of the digital image encryption techniques used to enhance the security of images that have been sent between recipients.

2016

A new modification of RSA cryptosystem based on the number of the private keys

الباحثونHayder Raheem Hashim
المجلةAmerican Scientific Journal for Engineering ,Technology, and Sciences
مختصر البحث

The need of the privacy for each person has encouraged cryptologists to create and modified cryptosystems. However, the RSA cryptosystem is a secure public key cryptosystem, this paper focuses on modifying RSA cryptosystem by increasing the number of private keys. This modification can be applied over plaintext messages, plain matrices, however in this paper, I focuse on applying it particulary on matrices which are the corresponding matrices of images. The RSA cryptosystem is a very secure cryptosystem that has a public key and private key, and the security of its private key depends on the integer factorization problem. But, this only private key might be found by inspection. Therefore, this new modification gives the RSA cryptosystem a higher security, because it suggests a "k" number of chosen private keys. Therefore, this new modification makes the RSA cryptosystem more secure and confidential public key cryptosystem.

2016

A new approach for image encryption in the modified RSA cryptosystem using Matlab

الباحثونHayder Raheem Hashim ، Al-Sabti, K.D.M
المجلةGlobal J. Pure and Applied Mathe., 12: 3631-3640.
مختصر البحث

The need of making important information that is being exchanged between participants through unsecure websites has intersted cryptoligists to create and modify some secure cryptosytems to prevent these information from getting hacked or cracked.In this paper, a particular strategy in thepublic key cryptosystem called RSA Cryptosystem is presented to be applied over gray and color images with the help of MATLAB Program. Since the RSA cryptosystem is a well-known secure cryptosystem, we use MATLAB to apply this cryptosystem over gray and color images. And that would be generating two algorithms for the encryption and decryption procedures. These algorithms can be applied over the plain image and cipher image after reading them in the matrices forms. However, the image is partitioned into blocks that are n x m matrices. Since the RSA cryptosystem is a secure public key cryptosystem since its security based on the difficulty of the factoring problem, which is factoring a positive integer R into a product of two primes, we apply this cryptosystem over images using MATLAB with increasing the number of the primes in R. This gives the modified RSA cryptosystem has a higher security than the RSA cryptosystem, because decrypting any encrypted images requires factoring the large integer composed of the product of many large primes, and it requires knowing the size of the blocks that are formed from plain matrix. Therefore, this approach of encrypting and decrypting images using RSA cryptosystem with some modifications more immune against any attacks in the transmission of images in all agencies in the era of the information technology.

2015

Vernam cipher over a soft set

الباحثونHayder Raheem Hashim، Ameer Mohammad Husain
المجلة Global Journal of Mathematics
مختصر البحث

The need of hiding information or data that has been sent between participants has presented some systems, that are helpful for this matter. And these systems have been gathered under one historical name called cryptography. In this study, a particular symmetric cryptosystem called Vernam Cipher, which is a stream cipher used over an important mathematical tool, that's used to deal with uncertainties, fuzzy, and not clearly defined objects, which is free of difficulties that come from solving problems in economics, engineering, social sciences, and medical science. This tool is called a soft set. The soft set can be applied to many problems in engineering, economics, physics, and others. However, many of these applications might be really important, especially when they are sent thru automatic telegraph message or unsecure network such as the internet.They should be encrypted before being sent between participants. Therefore, the main goal of this paper is to apply a stream cipher called Vernam Cipher over a soft setof objects only after presenting a soft set over an object in its binary form.

2014

Image encryption and decryption in A modification of ElGamal cryptosystem in Matlab

الباحثونHayder Raheem Hashim ، Irtefaa Nemma
المجلةInternational Journal of Sciences: Basic and Applied Research , (IJSBAR) Volume 2, No, 14 . pp.
مختصر البحث

The need of exchanging messages and images secretly over unsecure networks promoted the creation of cryptosys-tems to enable receivers to interpret the exchanged information. In this paper, a particular public key cryptosystem called the ElGamal Cryptosystem is presented considered with the help Matlab Program to be used over Images. Since the ElGamal cryptosystem over a primitive root of a large prime is used in messages encryption in the free GNU Priva-cy Guard software, recent versions of PGP, and other cryptosystems. This paper shows a modification of the this cryp-tosystem by applying it over gray and color images. That would be by transforming an image into its corresponding matrix using Matlab Program, then applying the encryption and decryption algorithms over it. Actually, this modifica-tion gives one of the best image encryptions that have been used since the encryption procedure over any image goes smoothly and transfers the original image to completely undefined image which makes this cryptosystem is really se-cure and successful over image encryption. As well as, the decryption procedure of the encrypted image works very well since it transfers undefined image to its original. Therefore, this new modification can make the cryptosystem of images more immune against some future attacks since breaking this cryptosystem depends on solving the discrete logarithim problem which is really impossibe with large prime numbers .

2014

H-Rabin cryptosystem

الباحثونHayder Raheem Hashim
المجلةJournal of Mathematics and Statistics 10 (3): 258-2 62, 2014
مختصر البحث

Cryptography is the science of using mathematics th at's used to hide information or data that is being sent between participants in a way that prevents ot her people from reading it. The need of exchanging messages secretly promoted the creation of cryptosy stems to enable receivers to interpret the exchanged information. In this study, a particular public key cryptosystem called Rabin Cryptosystem is presented considered with the help of Chinese Re minder Theorem. Since the decryption algorithm of the Rabin cryptosystem is based on computing square roots modulo n, where n = p.q where p and q are primes. This study suggests a modification of Rabin cryptosystem that can make the cryptosystem more immune against some attacks. This modification focuses on considering n = p. q. r where p, q and r are primes. This new modification of Rabin crypto system is called H-Rabin Cryptosystem. Also, some basic mathematical concepts are explained and it finally compares the H-Rabin Cryptosystem, RSA cryptosystem and Rabin cryptosystem in terms of security and efficiency . This H-Rabin cryptosystem is a public key cryptosystem where the private key is composed of three primes, p, q and r and a public key composed of n = p. q. r and it i s based on the hardness of factoring. Therefore, th is new modification can make the cryptosystem more imm une against some future attacks.

2014

Signing messages in the ElGamal cryptosystem over the group of units U(n) wheren= pt, or 2pt

الباحثونHayder Raheem Hashim
المجلةEuropean Journal of Scientific Research Volume 127 No 1 December, 2014
مختصر البحث

Background: A new signature scheme of ElGamal cryptosystem is proposed which uses over the abelian group of units U(n) where n is one of the following forms pt, or 2pt where p is an odd large prime and t is a positive integer. The security of this systems relies on the difficulty of computing discrete logarithms over U(n). This study is mainly about one of the most important applications of number theory which is about signing messages in the ElGamal cryptosystem over the abelian group of units U(n) where n is one of the following forms pt, or 2pt where p is an odd large prime and t is a positive integer. In a previous published article that is listed in the references, I suggested an interesting way to deal with the ElGamal Cryptosystem using that abelian group of Units U(n)={x: x is a positive integer such that x<n and gcd(n,x)=1} in the setting of the discrete logarithm problem. Objective: In this paper, I modify and apply that idea in signing messages in the ElGamal Cryptosystem. Since I show in this paper that we can use the abelian group U(n) where n is one of the following forms pt, or 2pt in signing messages. Also, I hope to show this new study maintains equivalent (or better) security with the original ElGamal cryptosystem that works over the finite cyclic group of the finite field. Results: This idea gives another way to sign messages that are being encrypted using the ElGamal cryptosystem, and that would help the receiver to make sure that the received message(s) came from the right sender. Conclusion: The ElGamal signature scheme over this type of abelian group of units is much more securer than before. Keywords: The ElGamal cryptosystem over the group of units U(n): n=pt, or 2pt for a positive integer t and p is an odd large prime, The Discrete Logarithm Problem,ElGamal signature scheme.

المحاضرات

15

المرحلة الثانية

تفاضل وتكامل متقدم- 2014/2015

المرحلة الاولى

اللغة الانكليزية 2015/2014

المرحلة الثانية

تفاضل وتكامل 2- 2014/2013

المرحلة الرابعة

تشفير 2015/2016

المرحلة الرابعة

نظرية الاعداد 2015/2016

المرحلة الثانية / جميع المحاضرات

جبر خطي- 2016/2017

المرحلة الرابعة/ جميع المحاضرات

نظرية الاعداد 2017/2016

المرحلة الثانية/ جميع المحاضرات

تفاضل وتكامل متقدم- 2016/2015

جميع المحاضرات للفصل 2

معادلات ديفونتية 2023-2024

جميع المحاضرات للفصل 1

نظرية الاعداد 2023-2024

جميع المحاضرات

تفاضل وتكامل 1/ 2023-2024

جميع المحاضرات

تفاضل وتكامل 2/ 2023-2024

جميع المحاضرات للفصل 2

ماجستير - معادلات ديفونتية 2023-2024

جميع المحاضرات للفصل 1

ماجستير - نظرية الاعداد 2023-2024

محاضرات نظرية الاعداد التطبيقية

نظرية الاعداد التطبيقية

عرض التفاصيل