Implementation of Data Security with Wallace Tree Approach Using Elliptical Curve Cryptography on FPGA

The growth of computing resources and parallel computing has led to significant needs for efficient cryptosystems over the last decade. Elliptic Curve Cryptography (ECC) provides faster computation over other asymmetric cryptosystems such as RSA and greater security. For many cryptography operations, ECC can be used: hidden key exchange, message encryption, and digital signature. There is thus a trade-off between safety and efficiency with regard to speed, area and power requirements. This paper provides a good ECC approach to encryption by replacing the Vedic multiplier (16 bit) with the Wallace tree multiplier with an improved output (128 bit). The proposed design processes data recurringly with less volume, less power consumption and greater velocity, in addition to improving efficiency. Using Xilinx 2015.2 software, the entire proposed design is synthesized and simulated and implemented on the ZYNQ FPGA Board. Compared with previous implementations, a significant improvement in field efficiency, time complexity and energy demand is demonstrated by the proposed design.


INTRODUCTION
Data protection refers to the defense against unauthorized data access and corruption over the life cycle of the data operation. The best data security cryptography provides two main areas, Cryptography symmetrical and asymmetric. ECC is the highest norm of asymmetric encryption (Elliptic Curve Cryptography). The Elliptic Curve Cryptography covers all relevant primitives of asymmetric cryptography such as digital signatures and key algorithms of agreement. The key ECC lengths linearly increase while the key lengths on existing RSA encryption methods exponentially increase with the increase in levels of security. For instance, 128-bit protection requires a 3,072-bit RSA key but only a 256-bit ECC key. The table 1 shows comparison between RSA and ECC for a given symmetric key size Table 1 : key size comparison

LITERATURE SURVEY:
This paper outlines the application of data security with cryptography, ECC.
Cryptography is a part of cryptology which is the art to make a cryptosystem capable of ensuring the security of facts. The true backup of digital documents is involved in cryptography. It refers to the design of mechanisms based entirely on mathematical algorithms which give crucial safety information. Cryptographic structures are typically divided into three different dimensions: Symmetric cryptography, Asymmetric cryptography, Hash functions.
Symmetric cryptography: A specific password/code or arbitrary number string or letter generated by a safe Random Number Generator may be the secret key for both sender and receiver to use Asymmetric cryptography: The asymmetric variant is also referred to as public key cryptography. The use of private and public keys to encrypt and decrypt data is asymmetrical encryption. The keys are just large numbers paired but not identical (asymmetric).
Public key: A key that is shared with everyone is public key Private Key: other key in the pair which is kept secret is called private key Each key can be used for a message encryption; decryption uses the other key to the message encryption.
Hash functions: A hash function is a math feature that converts an input number into a numeric value that is compressed. The hash feature is randomly input, but the results are fixed.
Elliptic Curve Cryptography (ECC): Elliptical Curve Cryptography (ECC) is a form of public key encryption based on the theory of elliptical curves that can be used to construct faster, smaller and more precise cryptographic keys. ECC generates keys as a function of very large prime numbers rather than as the traditional generation mechanism by the characteristics of the elliptic curve equation. Combined with most public encryption strategies such as RSA and Diffie-Hellman, the technology can be used.

ENCRYPTION USING ECC ALGORITHM
Let' M' be the message we send. This message must be represented on the curve. Convert the original message to C1 and C2. The cipher text C1 is obtained by adding it to point P and by multiplying the added point with k.
Consider the' E' curve, randomly select' k' from [1-(n-1)].random number k (64 bit) Two cipher texts will be generated so that they are C1 and C2.

RESULTS:
RTL Schematic: RTL schematic is described as register transfer logic that means the logic is transferred to registers it is also known as designer view because of it is looking like what is the intension of designer. Figure 6 shows the RTL Schematic of Encryption Figure 7 shows the RTL Schematic of decryption The simulation is the process which is termed as the final verification in respect to its working whereas the schematic is the verification of the connections and blocks. The simulation window is launched as shifting from implementation to the simulation on the home screen of the tool, and the simulation window confines the output in the form of wave forms output. Here it has the flexibility of providing the different radix number systems. In this project we used Verilog code written for 256 Message bit Encryption of ECC algorithm .Simulation is done by using Xilinx ISE simulator. The simulation output for Encryption of ECC Algorithm is shown below in figure 9 • Public key(Q)=d*p=15000 • random number(k)=512

CONCLUSION & FUTURE SCOPE CONCLUSION
In this project the area is reduced by using the Wallace tree multiplier and single point method. Previously the paper was implemented for 16_bit Vedic multiplier and in this project ECC Algorithm code is implemented for 128_bit Wallace tree multiplier. And, in view of the performance, ECC offers much faster encryption and decryption for smaller key sizes than RSA, finally the performance also increased. The ECC Algorithm is designed coded and verified through simulation and synthesis results using Xilinx tools.

FUTURESCOPE
With the short development of communication terminals and networks, customers could reap masses of offerings dispensed over the sector, on every occasion and wherever. Nonetheless, increasingly safety issues save you the advanced technology from moving forward, and increasingly more human beings start to difficulty about the safety problems of their records and conversation packages. In future, the use of Elliptic Curve Cryptography on the net of issue (IoT). Most of the device relies upon at the internet, so it's miles IoT this is a brilliant evolution of technology. Smart home, metropolis, college are some familiar examples of the net of factors. It's far a first-rate challenge to modernize our world into the clever world from the security attitude.