Konferans Bildirisi
BibTex RIS Kaynak Göster

Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems

Yıl 2020, Cilt: 3 Sayı: 1, 184 - 190, 15.12.2020

Remzi Aktay

Öz

For the natural number n > 1, Euler function gives the amount of natural numbers which are smaller than n and co-prime to n. However, no work has been done to find the values of these numbers. In this study, the solution method of this problem which is the Euler function cannot respond, has been found. Groups, Cyclic Groups, Group Homomorphism and Group Isomorphism are used in this method. Additionally, Modular Arithmetic and the Chinese Remainder Theorem are used. At least two levels of encryption algorithm have been developed thanks to the method found. In this algorithm, it is aimed to prevent related companies from backing up, especially in social media and various communication applications such as WhatsApp.

Anahtar Kelimeler

Abstract Algebra Algorithm Chinese Remainder Theorem Cyclic Group Group Isomorphism

Kaynakça

  • 1 D. Tasci, Abstract Algebra, Alp Publishing House, Ankara, 2008.
  • 2 F. Callialp, Abstract Algebra with Examples, Birsen Publishing House, Ankara, 2013.

Yıl 2020, Cilt: 3 Sayı: 1, 184 - 190, 15.12.2020

Remzi Aktay

Öz

Kaynakça

  • 1 D. Tasci, Abstract Algebra, Alp Publishing House, Ankara, 2008.
  • 2 F. Callialp, Abstract Algebra with Examples, Birsen Publishing House, Ankara, 2013.
Toplam 2 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Konular Mühendislik
Bölüm Articles
Yazarlar

Remzi Aktay

Yayımlanma Tarihi 15 Aralık 2020
Kabul Tarihi 29 Eylül 2020
Yayımlandığı Sayı Yıl 2020 Cilt: 3 Sayı: 1

Kaynak Göster

APA Aktay, R. (2020). Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems. Conference Proceedings of Science and Technology, 3(1), 184-190.
AMA Aktay R. Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems. Conference Proceedings of Science and Technology. Aralık 2020;3(1):184-190.
Chicago Aktay, Remzi. “Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems”. Conference Proceedings of Science and Technology 3, sy. 1 (Aralık 2020): 184-90.
EndNote Aktay R (01 Aralık 2020) Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems. Conference Proceedings of Science and Technology 3 1 184–190.
IEEE R. Aktay, “Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems”, Conference Proceedings of Science and Technology, c. 3, sy. 1, ss. 184–190, 2020.
ISNAD Aktay, Remzi. “Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems”. Conference Proceedings of Science and Technology 3/1 (Aralık 2020), 184-190.
JAMA Aktay R. Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems. Conference Proceedings of Science and Technology. 2020;3:184–190.
MLA Aktay, Remzi. “Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems”. Conference Proceedings of Science and Technology, c. 3, sy. 1, 2020, ss. 184-90.
Vancouver Aktay R. Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems. Conference Proceedings of Science and Technology. 2020;3(1):184-90.
 Kapak Resmi İndir