This flowchart overcomes the problems mentioned in Section III and achieves the objectives as mentioned in Section IV. is the flowchart which shows the complete working of our proposed algorithm. The main objectives of our proposed algorithm is to calculate the data compression ratio once the original data is compressed using RLE algorithm, calculate the time taken to encrypt the compressed data and finally calculate MSE to determine whether the original data was recovered successfully or not. Also, once the original data gets recovered, there is no assurance whether the recovery of data was successful or were there any errors encountered. In the existing system, there is no provision to calculate compression ratio and the total time taken for encryption of compressed data. Recently research was also carried out for the implementation of doubling and point addition in Verilog system which is used in elliptic curve point multiplication for point addition and doubling, modular addition, modular squaring and then projecting to coordinate systems (referred as base paper). Additionally, different fault attacks for elliptic curve digital signature algorithm were proposed along with fault injection technique in ECC and the implementation of scalar multiplication to determine the secret signing key.
Encryptme and hotmail update#
Moreover, in 2013, research work has successfully extracted the security flaws and proposed an ECC-based scheme in addition to the password update and secured password authentication which is effectively aimed to guard against several related attacks. Such systems have confined resources like processing speed, storage, and domain specific CPU architecture. The research in the field of ECC is mostly concentrated on its implementation on application specific systems. LITERATURE REVIEWĮCC has proved to provide equivalent level of security with key of smaller sizes. RLE can also decompress the compressed data and can recover the original data. To make it more secure, this paper has reduced the data storage problem by combining RLE algorithm with ECC. Shows a block diagram of working of RLE algorithm.Ĭompress Decompress Working of RLE RLE takes the original data and compresses it to get compressed data which in turn reduces the space complexity. "First bit (which is 0) is mentioned as 1. as 1 2 1 in output in which count of consecutive 1s (which equals 2) and 0s (which equals 1) is recorded. Below two formulae shows how Compression ratio and MSE is calculated. Compression ratio is mentioned in percentage and denotes the extent to which the original data got compressed after using RLE algorithm. Mean Square Error (MSE) is calculated to recheck whether original data got recovered or not.
Encrypted data is also decrypted to recover the original data. This paper calculates the compression ratio of the compressed data with the original data and also calculates the time taken for encryption process.
In the existing scenario data complexity or the data storage problem got reduced by using RLE algorithm and data security got increased by using permutation method for private key generation.