I'm reading a book on cryptography and it mentions the Viterbi algorithm being used to decrypt Vernam cipher if the same key is used multiple times.
According to the book the Viterbi algorithm takes a weighted directed graph whose edges are labelled by letters and the weights correspond to transition probabilities. Given a starting vertex and a word it returns the highest probability path starting from this vertex and such that the edges passed are labelled by the letters of the word in order.
I have three cipher texts that have been obtained by using the Vernam cipher with the same key.
I'm guessing the edges should represent the cipher text and the vertices should represent the clear text but I cannot figure it out.