Counting functions to generate the primes in the RSA algorithm and diffie-hellman key exchange

المؤلفون المشاركون

al-Mamuri, Faiz Ali
Rashid, Mazin Said

المصدر

مجلة ابن الهيثم للعلوم الصرفة و التطبيقية

الناشر

جامعة بغداد كلية التربية ابن الهيثم

تاريخ النشر

2017-12-31

دولة النشر

العراق

عدد الصفحات

5

التخصصات الرئيسية

الرياضيات

الملخص الإنجليزي

The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption.

These methods depended on selecting the primes p and q in order to be secure enough .

This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure.

Moreover, this article gives new construction of the RSA algorithm and DH key exchange using the

نوع البيانات

أوراق مؤتمرات

رقم السجل

BIM-851616

• APA
• MLA
• AMA