# Разбор лабораторной работы №3 ## Поиск длины ключа [Индексы](https://ru.wikipedia.org/wiki/%D0%98%D0%BD%D0%B4%D0%B5%D0%BA%D1%81_%D1%81%D0%BE%D0%B2%D0%BF%D0%B0%D0%B4%D0%B5%D0%BD%D0%B8%D0%B9) ![](https://i.imgur.com/2fz2B1C.png) ``` n, k = len(input_data), len(alphabet) I = [0]*(n-2) for i in range(n-2): s = "" for j in range(0, n, i+2): s += input_data[j] length = len(s) for j in range(k): f = s.count(alphabet[j]) I[i] += f*(f-1)/(length*(length-1)) ``` ![](https://i.imgur.com/g7fskrB.png) Длина ключа - 7 ## Поиск ключа 1) ![](https://i.imgur.com/OBEiKC1.png) 2) ![](https://i.imgur.com/o9km7Jk.png) 3) ![](https://i.imgur.com/ojvuPlg.png) 4) ![](https://i.imgur.com/k8U2rla.png) 5) ![](https://i.imgur.com/2xcTEYK.png) 6) ![](https://i.imgur.com/Huenbnc.png) 7) ![](https://i.imgur.com/wxZtp4e.png) ${\displaystyle m-s} ({\displaystyle m} — размер алфавита)$ $m-s = [11, 9, 12, 25, 15, 22, 14]$