
TL;DR
This paper introduces a novel encryption scheme that combines LZ compression with a Vernam cipher, aiming to enhance security and efficiency for mobile devices by reducing computational requirements.
Contribution
It proposes a new method of encrypting data during compression using LZ and Vernam cipher, with security analysis based on statistical randomness tests.
Findings
The scheme shows potential for increased speed in security protocols.
Statistical tests indicate the cipher's randomness properties.
Potential for reduced computational load on mobile devices.
Abstract
We consider the enciphering of a data stream while being compressed by a LZ algorithm. This has to be compared to the classical encryption after compression methods used in security protocols. Actually, most cryptanalysis techniques exploit patterns found in the plaintext to crack the cipher; compression techniques reduce these attacks. Our scheme is based on a LZ compression in which a Vernam cipher has been added. We make some security remarks by trying to measure its randomness with statistical tests. Such a scheme could be employed to increase the speed of security protocols and to decrease the computing power for mobile devices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption
