المجلد السابع

العدد الرابع عشر لشهر ديسمبر 2022

رجوع

تحميل البحث

full-text

الملخص:

في كل يوم ، تنقتل عبر الشبكات ملايين الصور. البعض يريد نقل بعض الصور بشكل آمن لأن بعضها خاص وسري. يعد التشفير أمرًا ضروريًا لنقل الصور بأمان. يقدم هذا البحث طريقة آمنة لتشفير الصور تعتمد على نظرية المجال المحدود. استخدمنا حقلاً محدودًا يحتوي على 257 عنصرًا. النطاق المقدم هو مجموعة يتم فيها الضرب والجمع والطرح والقسمة، تمامًا كما هو الحال مع أي مجال آخر. تم تنفيذ الخوارزمية باستخدام الضرب والقسمة. استخدمنا حقلاً يحتوي على 257 عنصرًا ، وهو عدد صحيح p عندما يكون p عددًا أوليًا ، والذي يوفر المثال الأكثر شيوعًا للحقول المحدودة. في حالتنا p = 257. نطبقها على الأصفار المضاعفة لتشفير البيانات الثنائية في الصور بايت بايت. تم اختبار النموذج المقترح على صور مختلفة. تم أيضًا قياس إنتروبيا المعلومات ومعامل الارتباط بين وحدات البكسل المجاورة و MSE و PSNR لتقييم مدى تعقيد الصور المشفرة.

الكلمات المفتاحية: cipher, Finite Field, prime numbers, multiplicative ciphers.

Abstract:

ABSTRACT Every day, the network transfers millions of images. In this paper the attempt has been made to to suggest a method to transfer the photographs securely, because some of them are private and confidential. To transmit images safely, cryptography is essential. This paper provides a secure image encryption method based on finite field theory. We consider a finite field containing 257 elements. A provided domain is a set in which multiplication, addition, subtraction, and division are performed, just like with any other domain. The algorithm was performed using multiplication and division. We consider a finite field containing 257 elements, integer modulo p when p is a prime number, which provides the most common example of finite fields. In our case p = 257. We apply it to multiplicative ciphers to encrypt the binary data in images byte by byte. The proposed model was tested on various images. Information entropy, the correlation coefficient between adjacent pixels, MSE and PSNR were also measured to assess the complexity of encrypted images.

Keywords: cipher, Finite Field, prime numbers, multiplicative ciphers.

المراجع References

Ali-Pacha, Hana, et al. “Significant Role of the Specific Prime Number P = 257 in the Improvement of Cryptosystems.” Notes on Number Theory and Discrete Mathematics, vol. 26, no. 4, Nov. 2020, pp. 213–222, 10.7546/nntdm.2020.26.4.213-222. Accessed 9 Nov. 2022.
Alanazi Hamdan., Zaidan B. and Zaidan A., New Comparative Study between DES, 3DES and AES within Nine Factors, Journal Of Computing. Vol. 2 , Issue 3, 2010, Pp.152-157.
Babu Sriramoju, “Modification Affine Ciphers Algorithm For Cryptography Password”, International Journal of Research In Science & Engineering, Volume: 3, no: 2, March-April 2017, pp. 346-351.
Chen, Guanrong, et al. “A Symmetric Image Encryption Scheme Based on 3D Chaotic Cat Maps.” Chaos, Solitons & Fractals, vol. 21, no. 3, July 2004, pp. 749–761, www.sciencedirect.com/science/article/pii/S0960077903006672, 10.1016/j.chaos.2003.12.022. Accessed 16 Aug. 2019.
Dawahdeh, Ziad E., et al. “A New Image Encryption Technique Combining Elliptic Curve Cryptosystem with Hill Cipher.” Journal of King Saud University - Computer and Information Sciences, vol. 30, no. 3, July 2018, pp. 349–355, 10.1016/j.jksuci.2017.06.004.
Fathi E Abd El-Samie. Image Encryption : A Communication Perspective. Boca Raton Florida, Crc Press, Tayllor & Francis Group, 2014.
Keshta Ismail, “Caesar Cipher Method Design and Implementation”, International Journal of Computer Science and Information Security, Vol. 16, No. 4, April 2018, pp. 298-307
Luciano, Dennis, and Gordon Prichett. “Cryptology: From Caesar Ciphers to Public-Key Cryptosystems.” The College Mathematics Journal, vol. 18, no. 1, Jan. 1987, p. 2, 10.2307/2686311.
L. Singh and K. Singh, “Image Encryption Using Elliptic Curve Cryptography.” Procedia Computer Science, vol. 54, 2015, pp. 472–481, 10.1016/j.procs.2015.06.054. Accessed 2 Mar. 2020.
Stallings, William. Cryptography and Network Security : Principles and Practice : William Stallings. Upper Saddle River, N.J., Pearson/Prentice Hall, 2006.
Yan, Song Y. Computational Number Theory and Modern Cryptography. Hoboken, John Wiley & Sons, Inc, 2013.