# The Shannon Cipher System With Correlated Source Outputs and Wiretapper Guessing Subject to Distorion

## Keywords:

Shannon cipher system, Correlated sources, Guessing rate## Abstract

The Shannon cipher system with discrete memoryless sources is considered. The wiretapper gains the cryptogram through the public noiseless channel and tries to guess the secret information which is related to the encrypted plaintext. It is assumed that at each step of sequential guesses the wiretapper has a testing mechanism to identify the secret message within the given distortion level. The security level of the encryption system is measured by the guessing rate which is the highest asymptotic exponential growth rate of the expected number of guesses. The estimations of guessing rate are obtained.

## References

C. E. Shannon, “Communication theory of secrecy systems", Bell System Thechnical Journal, vol.28, no. 3, pp. 565-715, 1949.

M. E. Hellman, “An extention of the Shannon theory approach to cryptography", IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 289-294, 1977.

N. Merhav and E. Arikan, “The Shannon cipher system with a guessing wiretapper", IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 1860-1866, 1999.

Y. Hayashi and H. Yamamoto, “Coding theorems for the Shannon cipher system with a guessing wiretapper and correlated source outputs", IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2808-2817, June 2008.

M. K. Hanawal and R. Sundaresan ,”The Shannon cipher system with a guessing wiretapper: General sources", IEEE Transactions on Information Theory, vol. 57, no. 4, pp. 2503-2515, 2011.

E. A. Haroutunian and A. R. Ghazaryan, “On the Shannon cipher system with a wiretapper guessing subject to distortion and reliability requirements", IEEE-ISIT 2002, Lausanna, June 30-July 5, p. 324, 2002.

E. A. Haroutunian, “Realibility approach in wiretapper guessing theory", in “Aspects of Network and Information Security", NATO Science for Peace and Security, series D: Information and Communication Security, IOS Press, vol. 17, pp. 248-260, 2008.

E. A. Haroutunian and T. M. Margaryan, “The Shannon cipher system with a guessing wiretapper eavesdropping through a noisy channel", Transactions of IIAP NAS RA, Mathematical Problems of Computer Science, vol. 35, pp. 70-76, 2011.

E. A. Haroutunian and T. M. Margaryan, “The Shannon cipher system with a guessing wiretapper eavesdropping through a noisy channel", 20th Telecommunication Forum TELFOR, Serbia, November 20-22, pp. 532-536, 2012.

E. A. Haroutunian and T. M. Margaryan, “Wiretapper guessing by noisy channel for the Shannon cipher system with correlated source outputs", Proceedings of International Conference Computer Science and Information Technologies, pp. 125-128, 2011.

T. Margaryan, “On the Shannon cipher system with correlated source outputs and guessing wiretapper eavesdropping through a noisy Channel", Transactions of IIAP NAS RA, Mathematical Problems of Computer Science, vol. 37, pp. 17-24, 2012.

E. A. Haroutunian and T. M. Margaryan, “On the Shannon Cipher System with Noisy Channel to the Wiretapper Guessing Subject to Distortion Criterion", Annual Session Dedicated to 90 Anniversary of Rafael Alexandrian, Yerevan, pp. 53-54, 2013.

T. M. Margaryan and E. A. Haroutunian, “On the Shannon cipher system with distortion and guessing wiretapper eavesdropping through a noisy channel", Proceedings of International Conference Computer Science and Information Technologies, pp. 116-120, 2013

E. Arikan and N. Merhav, “Guessing subject to distortion", IEEE Transactions on Information Theory, vol. 44, no. 3, pp. 1041-1056, 1998.

I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, New York: Academic, 1981.

T. M. Cover and J. A. Thomas, Elements of Information Theory, Second Edition, New York: Wiley, 2006.

## Downloads

## Published

## How to Cite

*Mathematical Problems of Computer Science*,

*41*, 47–54. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/229

## Issue

## Section

## License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.