scholarly journals Time Complexity Reduction for the Application of Stream Cipher System Based XOR Free Operation

2019 ◽  
Vol 8 (3) ◽  
pp. 5402-5408
Keyword(s):  
Vector Space ◽  
Time Complexity ◽  
Data Exchange ◽  
Internet Applications ◽  
Cryptographic Algorithm ◽  
Fast Processing ◽  
Cryptographic System ◽  
Symmetric Key ◽  
Time Required ◽  
Fast Increase

Providing security to user information are the most important aspects of today’s internet applications. Due to the very fast increase in the internet applications, the value of data exchange also became important. Hence, the better security and fast processing of the system is at high demand in the communication-related communities. Cryptography is one such area of providing data security. The two major criteria that specify the significance of a cryptographic algorithm are the security provided against the various attacks and the time to perform the operations. The proposed system is a solution to the cryptographic system to reduce the time complexity by retaining the security of the algorithm as it is. The solution proposed is to reduce the processing time required for the XOR function. This solution is by generating; XOR values for the vector space mentioned by the tuple, later replace the same wherever required. These values of XOR depend on the tuple, which represents the vector. Algorithm and time complexity for the generation of the vector space of XOR values for the proposed space evaluated. The result of the work compared based on two Standard symmetric-key cipher systems, Advanced Encryption Standard (AES) and Blowfish. The results are also tested and analyzed for different data size for the time complexity.

scholarly journals A New Symmetric Key Cryptographic Algorithm using Paley Graphs and ASCII Values

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim
Keyword(s):  
Brute Force ◽  
Strong Regularity ◽  
Quadratic Residues ◽  
Cryptographic Algorithm ◽  
Paley Graph ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Brute Force Attack ◽  
The Moment ◽  
Paley Graphs

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.

Cryptanalysis of a Chaotic Block Cryptographic System Against Template Attacks

2020 ◽  
Vol 30 (15) ◽  
pp. 2050223
Author(s):  
Yuling Luo ◽  
Shunsheng Zhang ◽  
Junxiu Liu ◽  
Lvchen Cao
Keyword(s):  
Statistical Tests ◽  
Gaussian Model ◽  
Electromagnetic Emission ◽  
Information Modeling ◽  
Cryptographic Algorithm ◽  
Data Processing Method ◽  
Secret Keys ◽  
Cryptographic System ◽  
Multivariate Gaussian Model ◽  
Template Attacks

The security of chaotic cryptographic system can be theoretically evaluated by using conventional statistical tests and numerical simulations, such as the character frequency test, entropy test, avalanche test and SP 800-22 tests. However, when the cryptographic algorithm operates on a cryptosystem, the leakage information such as power dissipation, electromagnetic emission and time-consuming can be used by attackers to analyze the secret keys, namely the Side Channel Analysis (SCA) attack. In this paper, a cryptanalysis method is proposed for evaluating the security of a chaotic block cryptographic system from a hardware perspective by utilizing the Template Attacks (TAs). Firstly, a chaotic block cryptographic system is described briefly and implemented based on an Atmel XMEGA microcontroller. Then the TA using a multivariate Gaussian model is introduced. In order to reduce computational complexity and improve the efficiency of TA, the Hamming weight is used in this work to model power consumption traces. The proposed TA method has the following advantages including (a) using the sum of difference to select points of interest of traces, (b) using a data processing method to minimize the influences on power information modeling from the redundant sampling points, and (c) all the traces are aligned precisely before establishing the templates. Experimental results show that the TA can be used to attack the chaotic cryptographic systems and is more efficient, i.e. [Formula: see text]32% less attack traces than correlation power analysis, when the templates are properly built.

scholarly journals Analysis and use of Cryptography techniques in programming language C#: Coding and Decoding

2020 ◽  
Vol 4 (3) ◽  
pp. 1-10
Author(s):  
Naim BAFTIU
Keyword(s):  
Programming Language ◽  
Data Security ◽  
State Institutions ◽  
C Programming Language ◽  
New Methods ◽  
Cryptographic Algorithm ◽  
C Programming ◽  
Cryptographic System ◽  
Use Of The Internet ◽  
Cryptographic Techniques

Cryptography is an old idea and science, but its approach exists and plays a large role in modernization today. Conventional cryptographic techniques form the basis of today's cryptographic algorithm. The different categories of algorithms have their respective features; internally, in performance and implementation. Cryptographic schemes and mechanisms have undergone continuous improvement. The application of cryptography has grown increasingly, ranging from limited use in state institutions to widespread use by private individuals and companies. The increased use of the Internet has significantly influenced the nature of applications and the way we communicate. Data security dictates the use of different cryptographic techniques. For this reason, we analyze in detail the various coding techniques by evaluating their performance and efficiency. Regarding the new paradigms in cryptography there are also new cryptographic schemes whose application requires detailed study and analysis. The classical cryptography algorithm is the oldest algorithm that was used long before the cryptographic system was discovered. Currently, the system has been widely applied to secure data, and using new methods in a way to improve existing methods. In this thesis the use of cryptographic methods using the C # programming language will be discussed.

scholarly journals A New Hybrid Cryptography Technique in Wireless Sensor Network

2019 ◽  
Vol 8 (10) ◽  
pp. 121-131
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Traditional Approach ◽  
Computation Time ◽  
Data Encryption ◽  
Wireless Sensor ◽  
Secret Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Symmetric Key

The wireless sensor network is a large number of tiny nodes installed in insecure environment for monitoring, gathering and transferring data and are prone to security threats for its limited resources. In order to transmit the data and to protect from different attacks in the network, security is maintained. To achieve confidentiality, authenticity and authorization of data which secure the data from different attacks cryptographic algorithm were used. The number of keys used in the cryptographic algorithm determines the security of the data. Cryptographic algorithms are broadly classified into two types symmetric cryptography and asymmetric cryptography. In the symmetric key cryptographic algorithm, a secret key is shared in the network and in asymmetric key cryptographic algorithm two keys are used for data security. In wireless sensor network, symmetric key cryptography required more storage to store the key among all the nodes of the network and in asymmetric key cryptography more computation time is require for the data encryption and decryption. To avoid memory and computation overhead we proposed a hybrid cryptosystem to handle the security in the wireless sensor network. Initially shared key is exchanged among nodes using ECC which is a public key algorithm. Data is encrypted and decrypted using RC4 symmetric key algorithm. Various performance measures such as time taken for encryption and decryption process and memory needed for storing cipher text data. The proposed model shows faster encryption of data and takes less memory for key storage as compared to the traditional approach.

scholarly journals Hybrid Approach of Modified AES

Cryptography ◽  
2020 ◽  
pp. 129-141
Author(s):  
Filali Mohamed Amine ◽  
Gafour Abdelkader
Keyword(s):  
Time Complexity ◽  
Input Data ◽  
Hybrid Approach ◽  
Encryption Algorithm ◽  
Advanced Encryption Standard ◽  
Aes Algorithm ◽  
Symmetric Key ◽  
Encryption Algorithms ◽  
Aes Encryption Algorithm ◽  
Modified Aes

Advanced Encryption Standard is one of the most popular symmetric key encryption algorithms to many works, which have employed to implement modified AES. In this paper, the modification that has been proposed on AES algorithm that has been developed to decrease its time complexity on bulky data and increased security will be included using the image as input data. The modification proposed itself including alteration in the mix column and shift rows transformation of AES encryption algorithm, embedding confusion-diffusion. This work has been implemented on the most recent Xilinx Spartan FPGA.

Hybrid Approach of Modified AES

2017 ◽  
Vol 7 (4) ◽  
pp. 83-93
Author(s):  
Filali Mohamed Amine ◽  
Gafour Abdelkader
Keyword(s):  
Time Complexity ◽  
Input Data ◽  
Hybrid Approach ◽  
Encryption Algorithm ◽  
Advanced Encryption Standard ◽  
Aes Algorithm ◽  
Symmetric Key ◽  
Encryption Algorithms ◽  
Aes Encryption Algorithm ◽  
Modified Aes

Advanced Encryption Standard is one of the most popular symmetric key encryption algorithms to many works, which have employed to implement modified AES. In this paper, the modification that has been proposed on AES algorithm that has been developed to decrease its time complexity on bulky data and increased security will be included using the image as input data. The modification proposed itself including alteration in the mix column and shift rows transformation of AES encryption algorithm, embedding confusion-diffusion. This work has been implemented on the most recent Xilinx Spartan FPGA.

A CEREBELLAR MODEL CLASSIFIER FOR DATA MINING WITH LINEAR TIME COMPLEXITY

2006 ◽  
Vol 06 (03) ◽  
pp. 299-313
Author(s):  
DAVID CORNFORTH
Keyword(s):  
Time Complexity ◽  
Linear Time ◽  
Machine Learning Techniques ◽  
Automated Classification ◽  
Cerebellar Model Articulation Controller ◽  
Training Algorithm ◽  
Learning Techniques ◽  
Large Databases ◽  
Class Labels ◽  
Time Required

Techniques for automated classification need to be efficient when applied to large datasets. Machine learning techniques such as neural networks have been successfully applied to this class of problem, but training times can blow out as the size of the database increases. Some of the desirable features of classification algorithms for large databases are linear time complexity, training with only a single pass of the data, and accountability for class assignment decisions. A new training algorithm for classifiers based on the Cerebellar Model Articulation Controller (CMAC) possesses these features. An empirical investigation of this algorithm has found it to be superior to the traditional CMAC training algorithm, both in accuracy and time required to learn mappings between input vectors and class labels.

Sign in / Sign up

Export Citation Format

Share Document