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.

Kombinasi Mode Cipher Block Chaining Dengan Algoritma Triangle Chain Cipher Pada Penyandian Login Website

2018 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
Dafirius Lombu ◽  
Siska Dame Tarihoran ◽  
Irwan Gulo
Keyword(s):  
Operation Mode ◽  
Feedback Mechanism ◽  
Database Access ◽  
Original Meaning ◽  
Mode Of Operation ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Block Chaining

Generally, the database access of a website lies in the user login. When the login data is not accompanied by security techniques, it is very easily accessible by other parties. One effort that can be done to solve the problem is to encode the login data of website users based on cryptographic technique algorithm. Triangle Chain Cipher (TCC) is one of the classic cryptographic algorithms that encode data doubly and generate keys randomly along the plain. The process of encryption and decryption are interdependent to be one of the advantages of this algorithm. This algorithm will be more effective when combined with the Cipher Block Chaining (CBC) operation mode that is widely used in modern cryptographic algorithms today. The feedback mechanism between the blocks in this mode of operation is the operating advantage. This study describes how to combine the mode of operation of block chaining cipher with triangle chain cipher algorithm so that cipher data login website generated more random and difficult to find its original meaning.

Empirical and statistical comparison of intermediate steps of AES-128 and RSA in terms of time consumption

2021 ◽  
Vol 25 (21) ◽  
pp. 13127-13145
Author(s):  
Prashant Pranav ◽  
Sandip Dutta ◽  
Soubhik Chakraborty
Keyword(s):  
Time Consumption ◽  
Statistical Comparison

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

EXPLICIT FUNCTIONS OF FUZZY CONTROL SYSTEMS

1996 ◽  
Vol 04 (06) ◽  
pp. 515-535 ◽  
Author(s):  
LÁSZLÓ T. KÓCZY ◽  
MICHIO SUGENO
Keyword(s):  
Computational Complexity ◽  
Fuzzy Control ◽  
Control Systems ◽  
Mathematical Description ◽  
Membership Functions ◽  
Mathematical Functions ◽  
Low Computational Complexity ◽  
Special Cases ◽  
Single Input ◽  
Explicit Formulae

Fuzzy control systems have proved their applicability in many areas. Their user-friend-liness and transparency certainly belong to their main advantages, and these two enable developing and tuning such controllers easily, without knowing their exact mathematical description. Nevertheless, it is of interest to know, what mathematical functions hide behind a set of fuzzy rules and an inference machine. For practical purposes it is necessary to consider real, implementable fuzzy control systems with reasonably low computational complexity. This paper discusses the problem of what types of functions are generated by realistic fuzzy control systems. In the paper the explicit formulae of the transference functions for practically important special cases are determined, controllers having rules with triangular and trapezoidal membership functions, and crisp consequents. Here we restrict our investigations to rules with a single input.

Parallel Optimization the AES Algorithm Based on MapReduce

2014 ◽  
Vol 644-650 ◽  
pp. 1911-1914
Author(s):  
Shao Min Zhang ◽  
Yu Fang Gan ◽  
Bao Yi Wang
Keyword(s):  
Big Data ◽  
Traditional Method ◽  
Cloud Storage ◽  
Parallel Optimization ◽  
Mapreduce Framework ◽  
Data Decomposition ◽  
Time Consumption ◽  
Aes Algorithm ◽  
Encryption And Decryption ◽  
Modern Cryptography

Considering the confidentiality and integrity of big data in cloud storage, a MapReduce-based AES parallelization scheme is designed by using MapReduce framework of the open source Hadoop in this paper. The scheme takes full advantage of MapReduce and modern cryptography technologies to parallelize AES encryption and decryption process, in the way of data decomposition, which speeds up the efficiency in the implementation of encryption and decryption. Meanwhile, mix plaintext, separate storage and other technical means are taken into account in this scheme to ensure the confidentiality and security of the key and the ciphertext. By analyzing the performance, it is proved that the time consumption of new scheme is significantly reduced comparing with the traditional method.

scholarly journals Elliptic Curve Cryptosystem for Email Encryption

2010 ◽  
pp. 230-235
Author(s):  
Abhijit Mitra ◽  
Saikat Chakrabarty ◽  
Poojarini Mitra
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Galois Field ◽  
Elliptic Curve Cryptosystem ◽  
Public Network ◽  
Plain Text ◽  
The Core ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Secure Transmission

The idea of information security lead to the evolution of cryptography. In other words, cryptography is the science of keeping information secure. It involves encryption and decryption of messages. The core of cryptography lies in the keys involved in encryption and decryption and maintaining the secrecy of the keys. Another important factor is the key strength, i.e. the difficulty in breaking the key and retrieving the plain text. There are various cryptographic algorithms. In this project we use Elliptic Curve Cryptography (ECC) over Galois field. This system has been proven to be stronger than known algorithms like RSA, DSA, etc. Our aim is to build an efficient elliptic curve cryptosystem for secure transmission or exchange of confidential emails over a public network.

scholarly journals A Public Key Cryptosystem Using Cyclotomic Matrices

2021 ◽  
Author(s):  
Md. Helal Ahmed ◽  
Jagmohan Tanti ◽  
Sumant Pushp
Keyword(s):  
Computational Complexity ◽  
Communication Technology ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Privileged Information ◽  
Diophantine System ◽  
Encryption And Decryption ◽  
Information And Communication ◽  
Asymptotic Complexity ◽  
One Way Function

Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this chapter, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the formulation of cyclotomic matrices correspond to a diophantine system. The strategy uses in cyclotomic matrices to design a one-way function. The result of a one-way function that is efficient to compute, however, is hard to process its inverse except if privileged information about the hidden entry is known. Also, we demonstrate that encryption and decryption can be efficiently performed with the asymptotic complexity of Oe2.373. Finally, we study the computational complexity of the cryptosystem.

Sign in / Sign up

Export Citation Format

Share Document