China
Africa
Explore chapters and articles related to this topic
Applicability of Lightweight Stream Cipher in Crowd Computing: A Detailed Survey and Analysis
Published in Khan Pathan Al-Sakib, Crowd-Assisted Networking and Computing, 2018
Subhrajyoti Deb, Rohit Upadhya, Bubu Bhuyan
Correlation immunity: A Boolean function f on F2n is said to be a correlation of order m, where (1 ≤ m ≤ n) if the output of f and any m input variables are statistically independent [11,12]. A Boolean function f on F2n is correlation immune of order m if and only if Wf(c) = 0 for all vectors such that c∈F2n such that 0≤|false(cfalse)|≤m.
Improved algorithms in parallel evaluation of large cryptographic S-boxes
Published in International Journal of Parallel, Emergent and Distributed Systems, 2020
The main purpose of this paper is to reduce the time and memory complexity of FWHT algorithm and non-linearity evaluation for large s-boxes. To meet this goal, three solutions are proposed. Based on our results which are shown in Figure 2(b) and Table 4, our best choice for FWHT computation results a run-time improvement of 68.59-fold and for non-linearity evaluation using Walsh matrix transpose results a run-time improvement of 1021.74-fold. We suggest two ideas for future research. First, one can implement similar methods for computing other properties of s-boxes such as balancedness, propagation criterion, bit independence, and correlation immunity criterion using FWHT. Second, given the immense possibilities for parallelisation on GPUs, one can implement proposed solutions of this paper on GPU.
Design of substitution nodes (S-Boxes) of a block cipher intended for preliminary encryption of confidential information
Published in Cogent Engineering, 2022
Ardabek Khompysh, Nursulu Kapalova, Kunbolat Algazy, Dilmukhanbet Dyusenbayev, Kairat Sakan
A Boolean function has correlation immunity of order if the system of equations is valid for all :