Methods for encrypting and decrypting MPEG video data efficiently
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Algebraic aspects of cryptography
Algebraic aspects of cryptography
Digital video coding standards
Digital consumer electronics handbook
An Efficient MPEG Video Encryption Algorithm
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Public Key Encryption of Images and Videos in Real Time Using Chebyshev Maps
CGIV '08 Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation
An Efficient MPEG Video Encryption Scheme Based on Chaotic Cipher
CISP '08 Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 3 - Volume 03
A Compound Video Encryption Algorithm Based on Hyperchaos
ICICIC '08 Proceedings of the 2008 3rd International Conference on Innovative Computing Information and Control
On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
IEEE Transactions on Computers
Hi-index | 0.00 |
The algorithm's improvement is started by compression process which is discussed in this paper, and continued by encryption process using finite field Z23-based bit stream. In this paper will be described integration of Discrete Cosine Transform (DCT) process and quantization in video data compression algorithm. The integration is done in order to improve time and compression ratio. The method is employed by inserting quantization process in the DCT function, as well as for the decompression process. It can be done since the orthonomality property of the prior DCT function is still valid, algebraically. The use of finite field Z23 as the basis of bit stream encryption process with chaotic cipher. Construction of finite field Z23 is based on finite field Z2, algebraic concept employed in cryptography. Finite field Z23 has 8 elements whereas Z2 has 2 elements. Therefore more combination of bit stream composition pattern can be achieved and robustness against known-plaintext attack is expected. Result obtained in this paper is related with the first aim, that is, a better compression time. It is obtained based on mathematical and algorithm analyses done, that the integration of the two processes can improve to a better time complexity.