Is MPEG encryption by using random list instead of zigzag order secure?

Lintian Qiao, Klara Nahrstedt, Ming Chit Tam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper discusses the problems of the MPEG video encryption algorithm by using random permutation list instead of zigzag order within the MPEG compression process. We show that 1) the encryption method causes a significant size increase of the MPEG video stream, hence defeats the purpose of compression, and 2) the encryption method can not withstand the known-plaintext attack, therefore, should NOT be considered as secure. We also discuss other solutions to achieve secure, time-efficient, and size-preserving MPEG-video encryption.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Symposium on Consumer Electronics, ISCE
Editors Anon
PublisherIEEE
Pages226-229
Number of pages4
StatePublished - 1997
EventProceedings of the 1997 IEEE International Symposium on Consumer Electronics, ISCE'97 - Singapore, Singapore
Duration: Dec 2 1997Dec 4 1997

Other

OtherProceedings of the 1997 IEEE International Symposium on Consumer Electronics, ISCE'97
CitySingapore, Singapore
Period12/2/9712/4/97

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Qiao, L., Nahrstedt, K., & Tam, M. C. (1997). Is MPEG encryption by using random list instead of zigzag order secure? In Anon (Ed.), Proceedings of the IEEE International Symposium on Consumer Electronics, ISCE (pp. 226-229). IEEE.