Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
This paper investigates compression of data encrypted with block ciphers, such as the Advanced Encryption Standard. It is shown that such data can be feasibly compressed without knowledge of the secret key. Block ciphers operating in various chaining modes are considered and it is shown how compression can be achieved without compromising security of the encryption scheme. Further, it is shown that there exists a fundamental limitation to the practical compressibility of block ciphers when no chaining is used between blocks. Some performance results for practical code constructions used to compress binary sources are presented. © 2012 IEEE.
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
B.K. Boguraev, Mary S. Neff
HICSS 2000
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012