Boolean-network-based approach for construction of filter generators

Abstract

In this paper, we view filter generators as Boolean networks (BNs), and discuss their poweranalysis-based side-channel analysis. An incompletely specified binary sequence always contains some bits called unnecessary bits comprising 1 or 0. Our motivation for considering this type of sequence is to reduce direct dependencies between side-channel information and key sequences. An algorithm is proposed to determine the unnecessary bits to increase the key search time required for adversaries rather than simply turning all unnecessary bits to 0 (or 1). Then, to reduce area dissipation, under the framework of semi-tensor product (STP) of matrices, the problem of constructing filter generators with minimum number of stages is converted into the one of determining the corresponding transition matrices. Compared with the existing results, the lower bound of the minimum number of stages is provided, which can reduce the exhaustive search time required to find it. Finally, one example is used to illustrate the efficacy of the proposed algorithm.

Finite-Time Controllability and Set Controllability of Impulsive Probabilistic Boolean Control Networks

“…Q τ = 1 4×4 . Hence, the finite-time controllability of system (19) is affected by impulsive effects, which shows that impulsive effects play an important role in the finite-time controllability analysis of PBCNs.…”

“…As a natural generalization of controllability, Cheng and Hu [6] developed the concept of set controllability for switched linear systems. Set controllability has many applications, such as set stabilization, synchronization, output tracking and so on [4], [19], [23], [29], [34], [51], [55].…”

Complex systems with impulsive effects and logical dynamics: A brief overview

“…For example, when consider the transformation between Fibonacci FSRs and Galois FSRs by ANF, the uniform conditions need to be guaranteed [17]. Recently, BNs were proposed to model FSRs, and some interesting results were obtained [114,170,115]. Zhong et al utilized the method of STP obtaining characters of transition matrices for Fibonacci FSRs [169].…”