Шифрование Виджинера

alphabet = [
    "а", "б", "в", "г", "д", "е", "ё", "ж", "з", "и", "й", "к", "л", "м", "н", "о",
    "п", "р", "с", "т", "у", "ф", "х", "ц", "ч", "ш", "щ", "ъ", "ы", "ь", "э", "ю", "я"
]
 
CURRENT_INDEX = 0
 
phrase = str(input())
hash_key = str(input())
 
 
def get_new_symbol(old, hashed_symbol):
    try:
        current_index = alphabet.index(old.lower())
        hash_index = alphabet.index(hashed_symbol.lower())
        if current_index + hash_index >= len(alphabet):
            new_index = current_index + hash_index - len(alphabet)
        else:
            new_index = current_index + hash_index
        return alphabet[new_index]
    except ValueError:
        return old
 
 
def get_hash_symbol():
    global CURRENT_INDEX
    if CURRENT_INDEX + 1 >= len(hash_key):
        CURRENT_INDEX = 0
    result = hash_key[CURRENT_INDEX]
    CURRENT_INDEX += 1
    return result
 
 
# моя комната самая большая
# стулстулстулстулстулстулс
# стул
# 0123
result = ""
for symbol in phrase:
    result += get_new_symbol(symbol, get_hash_symbol())
 
print(f"Result: {result}")

#crypter
m = 'HELLO'
k = 'WORLD'
k *= len(m) // len(k) + 1
c = ''
 
for i, j in enumerate(m):
    gg = (ord(j) + ord(k[i]))
    c += chr(gg % 26 + 65)
    print(c)
 
print(c)
 
#decrypter
c = 'DSCWR'
k = 'WORLD'
d = ''
 
for i, j in enumerate(c):
    gg = (ord(j) - ord(k[i]))
    print(chr(gg % 26 + 65))
    d += chr(gg % 26 + 65)
 
print(d)
 
#tablica
#       1   2   3   4   5   6   7   8   9  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24  25  26
arr = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
print()
def switch(n):
    while n < 26:
        for i in arr:
            if i == arr[0]:
                print(end = "|")
            print(i, end = "|")
        arr.append(arr[0])
        arr.remove(arr[0])
        print()
        n+=1
switch(0)
print()