Conference Paper

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

Volume: 3 Number: 1 December 15, 2020
Conference Proceedings of Science and Technology Cover
Conference Proceedings of Science and Technology
PDF Download
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

References

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

Details

Primary Language

English

Subjects

Engineering

Journal Section

Conference Paper

Authors

Publication Date

December 15, 2020

Submission Date

August 21, 2020

Acceptance Date

September 29, 2020

Published in Issue

Year 2020 Volume: 3 Number: 1

IZ

https://izlik.org/JA55SF48UF

Cite

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 (December 1, 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, vol. 3, no. 1, pp. 184–190, Dec. 2020, [Online]. Available: 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 (December 1, 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, vol. 3, no. 1, Dec. 2020, pp. 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]. 2020 Dec. 1;3(1):184-90. Available from: https://izlik.org/JA55SF48UF