zbMATH — the first resource for mathematics

On a generalization of Shannon’s random cipher result. (English) Zbl 0618.94007
In this paper a variation of Shannon’s random cipher model is considered. A redundancy and a key rate of order \(\alpha\) are formally defined and a ciphering theorem is proven.
Reviewer: A.Sgarro

94A24 Coding theorems (Shannon theory)
94A17 Measures of information, entropy
94A60 Cryptography
Full Text: EuDML
[1] J. Aczél, Z. Daróczy: On Measures of Information and Their Characterizations. Academic Press, New York 1975. · Zbl 0345.94022
[2] Z. Daróczy: Generalized information functions. Inform. and Control 16 (1970), 36 - 51. · Zbl 0205.46901
[3] A. El-Sayed: On Different Information Measures and Communication Channels. Ph. D. Thesis University of Waterloo, Waterloo, Ontario 1975.
[4] A. El-Sayed: A generalized entropy form of the Fano inequality. Utilitas Math. 12 (1977), 289-298. · Zbl 0386.94005
[5] J. Havrda, F. Charvát: Quantification method of classification process, concept of structural a-entropy. Kybernetika 3 (1967), 30-35. · Zbl 0178.22401
[6] M. Hellman: An extension of the Shannon theory approach to cryptography. IEEE Trans. Inform. Theory IT-23 (1977), 289-294. · Zbl 0362.94030
[7] Pl. Kannappan: On some functional equations from additive and nonadditive measures I. Proc. Edinburgh Math. Soc. 23 (1980), 145-150. · Zbl 0468.39002
[8] Pl. Kannappan, P. K. Sahoo: On a functional equation connected to sum form non-additive information measures on an open domain - I. Kybernetika 22 (1986), 268-275. · Zbl 0609.39005
[9] A. B. Khan R. Autar, H. Ahmad: Noiseless coding theorems for generalized non-additive entropy. Tamkang J. Math. 12 (1981), 15-20. · Zbl 0484.94019
[10] L. Losonczi: A characterization of entropies of degree \(\aplha\). Metrika 28 (1981), 237-244. · Zbl 0469.94005
[11] S. C. Lu: The existence of good cryptosystems for key rates greater than the message redundancy. IEEE Trans. Inform. Theory IT-25 (1979), 475-477. · Zbl 0409.94018
[12] P. K. Sahoo: Renyi’s entropy of order \(\aplha\) and Shannon’s random cipher result. J. Combin. Inform. System Sci. 8 (1983), 263-270. · Zbl 0622.94012
[13] C. E. Shannon: Communication theory of secrecy system. Bell System Tech. J. 28 (1949), 656-715. · Zbl 1200.94005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.