论文部分内容阅读
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.