Conference Paper
BibTex RIS Cite

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

Year 2020, Volume: 3 Issue: 1, 184 - 190, 15.12.2020

Remzi Aktay

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

Abstract Algebra Algorithm Chinese Remainder Theorem Cyclic Group Group Isomorphism

References

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

Year 2020, Volume: 3 Issue: 1, 184 - 190, 15.12.2020

Remzi Aktay

Abstract

References

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

Details

Primary Language English
Subjects Engineering
Journal Section Articles
Authors

Remzi Aktay

Publication Date December 15, 2020
Acceptance Date September 29, 2020
Published in Issue Year 2020 Volume: 3 Issue: 1

Cite

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. December 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, no. 1 (December 2020): 184-90.
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 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, 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 (December 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, vol. 3, no. 1, 2020, pp. 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.
 Download Cover Image