mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-30 14:13:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-12-06 19:39:35 +00:00
parent da34c05919
commit c42da95d86
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
polyalphabetic_cipher
View File

@ -8,14 +8,14 @@ def encrypt(text, key):
key_index = 0 key_index = 0
for char in text: for char in text:
if char.isalpha(): if char.isalpha():
shift = ord(key[key_index]) - ord('A') shift = ord(key[key_index]) - ord('A')
if char.isupper(): if char.isupper():
new_char = chr((ord(char) - ord('A') + shift) % 26 + ord('A')) new_char = chr((ord(char) - ord('A') + shift) % 26 + ord('A'))
else: else:
new_char = chr((ord(char) - ord('a') + shift) % 26 + ord('a')) new_char = chr((ord(char) - ord('a') + shift) % 26 + ord('a'))
encrypted_text.append(new_char) encrypted_text.append(new_char)
key_index = (key_index + 1) % key_length key_index = (key_index + 1) % key_length
else: else:
encrypted_text.append(char) encrypted_text.append(char)
@ -31,14 +31,14 @@ def decrypt(text, key):
key_index = 0 key_index = 0
for char in text: for char in text:
if char.isalpha(): if char.isalpha():
shift = ord(key[key_index]) - ord('A') shift = ord(key[key_index]) - ord('A')
if char.isupper(): if char.isupper():
new_char = chr((ord(char) - ord('A') - shift) % 26 + ord('A')) new_char = chr((ord(char) - ord('A') - shift) % 26 + ord('A'))
else: else:
new_char = chr((ord(char) - ord('a') - shift) % 26 + ord('a')) new_char = chr((ord(char) - ord('a') - shift) % 26 + ord('a'))
decrypted_text.append(new_char) decrypted_text.append(new_char)
key_index = (key_index + 1) % key_length key_index = (key_index + 1) % key_length
else: else:
decrypted_text.append(char) decrypted_text.append(char)