Konferans Bildirisi

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

Cilt: 3 Sayı: 1 15 Aralık 2020
Conference Proceedings of Science and Technology Kapak
Conference Proceedings of Science and Technology
PDF İndir
EN

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

Abstract

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.

Keywords

Kaynakça

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

Ayrıntılar

Birincil Dil

İngilizce

Konular

Mühendislik

Bölüm

Konferans Bildirisi

Yazarlar

Yayımlanma Tarihi

15 Aralık 2020

Gönderilme Tarihi

21 Ağustos 2020

Kabul Tarihi

29 Eylül 2020

Yayımlandığı Sayı

Yıl 2020 Cilt: 3 Sayı: 1

IZ

https://izlik.org/JA55SF48UF

Kaynak Göster

RIS / Bibtex
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. https://izlik.org/JA55SF48UF
AMA
1.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-190. https://izlik.org/JA55SF48UF
Chicago
Aktay, Remzi. 2020. “Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems”. Conference Proceedings of Science and Technology 3 (1): 184-90. https://izlik.org/JA55SF48UF.
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
[1]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, Ara. 2020, [çevrimiçi]. Erişim adresi: https://izlik.org/JA55SF48UF
ISNAD
Aktay, Remzi. “Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems”. Conference Proceedings of Science and Technology 3/1 (01 Aralık 2020): 184-190. https://izlik.org/JA55SF48UF.
JAMA
1.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, Aralık 2020, ss. 184-90, https://izlik.org/JA55SF48UF.
Vancouver
1.Remzi Aktay. Co-Prime Integer Encryption Algorithm Upon Euler’s Totient Function’s Unsolved Problems. Conference Proceedings of Science and Technology [Internet]. 01 Aralık 2020;3(1):184-90. Erişim adresi: https://izlik.org/JA55SF48UF