Component of Symmetric key Algorithm TORDES with its Functionality (original) (raw)

METRICS FOR PERFORMANCE EVALUATION OF ENCRYPTION ALGORITHMS

Network and internet applications are growing rapidly in the recent past. These applications are used by thousands of users and controlled by different administrative entities. It is mainly used as an efficient means for communication, entertainment and education. With the rapid growth of internet, there is a need for protecting confidential data. The Internet was however originally designed for research and educational purpose, not for commercial applications. So internet was not designed with security in mind. As the internet grows the existing security framework was not adequate for modern day applications. Cryptography plays a vital role in network security. Though, many cryptographic algorithms are implemented by the research community all over the world. But all the algorithms had some limitations such as the algorithms are implemented for specific applications, key size or block size limited to 64,128 and 256 bits. This paper presents various evaluation techniques and performance metrics that can be used to test any cryptographic algorithms. This work will be base for further research work especially in implementing new encryption algorithms.

A Study of TORDES with other Symmetric Key Algorithms

2012

The selective application of technological and related procedural safeguard is an important responsibility of every cryptographic algorithm in providing adequate security to its electronic data systems. This paper specifies TORDES including its primary part and cryptographic engines and also provides a comparison of TORDES with other algorithms namely MODDES, DES, TDES and AES in terms of memory requirement and encryption- decryption time.

Rating the Security Strength of Cryptographic Algorithms

Journal of Applied Mathematics & Bioinformatics, 2022

In this study, we propose a method in order to estimate the strength of a cryptographic algorithm. The method combines the evaluation of the cryptographic key length and the evaluation of the success rate of the randomness tests in the algorithm output samples. In the first step, the algorithm is classified into one of four general categories, according to its key size, taking into account the current computer power which a cryptanalyst can use for exhaustive key search. In the second step, we examine the success rate of the tests on the output samples. For this, the maximum accepted number of the rejected samples is calculated, taking as parameters the total number of samples (which depends from the selected sampling error) and the desired significance level and confidence interval for the success rate of the tests. If the rejected samples do not exceed the maximum number, the algorithm is considered as “random” and it is rated in the initial strength category due to its key size. ...

TORDES-THE NEW SYMMETRIC KEY ALGORITHM

Journal of University of Anbar for Pure Science (A refereed academic journal with ISSN: 1991-8941), 2012

The selective application of technology and related procedural safeguard is an important responsibility for cryptographic algorithm to its electronic data systems. This paper specifies the functionality of TORDES for encryption and decryption to protect the sensitive unclassified data. TORDES is made available within the context of a total security program consisting of physical security procedure.

Crypto Analysis with A Symmetric Key Algorithm TORDES

A new Algorithm TORDES was introduced which overcome these drawback of old algorithm and make it secure over communication channels. These are secret key that does not totally depend on the key. As such, if the key value becomes known, then we can decipher it without the knowledge of code sequence generated from that particular processing. And the related decryption algorithm which will make TORDES highly secure on second generation machine tested with result.

Evaluating The Performance of Symmetric Encryption Algorithms

Int. J. Netw. Secur., 2010

Internet and networks applications are growing very fast, so the needs to protect such applications are increased. Encryption algorithms play a main role in information security systems. On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of six of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish, and RC6. A comparison has been conducted for those encryption algorithms at different settings for each algorithm such as different sizes of data blocks, different data types, battery power consumption, different key size and finally encryption/decryption speed. Experimental results are given to demonstrate the effectiveness of each algorithm.

A randomness test for block ciphers

Applied Mathematics and Computation, 2005

This paper describes a randomness test which can be used to measure the cryptographic strength of a block cipher or its underlying cryptographic primitive(s). Cryptographic strength in the context of this paper is related to the ability of the round function to produce a random output which in turn is defined as the distance between a theoretical calculation and an