A generalization of the RSA “elatrash scheme”
Author
Source
Journal of al-Aqsa University : Series of Natural Sciences
Issue
Vol. 9, Issue 1 (31 Dec. 2005), pp.38-44, 7 p.
Publisher
al-Aqsa University Deanship of Graduate Studies and Scientific Research
Publication Date
2005-12-31
Country of Publication
Palestine (Gaza Strip)
No. of Pages
7
Main Subjects
Information Technology and Computer Science
Topics
Abstract AR
تعتبر طريقة "آر إس إيه" في التشفير من الطرق الأكثر استخداما.
في هذا البحث نقوم بتعميم هذه الطريقة من طريقة تستخدم الأعداد الصحيحة المحصورة بين العددين صفر، (ن-1) حيث ن عبارة عن حاصل ضرب عددين أوليين إلى طريق تستخدم حلقة المصفوفات المعرفة على حلقة البواقي للعدد ن و التي نسميها "طريقة الأطرش".
ثم نعرض بعض ميزاتها.
Abstract EN
The RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and (n–1) for some n where n a product of two primes.
In this paper, we generalize RSA scheme in order to be applied to general linear group over the ring of integers modulo n and plaintexts and ciphertexts are k×k square matrices with entries in Zn (the integers modulo n) denoted by GL(k, Zn).
We call it “Elatrash scheme”.
American Psychological Association (APA)
al-Naowk, Fayiq Ramadan. 2005. A generalization of the RSA “elatrash scheme”. Journal of al-Aqsa University : Series of Natural Sciences،Vol. 9, no. 1, pp.38-44.
https://search.emarefa.net/detail/BIM-293645
Modern Language Association (MLA)
al-Naowk, Fayiq Ramadan. A generalization of the RSA “elatrash scheme”. Journal of al-Aqsa University : Series of Natural Sciences Vol. 9, no. 1 (2005), pp.38-44.
https://search.emarefa.net/detail/BIM-293645
American Medical Association (AMA)
al-Naowk, Fayiq Ramadan. A generalization of the RSA “elatrash scheme”. Journal of al-Aqsa University : Series of Natural Sciences. 2005. Vol. 9, no. 1, pp.38-44.
https://search.emarefa.net/detail/BIM-293645
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 44
Record ID
BIM-293645