Proposition of a New Vernam Chaotic Cipher

  • Hana ALI-PACHA Laboratory of Coding and Security of Information, University of Sciences and Technology of Oran – Mohamed Boudiaf USTO-MB, Algeria
  • Naima HADJ-SAID University of Sciences and Technology of Oran – Mohamed Boudiaf USTO-MB, Algeria
  • Adda ALI-PACHA University of Sciences and Technology of Oran – Mohamed Boudiaf USTO-MB, Algeria
Keywords: One Pad Time, Vernam Cipher, Chaos, sensitivity to the initial conditions, Logistic Map

Abstract

The One Pad Time is the only encryption algorithm known to be undecipherable. It is actually a cipher with the characteristic that the encryption key has the same length as the plaintext message. This algorithm was hoping for a strong commercial success, but the problem of the size of the keys will be fatal to it, except for specific military applications, which require an irreproachable protection. The fact that the key consists of a sequence of totally random characters is an essential condition for the security of the Vernam cipher (OPT). The surest way to respect this constraint is therefore to create the keys by exploiting the concept of insensitive sensitivity to the initial conditions of chaotic systems, which is a fundamental characteristic of dynamic systems. In this paper, we will try to make a new reading of this algorithm and to try to find a practical solution to the size of this key by introducing the concept of chaos to this realization.

Published
2019-12-30