Improved Algoritms in Parallel Evaluation of Large Cryptographic S-Box

by   Behrooz Khadem, et al.

Nowadays computational complexity of fast walsh hadamard transform and nonlinearity for Boolean functions and large substitution boxes is a major challenge of modern cryptography research on strengthening encryption schemes against linear and differential attacks. Time and memory complexities of the best existing algorithm for computing fast walsh hadamard transform and non linearity for n x m substitution boxes (n >= 16;m >= 16) is O(2^(n+m)). This paper proposes three new acceleration methods that improve the computation time for parallelized walsh matrix up to 39 folds and the computation time for non linearity degree up to 563 folds, defining and accessing walsh matrix transpose, and incorporating an important part of computation process of non linearity in the computation algorithm of walsh matrix. The validity of the proposed algorithms is verified by means of simulation and experimentation and the overall analysis of resource consumption of proposed algorithms was compared with previous ones.



There are no comments yet.


page 1

page 2

page 3

page 4


Efficient Construction of S-boxes Based on a Mordell Elliptic Curve Over a Finite Field

Elliptic curve cryptography (ECC) is used in many security systems due t...

Algorithms for the Computing Determinants in Commutative Rings

Two known computation methods and one new computation method for matrix ...

A Tutorial and Open Source Software for the Efficient Evaluation of Gravity and Magnetic Kernels

Fast computation of three-dimensional gravity and magnetic forward model...

Exploitation of Stragglers in Coded Computation

In cloud computing systems slow processing nodes, often referred to as "...

A novel encryption algorithm using multiple semifield S-boxes based on permutation of symmetric group

With the tremendous benefits of internet and advanced communications, th...

Non-uniform quantization with linear average-case computation time

A new method for binning a set of n data values into a set of m bins for...

Optimal Checkpointing for Adjoint Multistage Time-Stepping Schemes

We consider checkpointing strategies that minimize the number of recompu...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.