Comparing Groups of Public-Key Ciphers

In this thesis, I introduce several groups of public-key algorithms, the groups being factori-zation problem, discrete logarithm problem, and other problems. I choose one representa-tive algorithm from each group and describe it in-depth, also mentioning certain aspects used in real world implementations and most important attacks. other problems. The objec-tives of this thesis are to compare these groups as well as algorithms in them according to their operational speed, key lengths and resistance against quantum cryptanalysis