Remzi AKTAY

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

ISSN: 2651-544X
Başlangıç: 2018
Yayıncı: Murat TOSUN

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,

PDF

___

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