A performance based comparison of various symmetric cryptographic algorithms in run-time scenario

2016 ◽  
Author(s):  
Praveen Kumar ◽  
Seema Rawat ◽  
Tanupriya Choudhury ◽  
Saurabh Pradhan
Keyword(s):  
Cryptographic Algorithms ◽  
Run Time ◽  
A Performance

Empirical and Statistical Comparison of Intermediate Steps of AES-128 and RSA in Terms of Time Consumption

2021 ◽  
Author(s):  
Prashant Pranav ◽  
Sandip Dutta ◽  
Soubhik Chakraborty
Keyword(s):  
Computational Complexity ◽  
Finite Differences ◽  
Fundamental Theorem ◽  
Weight Factor ◽  
Mathematical Functions ◽  
Time Consumption ◽  
Statistical Comparison ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Run Time

Abstract Cryptographic algorithms are composed of many complex mathematical functions. When analyzing the complexity of these algorithms, one fixes priory the overall complexity of the algorithm as the complexity of the most dominating operations for a group of operations. Generally, it is the count of this operation which determines the complexity of the algorithm in case of compounding operations. We have instead used the weight factor to determine the complexity of an algorithm with many operating functions working simultaneously and have taken time of the operation as a measure of the weight factor. We statistically analyze the two most used operations in RSA, namely "power" and "mod" through a method of revised difference to compare if these are statistically similar or dissimilar. We have also calculated the empirical computational complexity of these two operations through the fundamental theorem of finite differences to verify whether these operations are statistically dissimilar and if so then which of the two is dominant. We have also analyzed empirically the complexity of each of the four sub-steps involved in the encryption and decryption of AES-128, to determine which operation dominates the most and consumes most of the time in an overall run time of AES-128.

PARALLEL AND RUNTIME RECONFIGURABLE IMPLEMENTATION OF THE IDEA ALGORITHM

2009 ◽  
Vol 18 (01) ◽  
pp. 133-150 ◽  
Author(s):  
JOSÉ MARÍA GRANADO-CRIADO ◽  
MIGUEL ÁNGEL VEGA-RODRÍGUEZ ◽  
JUAN MANUEL SÁNCHEZ-PÉREZ ◽  
JUAN ANTONIO GÓMEZ-PULIDO
Keyword(s):  
Parallel Implementation ◽  
Dynamic Reconfiguration ◽  
Good Choice ◽  
Information Networks ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Hardware Performance ◽  
A Performance

Cryptographic algorithms are a fundamental tool nowadays, and information networks continue to grow exponentially every year. Moreover, these algorithms need to be very fast due to the new standards. In order to achieve this characteristic, a good choice is to use FPGAs, which mix the advantages of software flexibility and hardware performance. In this work, we present a super-pipelined and parallel implementation of the IDEA cryptographic algorithm by using partial and dynamic reconfiguration. Our implementation reaches a performance of 26.028 Gb/s, and therefore, it obtains better results than those found in the literature.

A performance schedule for extended space flight with the chimpanzee.

1962 ◽  
Author(s):  
F. H. Rholes ◽  
H. H. Reynolds ◽  
M. E. Grunzke ◽  
D. N. Farrer
Keyword(s):  
Space Flight ◽  
Extended Space ◽  
A Performance
Sign in / Sign up

Export Citation Format

Share Document