Homework04 Чебукова 1.3

.github/workflows/cs102.yml

@@ -14,7 +14,7 @@ jobs:
     - name: Install dependencies
       run: |
         python -m pip install --upgrade pip
-        pip install isort black pylint mypy
+        pip install isort black pylint mypy pandas pygame
     - name: Install project dependencies
       run: |
         if [ -f ${{ github.head_ref }}/requirements.txt ];

homework00/test_hello_world.py

@@ -7,4 +7,3 @@ class HelloTestCase(unittest.TestCase):
     def test_hello(self):
         m = "message"
         self.assertEqual(m, hello_world.text())
-

homework01/caesar.py

@@ -29,4 +29,4 @@ def decrypt_caesar(ciphertext: str, shift: int = 3) -> str:
     """
     plaintext = ""
     # PUT YOUR CODE HERE
-    return plaintext
+    return plaintext

homework01/rsa.py

@@ -39,7 +39,9 @@ def multiplicative_inverse(e: int, phi: int) -> int:
     pass
 
 
-def generate_keypair(p: int, q: int) -> tp.Tuple[tp.Tuple[int, int], tp.Tuple[int, int]]:
+def generate_keypair(
+    p: int, q: int
+) -> tp.Tuple[tp.Tuple[int, int], tp.Tuple[int, int]]:
     if not (is_prime(p) and is_prime(q)):
         raise ValueError("Both numbers must be prime.")
     elif p == q:
@@ -82,7 +84,7 @@ def decrypt(pk: tp.Tuple[int, int], ciphertext: tp.List[int]) -> str:
     # Unpack the key into its components
     key, n = pk
     # Generate the plaintext based on the ciphertext and key using a^b mod m
-    plain = [chr((char ** key) % n) for char in ciphertext]
+    plain = [chr((char**key) % n) for char in ciphertext]
     # Return the array of bytes as a string
     return "".join(plain)
 
@@ -100,4 +102,4 @@ def decrypt(pk: tp.Tuple[int, int], ciphertext: tp.List[int]) -> str:
     print("".join(map(lambda x: str(x), encrypted_msg)))
     print("Decrypting message with public key ", public, " . . .")
     print("Your message is:")
-    print(decrypt(public, encrypted_msg))
+    print(decrypt(public, encrypted_msg))

homework01/tests/test_caesar.py

@@ -22,7 +22,9 @@ def test_encrypt(self):
 
         for i, (plaintext, shift, chiphertext) in enumerate(cases):
             with self.subTest(case=i, plaintext=plaintext, chiphertext=chiphertext):
-                self.assertEqual(chiphertext, caesar.encrypt_caesar(plaintext, shift=shift))
+                self.assertEqual(
+                    chiphertext, caesar.encrypt_caesar(plaintext, shift=shift)
+                )
 
     def test_decrypt(self):
         cases = [
@@ -40,11 +42,15 @@ def test_decrypt(self):
 
         for i, (chiphertext, shift, plaintext) in enumerate(cases):
             with self.subTest(case=i, chiphertext=chiphertext, plaintext=plaintext):
-                self.assertEqual(plaintext, caesar.decrypt_caesar(chiphertext, shift=shift))
+                self.assertEqual(
+                    plaintext, caesar.decrypt_caesar(chiphertext, shift=shift)
+                )
 
     def test_randomized(self):
         shift = random.randint(8, 24)
-        plaintext = "".join(random.choice(string.ascii_letters + " -,") for _ in range(64))
+        plaintext = "".join(
+            random.choice(string.ascii_letters + " -,") for _ in range(64)
+        )
         ciphertext = caesar.encrypt_caesar(plaintext, shift=shift)
         self.assertEqual(
             plaintext,

homework01/tests/test_rsa.py

@@ -40,7 +40,9 @@ def test_multiplicative_inverse(self):
     def test_generate_keypair(self):
         random.seed(1234567)
         self.assertEqual(((121, 323), (169, 323)), rsa.generate_keypair(17, 19))
-        self.assertEqual(((142169, 1697249), (734969, 1697249)), rsa.generate_keypair(1229, 1381))
+        self.assertEqual(
+            ((142169, 1697249), (734969, 1697249)), rsa.generate_keypair(1229, 1381)
+        )
         self.assertEqual(
             ((9678731, 11188147), (1804547, 11188147)), rsa.generate_keypair(3259, 3433)
-        )
+        )

homework01/tests/test_vigenere.py

@@ -18,7 +18,9 @@ def test_encrypt(self):
             with self.subTest(
                 case=i, plaintext=plaintext, keyword=keyword, chiphertext=chiphertext
             ):
-                self.assertEqual(chiphertext, vigenere.encrypt_vigenere(plaintext, keyword))
+                self.assertEqual(
+                    chiphertext, vigenere.encrypt_vigenere(plaintext, keyword)
+                )
 
     def test_decrypt(self):
         cases = [
@@ -32,11 +34,15 @@ def test_decrypt(self):
             with self.subTest(
                 case=i, chiphertext=chiphertext, keyword=keyword, plaintext=plaintext
             ):
-                self.assertEqual(plaintext, vigenere.decrypt_vigenere(chiphertext, keyword))
+                self.assertEqual(
+                    plaintext, vigenere.decrypt_vigenere(chiphertext, keyword)
+                )
 
     def test_randomized(self):
         kwlen = random.randint(4, 24)
-        keyword = ''.join(random.choice(string.ascii_letters) for _ in range(kwlen))
-        plaintext = ''.join(random.choice(string.ascii_letters + ' -,') for _ in range(64))
+        keyword = "".join(random.choice(string.ascii_letters) for _ in range(kwlen))
+        plaintext = "".join(
+            random.choice(string.ascii_letters + " -,") for _ in range(64)
+        )
         ciphertext = vigenere.encrypt_vigenere(plaintext, keyword)
-        self.assertEqual(plaintext, vigenere.decrypt_vigenere(ciphertext, keyword))
+        self.assertEqual(plaintext, vigenere.decrypt_vigenere(ciphertext, keyword))

homework01/vigenere.py

@@ -25,4 +25,4 @@ def decrypt_vigenere(ciphertext: str, keyword: str) -> str:
     """
     plaintext = ""
     # PUT YOUR CODE HERE
-    return plaintext
+    return plaintext