Boolean-network-based approach for construction of filter generators  

作　　者：Bowen LI Jianquan LU 

机构地区：[1]School of Information Science and Engineering,Southeast University,Nanjing 210096,China [2]School of Mathematics,Southeast University,Nanjing 210096,China

出　　处：《Science China(Information Sciences)》2020年第11期220-232,共13页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant No.61973078);Natural Science Foundation of Jiangsu Province(Grant No.BK20170019);Jiangsu Provincial Key Laboratory of Networked Collective Intelligence(Grant No.BM2017002);Jiangsu Province Six Talent Peaks Project(Grant No.2015-ZNDW-002);Fundamental Research Funds for the Central Universities(Grant No.2242019k1G013);Postgraduate Research&Practice Innovation Program of Jiangsu Province(Grant No.KYCX190111)。

摘　　要：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.

关 键 词：filter generator Boolean network semi-tensor product 

分 类 号：TN713[电子电信—电路与系统]