期刊文献+

基于多目标演化算法的序列密钥生成方法 被引量:3

Sequence Encryption Producing Method Based on Multi-objective Evolutionary Algorithm
下载PDF
导出
摘要 将评价密钥流随机性的2个指标作为多目标演化算法的2个优化目标,提出了一种基于多目标演化算法的序列密钥生成方法——MOEASEP。由于该算法基于演化算子的随机特性和多目标演化算法的特点,其生成的密钥流具有高随机性、混沌性和长周期性。实验结果亦表明,利用该方法产生的序列密钥具有良好的性能。 In this paper, two criteria used to evaluate the randomness of encryption stream are turned into two objectives of Multi-objective Evolutionary Algorithm (MOEA), and a new sequence encryption producing method based on MOEA was proposed (called MOEASEP). Because MOEASEP was based on the randomness of evolutionary operators and the features of MOEA, the encryption streams produced by MOEASEP had good merits of high randomness, chaos and long period, which had also been demonstrated in the experiments.
出处 《武汉理工大学学报》 EI CAS CSCD 北大核心 2008年第8期69-73,共5页 Journal of Wuhan University of Technology
基金 国家重大基础研究(973)项目(2004CB318103) 江西省研究生创新基金(YC07A073)
关键词 流密码 多目标优化 演化算法 sequence encryption multi-objective evolutionary algorithm (MOEA) evolutionary algorithm
  • 相关文献

参考文献8

二级参考文献33

  • 1Liu T K, Ishihara T, Inooka H. Multiobjective control systems design by genetic algorithms [C]//Proceedings of the 34th Society of International and Control Engineering Annual Conference, 1995, 1521 - 1526.
  • 2Fonseca C M, Fleming P J. Genetic algorithms for multiobjective optimisation: formulation, discussion and generation [C]//Forrest S.Proceedings of the Fifth International Conference on Genetic Algorithms, SanMateo, California, University of Illinois at Urbana Champaign, Morgan Kaufman Publishers, 1993, 416-423.
  • 3Srinivas N, Kalyanmoy D. Multiobjective optimization using nondominated sorting in genetic algorithms [J]. Evolutionary Computation (S1089-778X). 1994, 2(3): 221-248.
  • 4Horn J, Nafpliotis N. Multiobjective optimization using the Riched Pareto genetic algorithm [R]. Technical Report Illi GAL Report 93005,University of Illinois at Urbana- Champaign, Urbana, Illinois, USA, 1993.
  • 5Goldberg DE. Genetic algorithms in search, optimization and machine learning [M]. Addison-Wesley, Reading, MA, 1989.
  • 6Gen M, Cheng R. Genetic algorithms & engineering optimisation[M]. Wiley, New York. 2000.
  • 7Qiao Bing, SunZhijun, Zhu Jiangying. Solving Flexible Job Shop scheduling problem with Genetic Algorithm [J]. Transactions of Nanjing University of Aeronautics & Astronautics (S0469-5097).2001, 18(1): 108-113.
  • 8P Brandimarte. Routing and scheduling in a flexible job shop by tabu search [K]. Annals of Operations Research, 1993, 22: 158-183.
  • 9Imed Kacem Genetic Algorithm for the Flexible job shop Scheduling Problem [J]. IEEE (S1083-4427). 2003, 3464-3469.
  • 10Schaffer J D. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms[A].In J J Grefenstte(Ed.).Proceeding of an International Conference on Genetic Algorithms and Their Applications[C]. Pittsburgh PA:Morgan Kaufmann Publishers, 1985,93-100.

共引文献35

同被引文献22

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部