Dynamic Generalization of the Vigénère Table based on the Logistics Map

Abstract

The Vigenère cipher is a system that allows us to substitute a character with another character that is not always the same. The disadvantage of this system is the weak length of the encryption key, which is usually less than the length of the text to be encrypted, and can unfortunately be discovered by using Kasiski's and coincidence index methods. To resolve this problem, we propose in this work to use a dynamic generalization of the Vigénère table based on the logistics map to generate a random keys as long as the length of the text.