Merge pull request #2788 from avinashkranjan/deepsource-transform-e26a05a0

format code with autopep8

Author: avinashkranjan

RSA_Algorithm_Script/RSA_Algorithm_Script.py

@@ -6,11 +6,13 @@ def is_prime(n):
             return False
     return True
 
+
 def gcd(a, b):
     while b != 0:
         a, b = b, a % b
     return a
 
+
 def multiplicative_inverse(a, b):
     s1, s2, m = 1, 0, b
     while b != 0:
@@ -19,6 +21,7 @@ def multiplicative_inverse(a, b):
         s1, s2 = s2, s1 - q * s2
     return s1 % m
 
+
 def powermod(x, y, p):
     res = 1
     x = x % p
@@ -29,36 +32,41 @@ def powermod(x, y, p):
         x = (x * x) % p
     return res
 
+
 def main():
     while True:
-        res = input('Do you want to enter prime numbers (y) or let the algorithm do it for you (n) or exit (e)? (y/n/e): ')
+        res = input(
+            'Do you want to enter prime numbers (y) or let the algorithm do it for you (n) or exit (e)? (y/n/e): ')
         if res == 'y':
             while True:
                 p = int(input('Enter a prime number: '))
                 if is_prime(p):
                     break
                 else:
                     print(p, 'is not a prime number')
-            
+
             while True:
                 q = int(input('Enter a different prime number: '))
                 if is_prime(q) and p * q > 26:
                     break
                 else:
-                    print('Both prime numbers are the same or the product is less than 26!')
-            
+                    print(
+                        'Both prime numbers are the same or the product is less than 26!')
+
             n = p * q
             phi_n = (p - 1) * (q - 1)
-            
+
             while True:
-                a = int(input(f'Enter a number such that Greatest Common Divisor with {phi_n} is 1: '))
+                a = int(
+                    input(f'Enter a number such that Greatest Common Divisor with {phi_n} is 1: '))
                 if gcd(a, phi_n) != 1:
                     continue
                 else:
                     break
-            
+
             b = multiplicative_inverse(a, phi_n)
-            message = input('Enter the message to be encrypted (lower case): ').lower()
+            message = input(
+                'Enter the message to be encrypted (lower case): ').lower()
 
             encrypted_string = ""
             encrypted_num = []
@@ -97,7 +105,8 @@ def main():
         elif res == 'n':
             p, q, a, b = 13, 17, 5, 77
             n = p * q
-            message = input('Enter the message to be encrypted (lower case): ').lower()
+            message = input(
+                'Enter the message to be encrypted (lower case): ').lower()
 
             encrypted_string = ""
             encrypted_num = []
@@ -139,5 +148,6 @@ def main():
             print('Invalid command!')
             continue
 
+
 if __name__ == '__main__':
     main()