Analysis of secret functions with application to computer cryptography

Authors:
Ingemar Ingemarsson
Affiliations:
Linköping University, Linköping, Sweden
Venue:
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Year:
1976

Citing 0
Cited 1

Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.01

Visualization

Abstract

In computer cryptography we cannot avoid that data and the corresponding encrypted data can be read by an outside observer. The information contained in these observations may be used to decrypt parts of encrypted data or ultimately to identify the key in the cryptographic transformation. In this paper we have analyzed this situation using the concepts of information theory. The result shows that in most cases it is theoretically possible for an outside observer to identify the key after very few observations. As this must be avoided we have to rely on computational complexity in the process of deriving the key. This is achieved by using one-way functions which are practically impossible to invert.