Various Approximate Multiplicative Inverse Lie $$\star $$-Derivations

2021 ◽  
pp. 119-135
Author(s):  
B. V. Senthil Kumar ◽  
Khalifa Al-Shaqsi ◽  
Hemen Dutta
Keyword(s):  
Multiplicative Inverse

Design of Multiplicative Inverse Value Generator using Logarithm Method for AES Algorithm

2020 ◽  
Author(s):  
Goh Yie Yen ◽  
Siti Zarina Md Naziri ◽  
Rizalafande Che Ismail ◽  
Mohd Nazrin Md Isa ◽  
Razaidi Hussin
Keyword(s):  
Multiplicative Inverse ◽  
Aes Algorithm

GOWERS UNIFORMITY NORM AND PSEUDORANDOM MEASURES OF THE PSEUDORANDOM BINARY SEQUENCES

2011 ◽  
Vol 07 (05) ◽  
pp. 1279-1302 ◽  
Author(s):  
HUANING LIU
Keyword(s):  
Exponential Sums ◽  
Binary Sequences ◽  
Vandermonde Determinant ◽  
Additive Character ◽  
Pseudorandom Sequences ◽  
Multiplicative Inverse ◽  
Large Families ◽  
Points Of View ◽  
Pseudorandom Measures ◽  
Gowers Norm

Recently there has been much progress in the study of arithmetic progressions. An important tool in these developments is the Gowers uniformity norm. In this paper we study the Gowers norm for pseudorandom binary sequences, and establish some connections between these two subjects. Some examples are given to show that the "good" pseudorandom sequences have small Gowers norm. Furthermore, we introduce two large families of pseudorandom binary sequences constructed by the multiplicative inverse and additive character, and study the pseudorandom measures and the Gowers norm of these sequences by using the estimates of exponential sums and properties of the Vandermonde determinant. Our constructions are superior to the previous ones from some points of view.

scholarly journals A way to compute a greatest common divisor in the Galois field (GF (2^n ))

2019 ◽  
Vol 16 ◽  
pp. 8317-8321
Author(s):  
Waleed Eltayeb Ahmed
Keyword(s):  
Galois Field ◽  
Euclidean Algorithm ◽  
Greatest Common Divisor ◽  
Multiplicative Inverse

This paper presents how the steps that used to determine a multiplicative inverse by method based on the Euclidean algorithm, can be used to find a greatest common divisor for polynomials in the Galois field (2^n ).

scholarly journals New S-box calculation approach for Rijndael-AES based on an artificial neural network

2017 ◽  
Vol 6 (2) ◽  
pp. E1-1-E1-21
Author(s):  
Jaime David Rios Arrañaga ◽  
◽  
Janneth Alejandra Salamanca Chavarin ◽  
Juan José Raygoza Panduro ◽  
Edwin Christian Becerra Alvarez ◽  
...  
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Galois Field ◽  
Block Ciphers ◽  
Multiplicative Inverse ◽  
Symmetric Key ◽  
Artificial Neural ◽  
Hidden Layer ◽  
The Relationship

The S-box is a basic important component in symmetric key encryption, used in block ciphers to confuse or hide the relationship between the plaintext and the ciphertext. In this paper a way to develop the transformation of an input of the S-box specified in AES encryption system through an artificial neural network and the multiplicative inverse in Galois Field is presented. With this implementation more security is achieved since the values of the S-box remain hidden and the inverse table serves as a distractor since it would appear to be the complete S-box. This is implemented on MATLAB and HSPICE using a network of perceptron neurons with a hidden layer and null error.

Sign in / Sign up

Export Citation Format

Share Document