Add to ORKGIn this paper, the method of constructing algorithm for the implementation of large-scale S-box is proposed. Method is based on the composition primitive polynoms under GF(2) allowing to maximize the performance of S-box of a given implementation on different platforms, or to minimize the complexity of a given speed. © 2013 Pleiades Publishing, Ltd
This work proposes a compact implementation of the AES S-box using composite field arithmetic in GF(...
* Work supported by the Lithuanian State Science and Studies Foundation.Construction of symmetric ci...
The new symmetric cipher S-box construction based on matrix power function is presented. The matrix ...
In this paper, the method of constructing algorithm for the implementation of large-scale S-box is p...
Power mapping based S-boxes, especially those with finite field inversion, have received significant...
Substitution boxes (S-boxes) play a crucial role in modern cryptographic algorithms, providingnon-li...
2nd International Workshop on Arithmetic of Finite Fields -- JUL 06-09, 2008 -- Siena, ITALYS-boxes ...
We describe a new technique for evaluating polynomials over binary finite fields. This is useful in ...
Masking is a widespread countermeasure to protect implementations of block-ciphers against side-chan...
We investigate whether it is possible to evolve cryptographically strong S-boxes that have additiona...
Abstract. We describe a new technique for evaluating polynomials over binary finite fields. This is ...
New era ciphers employ substitution boxes (S-boxes) which assist in the provision of security for th...
In this paper is proposed a new algorithm to construct S-Boxes over GF(28) with Branch Number value ...
In cryptography, S-box is a basic component of symmetric key algorithms which performs nonlinear sub...
Bit permutations are efficient linear functions often used for lightweight cipher designs. However, ...
This work proposes a compact implementation of the AES S-box using composite field arithmetic in GF(...
* Work supported by the Lithuanian State Science and Studies Foundation.Construction of symmetric ci...
The new symmetric cipher S-box construction based on matrix power function is presented. The matrix ...
In this paper, the method of constructing algorithm for the implementation of large-scale S-box is p...
Power mapping based S-boxes, especially those with finite field inversion, have received significant...
Substitution boxes (S-boxes) play a crucial role in modern cryptographic algorithms, providingnon-li...
2nd International Workshop on Arithmetic of Finite Fields -- JUL 06-09, 2008 -- Siena, ITALYS-boxes ...
We describe a new technique for evaluating polynomials over binary finite fields. This is useful in ...
Masking is a widespread countermeasure to protect implementations of block-ciphers against side-chan...
We investigate whether it is possible to evolve cryptographically strong S-boxes that have additiona...
Abstract. We describe a new technique for evaluating polynomials over binary finite fields. This is ...
New era ciphers employ substitution boxes (S-boxes) which assist in the provision of security for th...
In this paper is proposed a new algorithm to construct S-Boxes over GF(28) with Branch Number value ...
In cryptography, S-box is a basic component of symmetric key algorithms which performs nonlinear sub...
Bit permutations are efficient linear functions often used for lightweight cipher designs. However, ...
This work proposes a compact implementation of the AES S-box using composite field arithmetic in GF(...
* Work supported by the Lithuanian State Science and Studies Foundation.Construction of symmetric ci...
The new symmetric cipher S-box construction based on matrix power function is presented. The matrix ...