On a generalization of Shannon's random cipher result

Prasanna K. Sahoo

Kybernetika (1986)

  • Volume: 22, Issue: 5, page 385-392
  • ISSN: 0023-5954

How to cite

top

Sahoo, Prasanna K.. "On a generalization of Shannon's random cipher result." Kybernetika 22.5 (1986): 385-392. <http://eudml.org/doc/27736>.

@article{Sahoo1986,
author = {Sahoo, Prasanna K.},
journal = {Kybernetika},
keywords = {random ciphers; variation of Shannon's random cipher model; redundancy; key rate; ciphering theorem},
language = {eng},
number = {5},
pages = {385-392},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On a generalization of Shannon's random cipher result},
url = {http://eudml.org/doc/27736},
volume = {22},
year = {1986},
}

TY - JOUR
AU - Sahoo, Prasanna K.
TI - On a generalization of Shannon's random cipher result
JO - Kybernetika
PY - 1986
PB - Institute of Information Theory and Automation AS CR
VL - 22
IS - 5
SP - 385
EP - 392
LA - eng
KW - random ciphers; variation of Shannon's random cipher model; redundancy; key rate; ciphering theorem
UR - http://eudml.org/doc/27736
ER -

References

top
  1. J. Aczél, Z. Daróczy, On Measures of Information and Their Characterizations, Academic Press, New York 1975. (1975) MR0689178
  2. Z. Daróczy, Generalized information functions, Inform. and Control 16 (1970), 36 - 51. (1970) MR0272528
  3. A. El-Sayed, On Different Information Measures and Communication Channels, Ph. D. Thesis University of Waterloo, Waterloo, Ontario 1975. (1975) 
  4. A. El-Sayed, A generalized entropy form of the Fano inequality, Utilitas Math. 12 (1977), 289-298. (1977) Zbl0386.94005MR0479673
  5. J. Havrda, F. Charvát, Quantification method of classification process, concept of structural a-entropy, Kybernetika 3 (1967), 30-35. (1967) MR0209067
  6. M. Hellman, An extension of the Shannon theory approach to cryptography, IEEE Trans. Inform. Theory IT-23 (1977), 289-294. (1977) Zbl0362.94030MR0530093
  7. Pl. Kannappan, On some functional equations from additive and nonadditive measures I, Proc. Edinburgh Math. Soc. 23 (1980), 145-150. (1980) MR0597119
  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. (1986) MR0852326
  9. A. B. Khan R. Autar, H. Ahmad, Noiseless coding theorems for generalized non-additive entropy, Tamkang J. Math. 12 (1981), 15-20. (1981) MR0714490
  10. L. Losonczi, A characterization of entropies of degree , Metrika 28 (1981), 237-244. (1981) MR0642931
  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. (1979) Zbl0409.94018MR0536240
  12. P. K. Sahoo, Renyi’s entropy of order and Shannon’s random cipher result, J. Combin. Inform. System Sci. 8 (1983), 263-270. (1983) MR0783765
  13. C. E. Shannon, Communication theory of secrecy system, Bell System Tech. J. 28 (1949), 656-715. (1949) MR0032133

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.