Hardware Rules and Improved S-Box on AES

2013 ◽  
Vol 717 ◽  
pp. 849-853
Author(s):  
Shi Yong Zhang ◽  
Gong Liang Chen ◽  
Lei Fan ◽  
Jian Hua Li
Keyword(s):  
Hardware Implementation ◽  
Advanced Encryption Standard ◽  
Better Than

The Advanced Encryption Standard (AES) was specified in 2001 by the National Institute of Standards and Technology. Our attempt is to define the hardware rule about hardware calculation and to find further reduce for the size of AES, by seeking to other normal bases.Finally, we give the result that our hardware implementation is better than the previous results.

Auto White Balance Algorithm in Digital Camera

2012 ◽  
Vol 182-183 ◽  
pp. 2080-2084
Author(s):  
Jie Li ◽  
Xue Xiang Wang ◽  
Hao Liu
Keyword(s):  
Hardware Implementation ◽  
Digital Camera ◽  
Low Complexity ◽  
Light Sources ◽  
Light Conditions ◽  
Threshold Method ◽  
White Balance ◽  
White Point ◽  
A New Technique ◽  
Better Than

Auto white balance (AWB) is an important function of digital camera. The purpose of white balance is to adjust the image to make it look like taken under standard light conditions. We present a new technique to detect the reference white point of image in this paper. This technique detects the white point of image by using dynamic threshold method, thus making it more flexible and more applicable compared to other algorithms. We test 50 images which were taken under different light sources, and find that this algorithm is better than or comparable to other algorithms both in subjective and objective aspects. At the same time, this algorithm has low complexity, and it can be easily applied to hardware implementation.

scholarly journals A Spatiotemporal-Chaos-Based Encryption Having Overall Properties Considerably Better than Advanced Encryption Standard

2003 ◽  
Vol 40 (1) ◽  
pp. 57-62 ◽  
Author(s):  
Wang Shi-Hong ◽  
Ye Wei-Ping ◽  
Lü Hua-Ping ◽  
Kuang Jin-Yu ◽  
Li Jing-Hua ◽  
...  
Keyword(s):  
Spatiotemporal Chaos ◽  
Advanced Encryption Standard ◽  
Better Than

scholarly journals Symmetric Random Biometric Key (SRBK) Based Cryptography

2019 ◽  
Vol 8 (3) ◽  
pp. 940-945
Keyword(s):  
Advanced Encryption Standard ◽  
Aes Algorithm ◽  
Cryptographic Algorithm ◽  
Biometric Features ◽  
Better Than

In this paper, we propose a novel cryptographic algorithm namely Symmetric Random Biometric key (SRBK) algorithm. The key for this SRBK algorithm is obtained from two biometric features namely ear and lip. The key generated are flexible and can be altered based on the type of algorithm used. We also consider Advanced encryption standard (AES) algorithm for comparison with SRBK algorithm and finally it was proved that SRBK algorithm is better than AES algorithm on selected parameters.

HUMAN-LIKE DYNAMIC PROGRAMMING NEURAL NETWORKS FOR DYNAMIC TIME WARPING SPEECH RECOGNITION

1995 ◽  
Vol 06 (01) ◽  
pp. 79-89 ◽  
Author(s):  
CHINCHUAN CHIU ◽  
MICHAEL A. SHANBLATT
Keyword(s):  
Neural Networks ◽  
Dynamic Programming ◽  
Speech Recognition ◽  
Dynamic Time Warping ◽  
Hardware Implementation ◽  
Time Warping ◽  
Network Method ◽  
The Neural Networks ◽  
Dynamic Time ◽  
Better Than

This paper presents a human-like dynamic programming neural network method for speech recognition using dynamic time warping. The networks are configured, much like human’s, such that the minimum states of the network’s energy function represent the near-best correlation between test and reference patterns. The dynamics and properties of the neural networks are analytically explained. Simulations for classifying speaker-dependent isolated words, consisting of 0 to 9 and A to Z, show that the method is better than conventional methods. The hardware implementation of this method is also presented.

scholarly journals Approximate calculation of 8-point DCT for various scenarios of practical applications

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Dariusz Puchala
Keyword(s):  
Hardware Implementation ◽  
Natural Images ◽  
Best Approximations ◽  
Practical Applications ◽  
The Matrix ◽  
Field Programmable ◽  
Series Of Experiments ◽  
Parameter Values ◽  
The Given ◽  
Better Than

AbstractIn this paper, based on the parametric model of the matrix of discrete cosine transform (DCT), and using an exhaustive search of the parameters’ space, we seek for the best approximations of 8-point DCT at the given computational complexities by taking into account three different scenarios of practical usage. The possible parameter values are selected in such a way that the resulting transforms are only multiplierless approximations, i.e., only additions and bit-shift operations are required. The considered usage scenarios include such cases where approximation of DCT is used: (i) at the data compression stage, (ii) at the decompression stage, and (iii) both at the compression and decompression stages. The obtained results in effectiveness of generated approximations are compared with results of popular known approximations of 8-point DCT of the same class (i.e., multiplierless approximations). In addition, we perform a series of experiments in lossy compression of natural images using popular JPEG standard. The obtained results are presented and discussed. It should be noted, that in the overwhelming number of cases the generated approximations are better than the known ones, e.g., in asymmetric scenarios even by more than 3 dB starting from entropy of 2 bits per pixel. In the last part of the paper, we investigate the possibility of hardware implementation of generated approximations in Field-Programmable Gate Array (FPGA) circuits. The results in the form of resource and energy consumption are presented and commented. The experiment outcomes confirm the assumption that the considered class of transformations is characterized by low resource utilization.

scholarly journals Improved RC6 Algorithm using Two Types of Chaos Maps

2019 ◽  
Vol 9 (1) ◽  
pp. 2856-2860
Keyword(s):  
Chaotic Maps ◽  
Scheduling Algorithm ◽  
Advanced Encryption Standard ◽  
Key Generation ◽  
Key Length ◽  
Key Scheduling ◽  
Better Than

RC6 (Rivest cipher 6) is keyblock chipher which consider symmetric imitative from RC5. It was intended to encounter the needs competition of the Advanced Encryption Standard (AES) . The aim of this work is to add new security layer to RC6 (Rivest Cipher 6) algorithm, because there is some insufficiency in the Key Scheduling Algorithm (KSA) of RC6. This paper presents improved RC6 (IRC6) key generation based on two types of chaotic maps (Chebyshev,2d logistic) to generate N key to N users. The results prove that the average secrecy of IRC6 is better than of traditional RC6, in which: for 32 bits’ key length, and 256 bits’ plaintext size, the average secrecy of IRC6 is (0.536 - 3.907) while for RC6 is (0.254 constant).

Sign in / Sign up

Export Citation Format

Share Document