Strengthening Data Security Using Multi-level Cryptography Algorithm

Abstract

AbstractInformation security incorporates information encryption, hashing, tokenization, and key administration rehearses that ensure information over all applications and stages. The purpose of this paper is to strengthen data security using multi-level cryptography algorithm. A half-breed calculation is a calculation that joins at least two different calculations that take care of a similar issue, either picking one (contingent upon the information) or exchanging between them through the span of the calculation. This is commonly done to consolidate wanted highlights of each, with the goal that the general calculation is superior to the individual parts. The average values are calculated here for time and memory parameters by combining three algorithms which are multi-prime RSA, DES, and Vernam Cipher. RSA calculation is a well-known exponentiation in a limited field over whole numbers including prime numbers. The Data Encryption Standard is a symmetric-key calculation for encryption of computerized information. Despite the fact that its short key length of 56 bits makes it excessively unreliable for applications, it has been profoundly powerful in the headway of cryptography. In present day wording, Vernam Cipher is an even stream cipher where the plaintext is joined with an arbitrary stream of information (the “keystream”) of a similar range, to create the cipher text, utilizing XOR. Subsequent to consolidating these three calculations, the framework will be somewhat rugged. The results have been represented after using a different number of primes with this hybrid algorithm. The preferences and thinking for utilizing this approach have additionally been recorded in this paper.KeywordsRSADESVernam cipher