期刊文献+

New chaos-based encryption scheme for digital sequence

New chaos-based encryption scheme for digital sequence
下载PDF
导出
摘要 To enhance the anti-breaking performance of privacy information, this article proposes a new encryption method utilizing the leaping peculiarity of the periodic orbits of chaos systems. This method maps the secret sequence to several chaos periodic orbits, and a short sequence obtained by evolving the system parameters of the periodic orbits in another nonlinear system will be the key to reconstruct these periodic orbits. In the decryption end, the shadowing method of chaos trajectory based on the modified Newton-Raphson algorithm is adopted to restore these system parameters. Through deciding which orbit each pair coordinate falls on, the original digital sequence can be decrypted. To enhance the anti-breaking performance of privacy information, this article proposes a new encryption method utilizing the leaping peculiarity of the periodic orbits of chaos systems. This method maps the secret sequence to several chaos periodic orbits, and a short sequence obtained by evolving the system parameters of the periodic orbits in another nonlinear system will be the key to reconstruct these periodic orbits. In the decryption end, the shadowing method of chaos trajectory based on the modified Newton-Raphson algorithm is adopted to restore these system parameters. Through deciding which orbit each pair coordinate falls on, the original digital sequence can be decrypted.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2007年第4期698-703,709,共7页 系统工程与电子技术(英文版)
基金 This project was supported by the National Natural Science Foundation of Shaan'Xi Province, China (2003F40).
关键词 encryption scheme LPO (leaping periodic orbits) chaos initial conditions parameter estimation nonlinear system encryption scheme LPO (leaping periodic orbits) chaos initial conditions parameter estimation nonlinear system
  • 相关文献

参考文献1

二级参考文献2

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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