Description

Modern cryptography is heavily based on mathematical theory and computer science practice and the cryptographic algorithms are designed around computational hardness assumptions, making such algorithms hard to break in practice by any adversary. The hardware process to develop the cryptography function and to modification process to mainly based upon the internal gate architecture. The modified carry look-ahead adder based DCT architecture used to the cryptography applications. A fast algorithm for discrete cosine transforms (DCT)-domain image resizing is presented. To reduce computations, fast Wino grad DCTs are applied to a recently reported image resizing scheme that uses DCT low-pass truncated approximation. Our fast algorithm yields significant improvement in computational complexity over the fast algorithm of the reported method. Video processing systems such as HEVC requiring low energy consumption needed for the multimedia market has lead to extensive development in fast algorithms for the efficient approximation of 2-D DCT transforms. The DCT is employed in a multitude of compression standards due to its remarkable energy compaction properties. The proposed DCT approximation is a candidate for reconfigurable video standards such as HEVC. The proposed transform and several other DCT approximations are mapped to systolic-array digital architectures and physically realized as digital prototype circuits using FPGA technology and mapped to 45 nm CMOS technology.