CAJ | 학술논문

密码学上强的序列不仅应该具有高的线性复杂度而且线性复杂度应该稳定,该文称此类序列为优秀序列.猫群优化算法是一种智能的全局优化搜索算法,能够根据给定的合理条件,自动生成所希望得到的结果.该文通过设计合理有效的适应度函数和恰当的参数选择,将猫群优化算法用于求解优秀序列,得到了周期 N 为32,64,128,256,512,1024等,错误数 k 小于等于/4N 的二元优秀序列.并且结合大量实验数据,分析推测周期为 N 的二元优秀序列 k-错线性复杂度满足规律 LCk (S)<N-2k+1.
밀마학상강적서렬불부응해구유고적선성복잡도이차선성복잡도응해은정,해문칭차류서렬위우수서렬.묘군우화산법시일충지능적전국우화수색산법,능구근거급정적합리조건,자동생성소희망득도적결과.해문통과설계합리유효적괄응도함수화흡당적삼수선택,장묘군우화산법용우구해우수서렬,득도료주기 N 위32,64,128,256,512,1024등,착오수 k 소우등우/4N 적이원우수서렬.병차결합대량실험수거,분석추측주기위 N 적이원우수서렬 k-착선성복잡도만족규률 LCk (S)<N-2k+1.
Strong sequences in cryptography should not only have a high linear complexity but the linear complexity should also be stable. Such sequences are called excellent sequence in this paper. Cat swarm optimization is an intelligent global optimization search algorithm. Based on given reasonable conditions, it can automatically generate excellent results hoped. By designing rational and effective fitness function, and appropriate parameters, cat swarm optimization is selected to find excellent sequence, and binary excellent sequence is got where the period N is 32, 64, 128, 256, 512, 1024 etc. and the error k is less than or equal to / 4N . After combining a large number of experimental data, the conjecture is given that k-error linear complexity of excellent binary sequence with period N meets the law that LCk (S)<N-2k+1.