Encryption Methods
In today’s conditions, we provide data exchange over the internet for many transactions. All these transactions are carried out with our personal and credit card information. Therefore, the seamless transportation of data and privacy has become our most significant requirement. As a result of this requirement, various encryption and keying algorithms have been developed in order to send and receive data securely. There are two types of encryption algorithms according to the characteristics of the key used for encryption.
1- Symmetric Encryption
Symmetric encryption, also known as secret key encryption, is performed using the same key to encrypt and decrypt information. The secret key is also sent to the recipient with the secret text, and the conversion of encrypted text to plain text is performed using this key.
DES (Data Encryption Standard)
It is a kind of data encryption standard accepted by international standards after it was developed in IBM in 1970. The text to be encrypted is divided into pieces and each piece is encrypted independently from each other, so that encryption is performed in certain blocks. At the same time, the same operations are performed over the blocks to open the encrypted text. This encryption method creates a new key specific to that use each time it is used. It uses a 54-bit long encryption method, despite the 64-bit long keys. Consequently, the seamless transport of information and secrecy has been our most critical prerequisite.
RC4 Cipher
The encryption algorithm that was designed in 1987 is also known as “Rivest Cipher 4.” Its security depends on the use of a random key, although a key length of 5–16 bytes is commonly used. It perceives the sequence to be encrypted as a flowing sequence. The basic algorithm logic is based on random permutation. While the high speed is considered one of its strong features, using the algorithm key once is a weak feature.
Triple DES (TDES)
It is an encryption algorithm developed by IBM in 1978. It works with the method of encrypting the Des encryption method 3 times and using different keys. That is why it is considered an efficient form of encryption. Two or 3 keys of 112 or 168 bits are executed one after the other. It is a bi-directional algorithm. Data is stored in encrypted form and can be recalled at any time. But slow running is the disadvantage of this algorithm. It is used in internet protocol and banking transactions.
AES (Advanced Encryption Standard)
It was developed in 2000 by two Belgian cryptographers using the Rijndael block cipher. The 128,192 and 256-bit key lengths are used for this encryption algorithm, which is more reliable than the DES. Data is used in the algorithm by dividing it into (4x4) matrixes called states. As AES encryption is completed, separate loop allocations are made for 128-bit, 192-bit and 256-bit key lengths. According to the DES algorithm, it is easy to apply and requires less memory, which is one of its powerful features.
Blowfish
This encryption method, which is a block cipher designed by Bruce Schneier in 1993, is an algorithm that can be used instead of DES or IDEA. It uses 32–448 bits long keys. It is a free encryption algorithm available free for all users.
2- Asymmetric Encryption
In asymmetric encryption, also known as public key encryption, there are 2 different keys, public and private keys, unlike the symmetric algorithm. The decryption and encryption key are not the same as in the symmetric encryption key. The key to the cipher is the public key and the decryptor is the private key. Text encrypted with a public key can only be decrypted with a key belonging to that user. This makes it a lot more effective than symmetric encryption.
RSA
It was developed in 1978 by a Ron Rivest, Adi Shamir and Leonard Adleman, and takes its name from the initials of the people who developed it. RSA handles both encryption and decryption. This encryption algorithm can be used to provide privacy and digital signature. The principle of operation is based on the modular arithmetic of large numbers. The integer formed by the product of two very large prime numbers is formed. While the size of the number provides an advantage in terms of reliability, it is one of the disadvantages of slowness in transactions. RSA algorithm consists of 3 steps known as key generation, encryption, and decryption.
DSA (Digital Signature Algorithm)
It was introduced as a digital signature standard by the National Institute of Standards and Technology (NIST) in 1991. DSA, which is a public-key encryption algorithm like RSA, does not encrypt using private keys or decrypt using public keys, unlike RSA. To create a digital signature consisting of a 160-bit number instead uses a unique mathematical operation. Since the hash of the message to be transmitted is obtained, the message encrypted with the private key specified by the sender produces a digital signature. With the public key referring to the private key, it proves that the message came from the right receiver.
Diffie-Hellman
This algorithm, the first public key algorithm, was included in Diffie and Hellman’s 1976 paper “New Directions in Cryptography” It is based on components that are never transmitted directly. The aim of this algorithm is to ensure the safe transmission of a key between two users and the solution of encrypted key messages. With this algorithm, key change and distribution in symmetric encryption algorithms is solved to a great extent.
REFERENCES
- Beşkirli, Ayşe, Durmuş Özdemir, and Mehmet Beşkirli. “Şifreleme Yöntemleri ve RSA Algoritması Üzerine Bir İnceleme.” Avrupa Bilim ve Teknoloji Dergisi (2019): 284–291.
- Chaudhari, Swapnil, et al. “A Survey on Methods of Cryptography and Data Encryption.”
- Mitali, Vijay Kumar, and Arvind Sharma. “A survey on various cryptography techniques.” International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) 3.4 (2014): 307–312.
- Mohammad, Omar Farook, et al. “A survey and analysis of the image encryption methods.” International Journal of Applied Engineering Research 12.23 (2017): 13265–13280.
- Yerlikaya, Tarık, Ercan Buluş, and Nusret Buluş. “Asimetrik Şifreleme Algoritmalarinda Anahtar Değişim Sistemleri.” Akademik Bilişim (2006): 9–11.
