An Automata-Theory Model of a Disk Encryptor Based on the Development of Man-In-The-Middle Attack Model
The paper analyzes the man-in-the-middle attack in terms of automata theory in order to determine the initial state of a series connection of automata, and evaluates the overall complexity of the reviewed method for determining the initial state of the series connection of automata. It discusses an automatatheory model of a disk encryptor for determining its initial state and input key sequence. The model is a series connection of special-type automata. It proves that the presented model provides underpinnings for a new type of the man-in-the-middle attack. It provides a calculation of the complexity parameters for the new attack to determine disk encryptor keys from cipher texts. It provides an estimate for complexity of determining disk encryptor keys from known plain and cipher texts.