DocumentCode
2270916
Title
Cryptanalysis of Shannon-Fano-Elias codes
Author
Katti, Rajendra ; Ruan, Xiaoyu
Author_Institution
Dept. of Electr. & Comput. Eng., North Dakota State Univ., Fargo, ND
fYear
2005
fDate
4-9 Sept. 2005
Firstpage
1231
Lastpage
1235
Abstract
Data compression techniques such as Shannon-Fano-Elias coding are often used in conjunction with cryptography. We discuss using Shannon-Fano-Elias codes for encryption. We focus mainly on the problem of deciphering a binary sequence that has been Shannon-Fano-Elias encoded. We show that if a cryptanalyst knows the source symbols and the probability mass function (PMF), then the Shannon-Fano-Elias coded sequences may be deciphered within a finite amount of time by exhaustive search. A simple strategy is introduced to prevent this type of eavesdropping
Keywords
binary sequences; codes; cryptography; data compression; Shannon-Fano-Elias codes; binary sequence; cryptanalysis; cryptography; data compression techniques; encryption; probability mass function; Binary sequences; Cryptography; Data compression; Decoding; Distribution functions; Huffman coding; Multimedia communication; Multimedia computing; Multimedia systems; Random variables;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location
Adelaide, SA
Print_ISBN
0-7803-9151-9
Type
conf
DOI
10.1109/ISIT.2005.1523538
Filename
1523538
Link To Document