Entropy of selectively encrypted strings

Authors:
Reine Lundin;Stefan Lindskog
Affiliations:
Department of Computer Science, Karlstad University, Sweden;Department of Computer Science, Karlstad University, Sweden
Venue:
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
Year:
2011

Citing 5
Cited 0

Elements of information theory

Elements of information theory
Claude Elwood Shannon: collected papers

Claude Elwood Shannon: collected papers
Low power scalable encryption for wireless systems

Wireless Networks - Special issue VLSI in wireless networks
Performance Study of a Selective Encryption Scheme for the Security of Networked, Real-Time Video

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Security implications of selective encryption

Proceedings of the 6th International Workshop on Security Measurements and Metrics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A feature that has become desirable for low-power mobile devices with limited computing and energy resources is the ability to select a security configuration in order to create a trade-off between security and other important parameters such as performance and energy consumption. Selective encryption can be used to create this trade-off by only encrypting chosen units of the information. In this paper, we continue the investigation of the confidentiality implications of selective encryption by applying entropy on a generic selective encryption scheme. By using the concept of run-length vector from run-length encoding theory, an expression is derived for entropy of selectively encrypted strings when the number of encrypted substrings, containing one symbol, and the order of the language change.