Mixing Compression and CA Encryption

Bruno Martin 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : We consider the enciphering of a data stream while it is being compressed by a dictionary algorithm. This scheme has to be compared to the classical encryption after compression methods used in classical security protocols. Actually, most cryptanalysis techniques exploit patterns found in the plaintext to crack the cipher and compression techniques reduce these attacks. Our scheme is based on a LZ compression algorithm in which a Vernam cipher has been included. We first present an experiment with a pseudo-random sequence generated by a simple linear feedback shift register before considering pseudo-random sequences generated by cellular automata. We make some remarks on the security by trying to measure the randomness of our method with some statistical tests. Such a scheme could be employed to increase the speed of some security protocols and to decrease the computing power for mobile devices.
Type de document :
Communication dans un congrès
Boulanger, D. SAR-SSI, Jun 2007, Annecy, France. IAE Lyon, pp.255-266, 2007
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00304320
Contributeur : Bruno Martin <>
Soumis le : jeudi 24 juillet 2008 - 12:47:37
Dernière modification le : lundi 5 novembre 2018 - 15:48:02
Document(s) archivé(s) le : vendredi 5 octobre 2012 - 10:42:58

Fichier

27487CompressionCAEncryption.p...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00304320, version 1

Collections

Citation

Bruno Martin. Mixing Compression and CA Encryption. Boulanger, D. SAR-SSI, Jun 2007, Annecy, France. IAE Lyon, pp.255-266, 2007. 〈hal-00304320〉

Partager

Métriques

Consultations de la notice

158

Téléchargements de fichiers

152