WALLACE TREE HIGH PERFORMANCE STRATEGY FOR DATA PRIVACY EMPLOYING ELLIPTIC CURVE CRYPTOLOGY

Abstract

The ECC is the best standard for asymmetric cryptography. The success of ECC is due to its much better protection than many symmetric and asymmetric models. In 1985, Victor Miller and Neal Koblitz proposed entirely different use of elliptic curves in cryptography. Elliptic Cryptography (ECC) is an elliptical image encryption technique related to public curve theory which is used to build easier, smaller and better cryptographic keys. Elliptic curve (ECC) cryptography is indeed a key public cryptography method. The proposed design consists of a single point multiplication algorithm for ECC implementation on FPGA. And instead of Vedic Multiplier, we used Wallace tree multiplier. This paper offers an effective ECC method for cryptography, enhanced efficiency by replacing the Vedic multiplier (16 bits) with Wallace tree multiplier (128 bit). The proposed design not only enhances performance, but processes the information repetitively in smaller area, low power usage and more rapidly. The entire concept proposed is synthesized, simulated and implemented on the ZYNQ FPGA board using Xilinx 2015.2.