Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application

2012 ◽  
Author(s):  
Chia-Long Wu ◽  
Chen-Hao Hu
Keyword(s):  
Computational Complexity ◽  
Computer Security ◽  
Cryptographic Algorithms ◽  
Theoretical Analyses ◽  
Security Application

scholarly journals SECURITY ANALYSIS BETWEEN STATIC AND DYNAMIC S-BOXES IN BLOCK CIPHERS

2021 ◽  
Vol 6 (20) ◽  
pp. 10-16
Author(s):  
Nur Hafiza Zakaria ◽  
Azuan Ahmad ◽  
Azni Haslizan Ab Halim ◽  
Farida Hazwani Mohd Ridzuan
Keyword(s):  
Computer Security ◽  
Block Cipher ◽  
Security Analysis ◽  
Block Ciphers ◽  
Statistical Test ◽  
Evaluation Tool ◽  
Work Related ◽  
Security Research ◽  
Cryptographic Algorithms ◽  
Tool Set

The development of block ciphers has resulted in a number of cryptographic algorithms such as AES, aria, blowfish256, desl, and 3d-aes. AES is one of the best cryptographic algorithms that can be used to protect electronic data. However, the principal weakness in AES is the linearity in the s-box. The objective of this research is to investigate and evaluate the existing work related to the dynamic s-box. Other than that, the aim of this research is to design a dynamic s-box using affine transformation in order to increase the security of the encryption. The method to design is using java with the NetBeans software. The proposed block cipher will be tested using NIST statistical test suite to test the randomness of the algorithm. Besides, the strength of the s-box will be analyzed using the s-box evaluation tool (set). The cryptographic strength depends strongly on the choice of s-box. Therefore, this new proposed block cipher can be used by countries, organizations, stakeholders, or interested parties as one of the secure algorithms to increase the protection of the information and also will contribute as an alternative to other cryptographic algorithms in computer security research.

scholarly journals Development of the Advanced Encryption Standard

2021 ◽  
Vol 126 ◽  
Author(s):  
Miles E. Smid
Keyword(s):  
Information Processing ◽  
Computer Security ◽  
Academic Community ◽  
Advanced Encryption Standard ◽  
Security Technology ◽  
Cryptographic Algorithm ◽  
The World ◽  
Cryptographic Algorithms ◽  
Technology Group ◽  
The U.S

Strong cryptographic algorithms are essential for the protection of stored and transmitted data throughout the world. This publication discusses the development of Federal Information Processing Standards Publication (FIPS) 197, which specifies a cryptographic algorithm known as the Advanced Encryption Standard (AES). The AES was the result of a cooperative multiyear effort involving the U.S. government, industry, and the academic community. Several difficult problems that had to be resolved during the standard’s development are discussed, and the eventual solutions are presented. The author writes from his viewpoint as former leader of the Security Technology Group and later as acting director of the Computer Security Division at the National Institute of Standards and Technology, where he was responsible for the AES development.

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.

Resolution in the scanning tunneling microscope

1991 ◽  
Vol 49 ◽  
pp. 488-489
Author(s):  
R. J. Wilson ◽  
D. D. Chambliss ◽  
S. Chiang ◽  
V. M. Hallmark
Keyword(s):  
Scanning Tunneling Microscope ◽  
Fundamental Principle ◽  
Atomic Scale ◽  
Lateral Resolution ◽  
Scanning Tunneling ◽  
Electronic Noise ◽  
Vertical Resolution ◽  
Tunneling Microscopy ◽  
Spatial Profile ◽  
Theoretical Analyses

Scanning tunneling microscopy (STM) has been used for many atomic scale observations of metal and semiconductor surfaces. The fundamental principle of the microscope involves the tunneling of evanescent electrons through a 10Å gap between a sharp tip and a reasonably conductive sample at energies in the eV range. Lateral and vertical resolution are used to define the minimum detectable width and height of observed features. Theoretical analyses first discussed lateral resolution in idealized cases, and recent work includes more general considerations. In all cases it is concluded that lateral resolution in STM depends upon the spatial profile of electronic states of both the sample and tip at energies near the Fermi level. Vertical resolution is typically limited by mechanical and electronic noise.

Red team performance for improved computer security

2004 ◽  
Author(s):  
Sara Kraemer ◽  
Pascale Carayon ◽  
Ruth Duggan
Keyword(s):  
Computer Security ◽  
Team Performance
Sign in / Sign up

Export Citation Format

Share Document