智能算法及其在信息安全若干关键问题中的应用与研究
|
摘要
现代密码学理论和密码技术是信息安全领域的重要基础。在信息时代的今天,网络和通信技术的高速发展和广泛应用,越来越多的信息在网络上传输,信息的安全与保护问题显得愈发重要。通常使用传统的数学方法来解决密码学和信息安全中的问题难以获得较好的全局效果,近年来仿生智能优化算法已经在经典的NP-C等问题的求解和实际应用中表现出强大的生命力,并且具有较好的全局性能。本文深入研究了智能优化算法的理论与应用,构造出基于智能算法解决信息安全中的四个关键问题(分组密码、流密码、布尔函数、入侵检测)的模型,同时对这些模型的理论基础、实践应用、收敛性等进行了深入和系统的分析,最后通过仿真实验对这些模型效果和性能进行深入的分析、验证与比较。具体的创新性工作包括如下几个方面:
1、分别研究了基于蚁群算法,遗传算法及蚁群与遗传算法结合设计S盒的算法。基于遗传算法构造S盒,在染色体的编码方式上保证S盒是完全正交的,给出了“雪崩度”的定义以定量描述雪崩效应,可自适应地修正交叉概率与变异概率;基于蚁群算法构造S盒,提出了S盒的城市模型,设计出选路规则和信息素更新策略;提出遗传算法与蚁群算法相结合的设计思想构造S盒,获得的S盒在非线性度、差分均匀度和雪崩效应上都得到了较大的改善,较好的解决了传统的数学方法设计S盒的缺陷。
2、分别研究基于遗传算法和细胞自动机优化设计序列密码的算法。综合应用遗传算法的选择、交叉和变异算子以及移位、异或和非等操作来设计序列密码。将细胞自动机与熵的理论应用与序列密码的设计,可以使得序列密码具有更好的抗攻击能力。
3、通过分析布尔函数的Walsh-Hadamard变换、自相关性和雪崩效应等,提出并证明了布尔函数的两个优化规则,设计出“1+1爬山算法”和“两点爬山算法”可有效提高布尔函数的非线性度,同时降低布尔函数的自相关性。将遗传算法的多点搜索优点有机融入爬山算法,设计出“遗传爬山算法”,可更好的优化布尔函数的非线性度和自相关性。
4、为弥补入侵防御系统不能及时发现未知入侵攻击的缺陷,提出基于遗传模糊连接的聚类算法,将模糊连接度推广到聚类算法中作,为聚类对象间相似性的度量工具,并将遗传算法用于初始聚类数目的确定及聚类后对种子的更新,使种子最具所属聚类的特征、更准确地标识聚类,将该算法应用于入侵防御系统的审计模块,验证、比较和分析该模型和算法的有效性和效率,效果较好。
最后,对全文的研究工作进行了总结与分析,并对智能算法及其在信息安全中的研究进行展望。
Morden Cryptography theory and technology are the important basis of information security. With the rapid development of network and communication, the security and protection of information transmitted in the Internet becomes more important. It is very hard that many problems are resolved by mathmetics methods in cryptography and information security. Recent years, intelligent algorithms are good at the resolement and application of NP-C problems. In this dissertation, the theory and application of intelligent algorithms are researched, and the models of four key problems in information security, which are block cipher, stream cipher, Boolean fuctions and intrusion detection, are constructed. We research and analyze the theory basis, application and astringency deeply. Through the emulation, we analyze, validate and compare the effect and perforement of these models. All innovations in detail as followed:
1. Two algorithms based on intelligent algorithms are proposed to construct S-boxes. Firstly, S-boxes are optimized by genetic algorithm. The guarantee of orthogonality is become effective by coding type. Crossover and mutation probabilities are adaptive in iterative process. Based on this construction method, the flow chart of constructing S-boxes is given and the group of S-boxes with high nonlinearity and low difference uniformity are generated. And then, S-boxes are optimized by, which combines the mechanism of feedback organically with the thinking of evolution, accordingly develops enough advantages of the two algorithms. Based on this construction method, the flow chart of constructing S-boxes is given and the group of S-boxes with high nonlinearity and low difference uniformity are generated. The simulation results show that this kind of construction method is better at reducing a large redundancy calculation and quickening the speed of convergence, compared with the one based on genetic algorithm.
2. It is researched that genetic algorithm and cellular automata design stream cipher. The problem of generation by cellular automata of high quality pseudorandom sequences useful in cryptography is considered in the paper. For this purpose one dimensional nonuniform cellular automata is considered. The quality of pseudorandom sequences generated by cellular automata depends on collective behavior of rules assigned to cellular automata cells. Genetic algorithm is used to find suitable rules from predefined earlier set of rules. It has been shown that genetic algorithm eliminates bad subsets of rules and founds subsets of rules, which provide high quality pseudorandom sequences. These sequences are suitable for symmetric key cryptography and can be used in different cryptographic modules.
3. To analyze Walsh-Hadamard transformation and autocorrelation of Boolean functions, two rules to optimize Boolean functions are deduced. One plus one climbing hill algorithm based on the two rules is able to design Boolean functions with high nonlinearity and low autocorrelation. To combine the above algorithm with genetic, genetic and climbing hill algorithm is proposed. Experiment data show that the latter can further find Boolean function to be good at nonlinearity and autocorrelation.
4. To overcome some shortcomings of previous clustering algorithm to be applied in intrusion prevention system in face of unknown attack type, an algorithm based on genetic algorithms and fuzzy connectedness clustering is presented in order to measure the similarity. The near optimal cluster centers are chosen by genetic algorithm. This algorithm is applied in intrusion prevention and Computer simulations show that this algorithm is effective.
Finally, the work of this dissertation is summarized and the prospective of future research is discussed.
1、分别研究了基于蚁群算法,遗传算法及蚁群与遗传算法结合设计S盒的算法。基于遗传算法构造S盒,在染色体的编码方式上保证S盒是完全正交的,给出了“雪崩度”的定义以定量描述雪崩效应,可自适应地修正交叉概率与变异概率;基于蚁群算法构造S盒,提出了S盒的城市模型,设计出选路规则和信息素更新策略;提出遗传算法与蚁群算法相结合的设计思想构造S盒,获得的S盒在非线性度、差分均匀度和雪崩效应上都得到了较大的改善,较好的解决了传统的数学方法设计S盒的缺陷。
2、分别研究基于遗传算法和细胞自动机优化设计序列密码的算法。综合应用遗传算法的选择、交叉和变异算子以及移位、异或和非等操作来设计序列密码。将细胞自动机与熵的理论应用与序列密码的设计,可以使得序列密码具有更好的抗攻击能力。
3、通过分析布尔函数的Walsh-Hadamard变换、自相关性和雪崩效应等,提出并证明了布尔函数的两个优化规则,设计出“1+1爬山算法”和“两点爬山算法”可有效提高布尔函数的非线性度,同时降低布尔函数的自相关性。将遗传算法的多点搜索优点有机融入爬山算法,设计出“遗传爬山算法”,可更好的优化布尔函数的非线性度和自相关性。
4、为弥补入侵防御系统不能及时发现未知入侵攻击的缺陷,提出基于遗传模糊连接的聚类算法,将模糊连接度推广到聚类算法中作,为聚类对象间相似性的度量工具,并将遗传算法用于初始聚类数目的确定及聚类后对种子的更新,使种子最具所属聚类的特征、更准确地标识聚类,将该算法应用于入侵防御系统的审计模块,验证、比较和分析该模型和算法的有效性和效率,效果较好。
最后,对全文的研究工作进行了总结与分析,并对智能算法及其在信息安全中的研究进行展望。
Morden Cryptography theory and technology are the important basis of information security. With the rapid development of network and communication, the security and protection of information transmitted in the Internet becomes more important. It is very hard that many problems are resolved by mathmetics methods in cryptography and information security. Recent years, intelligent algorithms are good at the resolement and application of NP-C problems. In this dissertation, the theory and application of intelligent algorithms are researched, and the models of four key problems in information security, which are block cipher, stream cipher, Boolean fuctions and intrusion detection, are constructed. We research and analyze the theory basis, application and astringency deeply. Through the emulation, we analyze, validate and compare the effect and perforement of these models. All innovations in detail as followed:
1. Two algorithms based on intelligent algorithms are proposed to construct S-boxes. Firstly, S-boxes are optimized by genetic algorithm. The guarantee of orthogonality is become effective by coding type. Crossover and mutation probabilities are adaptive in iterative process. Based on this construction method, the flow chart of constructing S-boxes is given and the group of S-boxes with high nonlinearity and low difference uniformity are generated. And then, S-boxes are optimized by, which combines the mechanism of feedback organically with the thinking of evolution, accordingly develops enough advantages of the two algorithms. Based on this construction method, the flow chart of constructing S-boxes is given and the group of S-boxes with high nonlinearity and low difference uniformity are generated. The simulation results show that this kind of construction method is better at reducing a large redundancy calculation and quickening the speed of convergence, compared with the one based on genetic algorithm.
2. It is researched that genetic algorithm and cellular automata design stream cipher. The problem of generation by cellular automata of high quality pseudorandom sequences useful in cryptography is considered in the paper. For this purpose one dimensional nonuniform cellular automata is considered. The quality of pseudorandom sequences generated by cellular automata depends on collective behavior of rules assigned to cellular automata cells. Genetic algorithm is used to find suitable rules from predefined earlier set of rules. It has been shown that genetic algorithm eliminates bad subsets of rules and founds subsets of rules, which provide high quality pseudorandom sequences. These sequences are suitable for symmetric key cryptography and can be used in different cryptographic modules.
3. To analyze Walsh-Hadamard transformation and autocorrelation of Boolean functions, two rules to optimize Boolean functions are deduced. One plus one climbing hill algorithm based on the two rules is able to design Boolean functions with high nonlinearity and low autocorrelation. To combine the above algorithm with genetic, genetic and climbing hill algorithm is proposed. Experiment data show that the latter can further find Boolean function to be good at nonlinearity and autocorrelation.
4. To overcome some shortcomings of previous clustering algorithm to be applied in intrusion prevention system in face of unknown attack type, an algorithm based on genetic algorithms and fuzzy connectedness clustering is presented in order to measure the similarity. The near optimal cluster centers are chosen by genetic algorithm. This algorithm is applied in intrusion prevention and Computer simulations show that this algorithm is effective.
Finally, the work of this dissertation is summarized and the prospective of future research is discussed.
引文
[1]冯登国.国内外密码学研究现状及发展趋势[J].通信学报,23(5),2002年5月,18-26.
[2]高尚.蚁群算法理论、应用及其与其它算法的混合[学位论文],南京,南京理工大学,2005年.
[3]王育民,刘建伟.通信网的安全-理论与技术.西安:西安电子科技大学出版社,1999.
[4]彭喜元,彭宇,戴毓丰.群智能理论及应用[J].电子学报,31(12A),2003年12月,1982-1988.
[5]Diffie W,Hellman M E.New directions in cryptography.IEEE Transactions on Information Theory,1976,22(6):644-654.
[6]Dorigo M,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperation agents[J].IEEE Transactions on System,Man and Cybernetics Part B,26(1),1996/1,29-42.
[7]霍有光.中国古代科技史钩沉.西安:陕西科学技术出版社.1998.
[8]冯登国,吴文玲.分组密码的设计与分析.北京:清华大学出版社,2000.
[9]张照止.现代密码学基础.北京:京邮电大学出版社.2004.
[10]多磊,李超.分组密码的设计与分析.国防科学技术大学研究生院理学硕士学位论文,2002.
[11]Caro G Di,Dorigo M.AntNet:Distributed stigergetic control for communications networks[J].Journal of Artificial Intelligence Research(AJIR),9,1998,317-365.
[12]Li Lianyuan,Liu Zemin,Zhou Zheng.A new dynamic distributed routing algoritm on telecommunication networks[A].International Conference on Communication Technology Proceedings[C].Beijing China,2000/1,849-852.
[13]Gunes M,Sorges U,Bouazizi I.ARA the ant colony based routing algorithm for MNETs[A].Proceedings International Conference on Parallel Processing workshops[C].Uuncouver,BC,Canada,2002:79-85.
[14]Caro G Di,Dorigo M.Mobile agents for adaptive routing[A].Proceedings of the Thirty First Hawaii International Conference on System Sciences[C].Kohala Coast,HI USA,6-9 Jan 1998.7:74-83.
[15]马良.来自昆虫世界的寻优策略--蚂蚁算法.自然杂志,1999,21(3):161-163.
[16]Parpinelli R S,Lopes H S,Freitas.Data mining with an ant colony optimization algorithm[J].IEEE Transactions on Evolutionary Computation,6(4),2002.4,321-332.
[17]Maniezzo V,Colorni A,Dorigo M.The Ant System Applied to the Quadratic Assignment Problem[R].Tech Rep IRIDIA/94 28,Universit Libre de Bruxelles,Belgimu.1994.
[18]Talbi E G,Roux O,FonluPt,C Robillard D.Parallel ant colonies for the quadratic assignment problem[J].Future Generation Computer systems,17(4),2001,441-449.
[19]Colorni A,Dorigo M,ManiezzoV,Trubian M.Ant system for job-shop scheduling[J].Belgian Journal of Operations Research,Statistics and Computer Science,34(1),1994,39-53.
[20]Stutzle T.An ant approach to the flow shop problem[A].Proceedings of the 6~(th)European Congress on Intelligent Techniques & Soft Computing[C].Aachen,Gerany,3,1997,1560-1564.
[21]Mc Mullen,Patrick R.An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives[J].Artificial Intelligence in Engineering,15(3),1998,309-317.
[22]Lee Zne-Jung,Lee Chou-Yuan,Su shun-Feng.An immunity based ant colony optimization algorithm for solving weapon-target assignment problem[J].Applied soft Computing Journal,2(1),2002,39-47.
[23]Bullnheimer B,R F Hartl,C Strauss.An improved ant system algorithm for the vehicle routing problem[DB/LO].The 6~(th) Viennese workshop on optimal Control,Dynamic Games[C].Nonlinear Dynamics and Adaptive systems.
[24]ManiezzoV,CarbonaroA.An ants heuristic for the frequency assignment problem[A].Proceedings of MIC' 99[C].1999:927-935.
[25] De Campos, Luis M, Fernndez Luan, Juan M, Gumezjos, APuerta, Jos M. Ant colony optimization for learning Bayesian networks [J]. International Journal of Approximate Reasoning, 31(3), 2002, 291-311.
[26] Silva De A, Ramalh R M. Ant system for the set covering problem [A]. IEEE International Conference on systems [C]. Man, and Cybernetics, Tucson, AZ USA, 2001.5, 3129-3133.
[1]Gajpal Y,Rajendran C.An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops.International Journal of Production Economics,101(2),2006:259-272.
[2]Merkle D,Middendorf M.On solving permutation scheduling problems with ant colony optimization.International Journal of Systems Science,36(5),2005:255-266.
[3]Dowsland K A,Thompson J M.Ant colony optimization for the examination scheduling problem.Journal of the Operational Research Society,56(4),2005:426-438.
[4]Merkle D,Middendorf M,Schmeck H.Ant colony optimization for resource-constrained project scheduling.IEEE Transactions on Evolutionary Computation,6(4),2002:333-346.
[5]Merkle D,Middendorf M.A new approach to solve permutation scheduling problems with Ant Colony Optimization.Lecture Notes in Computer Science,2037,2001:484-494.
[6]Costa D,Hertz A.Ants can color graphs.Journal of the Operational Research Society,48,1997:295-305.
[7]Sammoud O,Solnon C,Ghedira K.Ant algorithm for the graph matching problem.Lecture Notes in Computer Science,3448,2005:213-223.
[8]Bell J E,McMullen P R.Ant colony optimization techniques for the vehicle routing problem.Advanced Engineering Informatics,18(1),2004:41-48.
[9]Reimann M,Doerner K,Hartl R F.D-ants:Savings based ants divide and conquer the vehicle routing problem.Computers and Operations Research,31(4),2004:563-591.
[10]Chitty D M,Hernandez M L.A hybrid ant colony optimization technique for dynamic vehicle routing.Lecture Notes in Computer Science,3102,2004:48-59.
[11]刘志硕,申金升,柴跃廷.基于自适应蚁群算法的车辆路径问题研究[J].控制与决策,20(5),2005:562-566.
[12]李智,许川佩,莫玮,陈光禹.基于蚂蚁算法和遗传算法的同步时序电路初始化[J].电子学报,31(8),2003:1276-1280.
[13]Na Z,Sun H J,Zhou N F.Ant colony optimization for dynamic RWA in WDM networks with partial wavelength conversion.Photonic Network Communication, 11(2),2006:229-236.
[14]Coello Coello C,Zavala Gutierrez R L,Mendoza Garcia B,Hernandez Aguirre A.Automated design of combinational logic circuits using the ant system.Engineering Optimization,34(2),2002:109-127.
[15]Ho C K,Ewe H T.Performance of an ant colony optimization(ACO) algorithm on the dynamic load-balanced clustering problem in ad hoc networks.Lecture Notes in Artificial Intelligence,3801,2005:622-629.
[16]Sim K M,Sun W H.Multiple ant colony optimization for load balancing.Lecture Notes in Computer Science,2690,2003:467-471.
[17]Sim K M,Sun W H.Ant colony optimization for routing and load-balancing:Survey and new directions.IEEE Transactions on Systems,Man,and Cybernetics,Part A:Systems and Humans,33(5),2003:560-572.
[18]Hsiao Y T,Chuang C L,Chien C C.Computer network load-balancing and routing by ant colony optimization.IEEE International Conference on Networks,IEEE Service Center,Piscataway,NJ,1,2004:313-318.
[19]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.
[1]冯登国,吴文玲.分组密码的设计与分析[M].清华大学出版社,2000,67-72.
[2]马良.来自昆虫世界的寻优策略--蚂蚁算法.自然杂志,1999,21(3):161-163.
[3]殷新春,杨洁.基于快速收敛遗传算法的S盒的优化算法[J].计算机应用,26(4),2006年4月,803-805.
[4]潘正君,康立山.演化计算.北京:清华大学出版社,1998.
[5]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.
[6]刘景伟,韦宝典,吕继强,王新梅.AES S盒的密码特性分析[J].西安电子科技大学学报,31(2),2004,255-259.
[7]Duan H B.Ant Colony Algorithms:Theory and Applications.Beijing:Science Press,2005:1-23.
[8]Dorigo M,Maniezzo V,and Colorni A.Ant System:optimization by a colony of cooperating agents.IEEE Transaction on Systems,Man,and Cybernetics-Part B,1996,26(1):29-41.
[9]D Costa,A Hertz.Ants can colour graphs.Journal of the operational research society,1997(48):295-305.
[10]谷大武.分组密码理论与某些关键技术研究[博士学位论文].西安,西安电子科技大学,1998.
[11]朱庆保.蚁群优化算法的收敛性分析[J].控制与决策,21(7),2006,763-770.
[12]段海滨,王道波.蚁群算法的全局收敛性研究及改进[J].系统工程与电子技术,26(10),2004,1506-1509.
[13]O'Connor L.,Enumerating nondegenerate permutations,Advances in Cryptology-Eurocrypt'91,Berlin:Springer-Vedag,1991,368-377.
[14] C. Burwick, D. Coppersmith, E. D. Avignon, R. Gennaro. S. Halevi, C. Jutla, S. M. MatyasJr, L. O'Connor, M. Peyravian, D. Safford, and N. Zunic, "MARS—a candidate cipher for AES, " in Proceedings of the First AES Candidate Conference, National Institute of Standards and Technology, Aug. 1998.
[15] J. Preprzyk, Non-linearity of Exponent Permutations, In Advances in Cryptology. Eurocrypt'89, Proceedings, LNCS, volume 434, pages 81-92.
[16] Chang X G, Dai Z D, Gong G, Some cryptographic properties of exponential functions. In: Advances in Cryptology-Asiacrypt'94, Berlin: Springer-Verlag, 1994: 415-418.
[17] NTT-Nippon Telegraph and Telephone Corporation: E2: E_cient Encryption algorithm. http://info.isl.ntt.co.jp/e2.
[18] Brown L, Pieprzyk J and Seberry J, "Introduction the new LOKI97 block cipher", The first Advance Encryption Standard Candidate Conference, Ventura, California, US, August 20-22, 1998.
[19] Jakimoski G, Kocarev L. Chaos and cryptography: block encryption ciphers based on chaotic maps. IEEE Transactions on Circuits and Systems-1: Fundamental Theory and Applications, 2001, 48(1): 163-169.
[20] K. Nyberg, L. R. Knudsen. Provable Security against Differential Cryptanalysis. Advances in Cryptology, Crypto'92.
[21] D. Feng, B Liu, Almost perfect nonlinear permutations, Electronics Letters, 30(3): 208-209, February 1994.
[22] T. Beth and C. Ding, On Almost Perfect Nonlinear Permutations, In Advances in Cryptology-Eurocrypt'93, Proceedings, LNCS, volume 765, pages 65-76, Springer-Verlag, 1994.
[23] K. Nyberg, Differentially uniform mapping for cryptology, In Advances in Cryptology-Eurocrypt'93, Proceedings, LNCS, volume 765, pages 55-64, Springer-Verlag, 1994.
[24] Ross J. Anderson, Eli Biham, Lars R. Knudsen: The Case for Serpent. AES Candidate Conference 2000: 349-354.
[25]K.Kim,T.Matsumoto,H.Imai.A Recursive Construction Method of S-Boxes Satisfying Strict Avalanche Criterion,In Advances in Cryptology Crypto'90,Proceedings,LNCS,volume 537,pages 564-574,Springer-Verlag 1991.
[26]K.Nyberg,Perfect Nonlinear S-Boxes.In Advances in Cryptology,Eurocrypt Proceedings,LNCS,volume 547,pages 378-386,Springer-Verlag 1991.
[27]K.Nyberg,On the Construction of Highly Nonlinear Permutations.In Advances in Cryptology,Eurocrypt'92 Proceedings,LNCS,volume 658,pages 92-98,Springer-Verlag 1993.
[28]K.Nyberg,Differentially uniform mapping for cryptography.In Advances in Cryptology,Eurocrypt'93 Proceedings,LNCS,volume 765,pages 55-64,Springer-Verlag 1994.
[29]Paul S.L.M.Barreto,Vincent Rijmen.The ANUBIS Block Cipher.http://planeta.terra.com.br/informatica/paulobarreto/AnubisPage.html
[30]O'Connor,Enumerating nondegenerate permutations,In Advances in Cryptology,Eurocrypt'91,Berlin:Springer-Verlag 1991,368-377.
[31]B.Schneier,J.Kelsey,D.Whiting,D.Wagner,C.Hall,and N.Ferguson,The TwofishEncryption Algorithm:A128-bit Block Cipher,John Wiley & Sons,1999.
[32]William Millan,L.Burnett,G.Carter,A.Clark,E.Dawson,Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes,ICICS'99,Berlin:Springer-Verlag,1999,LNCS vol.1726 263-274.
[33]H.Chen,D.Feng.An Effective Evolutionary Strategy for Bijective S-boxes.Proceedings of the IEEE Congress on Evolutionary Computation 2004(CEC'04),June 20-23,2004,Portland,Oregon,pp.2120-2123.
[34]ZHANG Hua-guo,FENG Xiu-tao,QIN Zhong-ping,LIU Yu-zhen,Evolutionary cryptosystems and evolutionary design for DES,Journal of China Institute of Communications,2002,vol.23,No.5,57-64.
[1]John von Neumann The general and logical theory of automata.In:AATaub.J Von Neumann,Collected Works.Urbana:University of Illinois,1963,288-298
[2]Saadia Aassine,M arieC E lJ ay.Ve getationd ynamoi csm odeling:a m ethod for coupling local and space dynamoics[J].Ecological Modelling,2002;154:237-249
[3]Wolfram S.Theory and applications of cellular automata[M].Singapore:World Scientific,1986
[4]Kai N,Michael S.A cellular automaton model for freeway traffic[J]JPhys 1,1992;2(12):2221-2229
[5]S.N andi,A fast and secure stream cipher based on cellular automata over GF,Global Telecommunications Conference,1998.GLOBECOM 1998.The Bridge to Global Integration.IEEE,Vol.6,1998,pp.3250-3255
[8]Dolores de la Guia-Martinez;Amparo Fuster-Sabater design based on cellular automata,Information Theory.1997 Proceedings,1997 IEEE International Symposium on,pp.180
[9]M.Dascalu,Franti,A VLSI implementation of cellular automata randomizers,Circuits and Systems,Asia-Pacific Conference on,1998 pp.735-738
[10]Courtois N T,Meier W.Algebraic attacks on stream ciphers with linear feedback[C]//EUROCRYPT 2003.Berlin,Germany:Springer-Verlag,vol.2656,2003:345-359.
[11]Meier W,Pasalic E,Carlet C.Algebraic Attacks and Decomposition of Boolean Functions[C]EUROCRYPT 2004.Interlaken,Switzerland:Spring-Verlag,vol.3027,2004:474-491.
[12]Dalai D K,Gupta K C,Maitra S.Results on algebraic immunity for cryptographically significant Boolean functions[C]INDOCRYPT 2004.Chennai,India:Springer-Verlag,vol.3348,2004:92-106.
[13]Braeken A,Preneel B.Probabilistic algebraic attacks[C]Cryptography and Coding 2005.Cirencester,UK:Springer-Verlag,vol.3796,2005:290-303.
[14]温巧燕,钮心忻,杨义先.现代密码学中的布尔函数[M].北京:科学出版社,2000.
[1]冯登国.频谱理论及其在密码学中的应用[M].北京:科学出版社,2000.
[2]W Milian,A Clark and E Dawson.Smart Hill Climbing Finds Beter Boolean Functions.In Workshop on Selected Areas in Cryptology 1997,50-63.
[3]X.-M.Zhang and Y.Zheng.Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions.In Advances in Cryptology-Eurocrypt'96,Proceedings,volume 1070 of Lecture Notes in Computer Science,pages 294-306.Springer-Verlag,1996.
[4]MILLAN W,CLARK A,DAWSON E.Smart hill climbing finds better boolean functions[A].Workshop on Selected Areas in Cryptology[C].1997.50-63.
[5]K.G.Beauchamp.Applications of Walsh and Related Function.Academic Press,1984.
[6]X.-M.Zhang and Y.Zheng.Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions.In Advances in Cryptology-Eurocrypt'96,Proceedings,volume 1070 of Lecture Notes in Computer Science,pages 294-306.Springer-Verlag,1996.
[7]C.Carlet.Partially-Bent Functions.In Advances in Cryptology - Crypto '92,Proceedings,volume 740 of Lecture Notes in Computer Science,pages 280-291.Springer-Verlag,1993.
[8]MILLAN W,CLARK A,DAWSON E.Heuristic design of cryptographically strong balanced boolean functions[A].Advances in Cryptology EUROCRYPT'98,LNCS[C].Springer Verlag,1998.489-499.
[9]李超,胡朋松,海昕.布尔函数设计中的爬山算法及其改进[J].通信学报,2007,28(3):130-133.
[10]孟庆树,张焕国,王张宜,覃中平,彭文灵.Bent函数的演化设计[J].电子学报,2004,32(11):1901-1903.
[11]冯登国.频谱理论及其在密码学中的应用[M].北京:科学出版社,2000.
[12]R.Spillman,M.Janssen,B.Nelson,and M.Kepner.Use of a Genetic Algorithm in the Cryptanalysis of Simple Substitution Ciphers.Cryptologia,17(1):31-44,January 1993.
[1]Portnoy,L,Eskin,E,Stolfo,S.Intrusion Detection with Unlabeled Data Using Clustering[A].Proceedings of ACM CSS Workshop on Data Mining Applied to Security(DMSA-2001)[C].Philadelphia,PA:November 5-8,2001.
[2]Hansen,P,Mladenovi(?),N.J-Means:A New Local Search Heuristic for Minimum Sum of Squares Clustering[J].Pattern Recognition,2001,34(2):405-413.
[3]Guan,Y,Ghorbani,AA,Belacel,N.Y-Means:A Clustering Method for Intrusion Detection[A].Proceedings of Canadian Conference on Electrical and Computer Engineering[C].Montreal,Quebec,Canada.May 4-7,2003.
[4]Rosenfeld,A.Fuzzy Digital Topology[J].Information and Control,1979,Vol.40,76-87.
[5]Udupa J K,Samarasekera S.Fuzzy connectedness and object definition:Theory,algorithm and applications in image segmentation.Graphical Model and Image Processing,1996,58(3):246-261.
[6]曹明,李剑,杨义先.一种基于模糊连接聚类的入侵防御算法[C].全国网络与信息安全技术研讨会'2005.
[7]孙志胜,曹爱增,梁永涛.基于遗传算法聚类分析及其应用[J].济南大学学报,2004,18(2):127-129.
[8]戴晓晖,李敏强,寇纪凇.基于遗传算法的动态聚类方法[J].系统工程理论与实践,1999,(10):108-110.
[9]李士勇编著.工程模糊数学及应用[M].哈尔滨:哈尔滨工业大学出版社.2004年8月.
[10]潘建江,杨勋年,汪国昭.基于模糊连接度的图像分割及算法[J].软件学报,2005,16(1):67-76.
[2]高尚.蚁群算法理论、应用及其与其它算法的混合[学位论文],南京,南京理工大学,2005年.
[3]王育民,刘建伟.通信网的安全-理论与技术.西安:西安电子科技大学出版社,1999.
[4]彭喜元,彭宇,戴毓丰.群智能理论及应用[J].电子学报,31(12A),2003年12月,1982-1988.
[5]Diffie W,Hellman M E.New directions in cryptography.IEEE Transactions on Information Theory,1976,22(6):644-654.
[6]Dorigo M,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperation agents[J].IEEE Transactions on System,Man and Cybernetics Part B,26(1),1996/1,29-42.
[7]霍有光.中国古代科技史钩沉.西安:陕西科学技术出版社.1998.
[8]冯登国,吴文玲.分组密码的设计与分析.北京:清华大学出版社,2000.
[9]张照止.现代密码学基础.北京:京邮电大学出版社.2004.
[10]多磊,李超.分组密码的设计与分析.国防科学技术大学研究生院理学硕士学位论文,2002.
[11]Caro G Di,Dorigo M.AntNet:Distributed stigergetic control for communications networks[J].Journal of Artificial Intelligence Research(AJIR),9,1998,317-365.
[12]Li Lianyuan,Liu Zemin,Zhou Zheng.A new dynamic distributed routing algoritm on telecommunication networks[A].International Conference on Communication Technology Proceedings[C].Beijing China,2000/1,849-852.
[13]Gunes M,Sorges U,Bouazizi I.ARA the ant colony based routing algorithm for MNETs[A].Proceedings International Conference on Parallel Processing workshops[C].Uuncouver,BC,Canada,2002:79-85.
[14]Caro G Di,Dorigo M.Mobile agents for adaptive routing[A].Proceedings of the Thirty First Hawaii International Conference on System Sciences[C].Kohala Coast,HI USA,6-9 Jan 1998.7:74-83.
[15]马良.来自昆虫世界的寻优策略--蚂蚁算法.自然杂志,1999,21(3):161-163.
[16]Parpinelli R S,Lopes H S,Freitas.Data mining with an ant colony optimization algorithm[J].IEEE Transactions on Evolutionary Computation,6(4),2002.4,321-332.
[17]Maniezzo V,Colorni A,Dorigo M.The Ant System Applied to the Quadratic Assignment Problem[R].Tech Rep IRIDIA/94 28,Universit Libre de Bruxelles,Belgimu.1994.
[18]Talbi E G,Roux O,FonluPt,C Robillard D.Parallel ant colonies for the quadratic assignment problem[J].Future Generation Computer systems,17(4),2001,441-449.
[19]Colorni A,Dorigo M,ManiezzoV,Trubian M.Ant system for job-shop scheduling[J].Belgian Journal of Operations Research,Statistics and Computer Science,34(1),1994,39-53.
[20]Stutzle T.An ant approach to the flow shop problem[A].Proceedings of the 6~(th)European Congress on Intelligent Techniques & Soft Computing[C].Aachen,Gerany,3,1997,1560-1564.
[21]Mc Mullen,Patrick R.An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives[J].Artificial Intelligence in Engineering,15(3),1998,309-317.
[22]Lee Zne-Jung,Lee Chou-Yuan,Su shun-Feng.An immunity based ant colony optimization algorithm for solving weapon-target assignment problem[J].Applied soft Computing Journal,2(1),2002,39-47.
[23]Bullnheimer B,R F Hartl,C Strauss.An improved ant system algorithm for the vehicle routing problem[DB/LO].The 6~(th) Viennese workshop on optimal Control,Dynamic Games[C].Nonlinear Dynamics and Adaptive systems.
[24]ManiezzoV,CarbonaroA.An ants heuristic for the frequency assignment problem[A].Proceedings of MIC' 99[C].1999:927-935.
[25] De Campos, Luis M, Fernndez Luan, Juan M, Gumezjos, APuerta, Jos M. Ant colony optimization for learning Bayesian networks [J]. International Journal of Approximate Reasoning, 31(3), 2002, 291-311.
[26] Silva De A, Ramalh R M. Ant system for the set covering problem [A]. IEEE International Conference on systems [C]. Man, and Cybernetics, Tucson, AZ USA, 2001.5, 3129-3133.
[1]Gajpal Y,Rajendran C.An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops.International Journal of Production Economics,101(2),2006:259-272.
[2]Merkle D,Middendorf M.On solving permutation scheduling problems with ant colony optimization.International Journal of Systems Science,36(5),2005:255-266.
[3]Dowsland K A,Thompson J M.Ant colony optimization for the examination scheduling problem.Journal of the Operational Research Society,56(4),2005:426-438.
[4]Merkle D,Middendorf M,Schmeck H.Ant colony optimization for resource-constrained project scheduling.IEEE Transactions on Evolutionary Computation,6(4),2002:333-346.
[5]Merkle D,Middendorf M.A new approach to solve permutation scheduling problems with Ant Colony Optimization.Lecture Notes in Computer Science,2037,2001:484-494.
[6]Costa D,Hertz A.Ants can color graphs.Journal of the Operational Research Society,48,1997:295-305.
[7]Sammoud O,Solnon C,Ghedira K.Ant algorithm for the graph matching problem.Lecture Notes in Computer Science,3448,2005:213-223.
[8]Bell J E,McMullen P R.Ant colony optimization techniques for the vehicle routing problem.Advanced Engineering Informatics,18(1),2004:41-48.
[9]Reimann M,Doerner K,Hartl R F.D-ants:Savings based ants divide and conquer the vehicle routing problem.Computers and Operations Research,31(4),2004:563-591.
[10]Chitty D M,Hernandez M L.A hybrid ant colony optimization technique for dynamic vehicle routing.Lecture Notes in Computer Science,3102,2004:48-59.
[11]刘志硕,申金升,柴跃廷.基于自适应蚁群算法的车辆路径问题研究[J].控制与决策,20(5),2005:562-566.
[12]李智,许川佩,莫玮,陈光禹.基于蚂蚁算法和遗传算法的同步时序电路初始化[J].电子学报,31(8),2003:1276-1280.
[13]Na Z,Sun H J,Zhou N F.Ant colony optimization for dynamic RWA in WDM networks with partial wavelength conversion.Photonic Network Communication, 11(2),2006:229-236.
[14]Coello Coello C,Zavala Gutierrez R L,Mendoza Garcia B,Hernandez Aguirre A.Automated design of combinational logic circuits using the ant system.Engineering Optimization,34(2),2002:109-127.
[15]Ho C K,Ewe H T.Performance of an ant colony optimization(ACO) algorithm on the dynamic load-balanced clustering problem in ad hoc networks.Lecture Notes in Artificial Intelligence,3801,2005:622-629.
[16]Sim K M,Sun W H.Multiple ant colony optimization for load balancing.Lecture Notes in Computer Science,2690,2003:467-471.
[17]Sim K M,Sun W H.Ant colony optimization for routing and load-balancing:Survey and new directions.IEEE Transactions on Systems,Man,and Cybernetics,Part A:Systems and Humans,33(5),2003:560-572.
[18]Hsiao Y T,Chuang C L,Chien C C.Computer network load-balancing and routing by ant colony optimization.IEEE International Conference on Networks,IEEE Service Center,Piscataway,NJ,1,2004:313-318.
[19]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.
[1]冯登国,吴文玲.分组密码的设计与分析[M].清华大学出版社,2000,67-72.
[2]马良.来自昆虫世界的寻优策略--蚂蚁算法.自然杂志,1999,21(3):161-163.
[3]殷新春,杨洁.基于快速收敛遗传算法的S盒的优化算法[J].计算机应用,26(4),2006年4月,803-805.
[4]潘正君,康立山.演化计算.北京:清华大学出版社,1998.
[5]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.
[6]刘景伟,韦宝典,吕继强,王新梅.AES S盒的密码特性分析[J].西安电子科技大学学报,31(2),2004,255-259.
[7]Duan H B.Ant Colony Algorithms:Theory and Applications.Beijing:Science Press,2005:1-23.
[8]Dorigo M,Maniezzo V,and Colorni A.Ant System:optimization by a colony of cooperating agents.IEEE Transaction on Systems,Man,and Cybernetics-Part B,1996,26(1):29-41.
[9]D Costa,A Hertz.Ants can colour graphs.Journal of the operational research society,1997(48):295-305.
[10]谷大武.分组密码理论与某些关键技术研究[博士学位论文].西安,西安电子科技大学,1998.
[11]朱庆保.蚁群优化算法的收敛性分析[J].控制与决策,21(7),2006,763-770.
[12]段海滨,王道波.蚁群算法的全局收敛性研究及改进[J].系统工程与电子技术,26(10),2004,1506-1509.
[13]O'Connor L.,Enumerating nondegenerate permutations,Advances in Cryptology-Eurocrypt'91,Berlin:Springer-Vedag,1991,368-377.
[14] C. Burwick, D. Coppersmith, E. D. Avignon, R. Gennaro. S. Halevi, C. Jutla, S. M. MatyasJr, L. O'Connor, M. Peyravian, D. Safford, and N. Zunic, "MARS—a candidate cipher for AES, " in Proceedings of the First AES Candidate Conference, National Institute of Standards and Technology, Aug. 1998.
[15] J. Preprzyk, Non-linearity of Exponent Permutations, In Advances in Cryptology. Eurocrypt'89, Proceedings, LNCS, volume 434, pages 81-92.
[16] Chang X G, Dai Z D, Gong G, Some cryptographic properties of exponential functions. In: Advances in Cryptology-Asiacrypt'94, Berlin: Springer-Verlag, 1994: 415-418.
[17] NTT-Nippon Telegraph and Telephone Corporation: E2: E_cient Encryption algorithm. http://info.isl.ntt.co.jp/e2.
[18] Brown L, Pieprzyk J and Seberry J, "Introduction the new LOKI97 block cipher", The first Advance Encryption Standard Candidate Conference, Ventura, California, US, August 20-22, 1998.
[19] Jakimoski G, Kocarev L. Chaos and cryptography: block encryption ciphers based on chaotic maps. IEEE Transactions on Circuits and Systems-1: Fundamental Theory and Applications, 2001, 48(1): 163-169.
[20] K. Nyberg, L. R. Knudsen. Provable Security against Differential Cryptanalysis. Advances in Cryptology, Crypto'92.
[21] D. Feng, B Liu, Almost perfect nonlinear permutations, Electronics Letters, 30(3): 208-209, February 1994.
[22] T. Beth and C. Ding, On Almost Perfect Nonlinear Permutations, In Advances in Cryptology-Eurocrypt'93, Proceedings, LNCS, volume 765, pages 65-76, Springer-Verlag, 1994.
[23] K. Nyberg, Differentially uniform mapping for cryptology, In Advances in Cryptology-Eurocrypt'93, Proceedings, LNCS, volume 765, pages 55-64, Springer-Verlag, 1994.
[24] Ross J. Anderson, Eli Biham, Lars R. Knudsen: The Case for Serpent. AES Candidate Conference 2000: 349-354.
[25]K.Kim,T.Matsumoto,H.Imai.A Recursive Construction Method of S-Boxes Satisfying Strict Avalanche Criterion,In Advances in Cryptology Crypto'90,Proceedings,LNCS,volume 537,pages 564-574,Springer-Verlag 1991.
[26]K.Nyberg,Perfect Nonlinear S-Boxes.In Advances in Cryptology,Eurocrypt Proceedings,LNCS,volume 547,pages 378-386,Springer-Verlag 1991.
[27]K.Nyberg,On the Construction of Highly Nonlinear Permutations.In Advances in Cryptology,Eurocrypt'92 Proceedings,LNCS,volume 658,pages 92-98,Springer-Verlag 1993.
[28]K.Nyberg,Differentially uniform mapping for cryptography.In Advances in Cryptology,Eurocrypt'93 Proceedings,LNCS,volume 765,pages 55-64,Springer-Verlag 1994.
[29]Paul S.L.M.Barreto,Vincent Rijmen.The ANUBIS Block Cipher.http://planeta.terra.com.br/informatica/paulobarreto/AnubisPage.html
[30]O'Connor,Enumerating nondegenerate permutations,In Advances in Cryptology,Eurocrypt'91,Berlin:Springer-Verlag 1991,368-377.
[31]B.Schneier,J.Kelsey,D.Whiting,D.Wagner,C.Hall,and N.Ferguson,The TwofishEncryption Algorithm:A128-bit Block Cipher,John Wiley & Sons,1999.
[32]William Millan,L.Burnett,G.Carter,A.Clark,E.Dawson,Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes,ICICS'99,Berlin:Springer-Verlag,1999,LNCS vol.1726 263-274.
[33]H.Chen,D.Feng.An Effective Evolutionary Strategy for Bijective S-boxes.Proceedings of the IEEE Congress on Evolutionary Computation 2004(CEC'04),June 20-23,2004,Portland,Oregon,pp.2120-2123.
[34]ZHANG Hua-guo,FENG Xiu-tao,QIN Zhong-ping,LIU Yu-zhen,Evolutionary cryptosystems and evolutionary design for DES,Journal of China Institute of Communications,2002,vol.23,No.5,57-64.
[1]John von Neumann The general and logical theory of automata.In:AATaub.J Von Neumann,Collected Works.Urbana:University of Illinois,1963,288-298
[2]Saadia Aassine,M arieC E lJ ay.Ve getationd ynamoi csm odeling:a m ethod for coupling local and space dynamoics[J].Ecological Modelling,2002;154:237-249
[3]Wolfram S.Theory and applications of cellular automata[M].Singapore:World Scientific,1986
[4]Kai N,Michael S.A cellular automaton model for freeway traffic[J]JPhys 1,1992;2(12):2221-2229
[5]S.N andi,A fast and secure stream cipher based on cellular automata over GF,Global Telecommunications Conference,1998.GLOBECOM 1998.The Bridge to Global Integration.IEEE,Vol.6,1998,pp.3250-3255
[8]Dolores de la Guia-Martinez;Amparo Fuster-Sabater design based on cellular automata,Information Theory.1997 Proceedings,1997 IEEE International Symposium on,pp.180
[9]M.Dascalu,Franti,A VLSI implementation of cellular automata randomizers,Circuits and Systems,Asia-Pacific Conference on,1998 pp.735-738
[10]Courtois N T,Meier W.Algebraic attacks on stream ciphers with linear feedback[C]//EUROCRYPT 2003.Berlin,Germany:Springer-Verlag,vol.2656,2003:345-359.
[11]Meier W,Pasalic E,Carlet C.Algebraic Attacks and Decomposition of Boolean Functions[C]EUROCRYPT 2004.Interlaken,Switzerland:Spring-Verlag,vol.3027,2004:474-491.
[12]Dalai D K,Gupta K C,Maitra S.Results on algebraic immunity for cryptographically significant Boolean functions[C]INDOCRYPT 2004.Chennai,India:Springer-Verlag,vol.3348,2004:92-106.
[13]Braeken A,Preneel B.Probabilistic algebraic attacks[C]Cryptography and Coding 2005.Cirencester,UK:Springer-Verlag,vol.3796,2005:290-303.
[14]温巧燕,钮心忻,杨义先.现代密码学中的布尔函数[M].北京:科学出版社,2000.
[1]冯登国.频谱理论及其在密码学中的应用[M].北京:科学出版社,2000.
[2]W Milian,A Clark and E Dawson.Smart Hill Climbing Finds Beter Boolean Functions.In Workshop on Selected Areas in Cryptology 1997,50-63.
[3]X.-M.Zhang and Y.Zheng.Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions.In Advances in Cryptology-Eurocrypt'96,Proceedings,volume 1070 of Lecture Notes in Computer Science,pages 294-306.Springer-Verlag,1996.
[4]MILLAN W,CLARK A,DAWSON E.Smart hill climbing finds better boolean functions[A].Workshop on Selected Areas in Cryptology[C].1997.50-63.
[5]K.G.Beauchamp.Applications of Walsh and Related Function.Academic Press,1984.
[6]X.-M.Zhang and Y.Zheng.Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions.In Advances in Cryptology-Eurocrypt'96,Proceedings,volume 1070 of Lecture Notes in Computer Science,pages 294-306.Springer-Verlag,1996.
[7]C.Carlet.Partially-Bent Functions.In Advances in Cryptology - Crypto '92,Proceedings,volume 740 of Lecture Notes in Computer Science,pages 280-291.Springer-Verlag,1993.
[8]MILLAN W,CLARK A,DAWSON E.Heuristic design of cryptographically strong balanced boolean functions[A].Advances in Cryptology EUROCRYPT'98,LNCS[C].Springer Verlag,1998.489-499.
[9]李超,胡朋松,海昕.布尔函数设计中的爬山算法及其改进[J].通信学报,2007,28(3):130-133.
[10]孟庆树,张焕国,王张宜,覃中平,彭文灵.Bent函数的演化设计[J].电子学报,2004,32(11):1901-1903.
[11]冯登国.频谱理论及其在密码学中的应用[M].北京:科学出版社,2000.
[12]R.Spillman,M.Janssen,B.Nelson,and M.Kepner.Use of a Genetic Algorithm in the Cryptanalysis of Simple Substitution Ciphers.Cryptologia,17(1):31-44,January 1993.
[1]Portnoy,L,Eskin,E,Stolfo,S.Intrusion Detection with Unlabeled Data Using Clustering[A].Proceedings of ACM CSS Workshop on Data Mining Applied to Security(DMSA-2001)[C].Philadelphia,PA:November 5-8,2001.
[2]Hansen,P,Mladenovi(?),N.J-Means:A New Local Search Heuristic for Minimum Sum of Squares Clustering[J].Pattern Recognition,2001,34(2):405-413.
[3]Guan,Y,Ghorbani,AA,Belacel,N.Y-Means:A Clustering Method for Intrusion Detection[A].Proceedings of Canadian Conference on Electrical and Computer Engineering[C].Montreal,Quebec,Canada.May 4-7,2003.
[4]Rosenfeld,A.Fuzzy Digital Topology[J].Information and Control,1979,Vol.40,76-87.
[5]Udupa J K,Samarasekera S.Fuzzy connectedness and object definition:Theory,algorithm and applications in image segmentation.Graphical Model and Image Processing,1996,58(3):246-261.
[6]曹明,李剑,杨义先.一种基于模糊连接聚类的入侵防御算法[C].全国网络与信息安全技术研讨会'2005.
[7]孙志胜,曹爱增,梁永涛.基于遗传算法聚类分析及其应用[J].济南大学学报,2004,18(2):127-129.
[8]戴晓晖,李敏强,寇纪凇.基于遗传算法的动态聚类方法[J].系统工程理论与实践,1999,(10):108-110.
[9]李士勇编著.工程模糊数学及应用[M].哈尔滨:哈尔滨工业大学出版社.2004年8月.
[10]潘建江,杨勋年,汪国昭.基于模糊连接度的图像分割及算法[J].软件学报,2005,16(1):67-76.