欢迎访问中国科学院大学学报,今天是
数学与物理学

双随机相位加密系统的无约束最优化攻击

  • 王国华 ,
  • 李拓 ,
  • 张三国 ,
  • 史祎诗
展开
  • 1 中国科学院大学, 北京 100049;
    2 中国科学院大数据挖掘与知识管理重点实验室, 北京 100049;
    3 中国科学院光电研究院, 北京 100094

收稿日期: 2016-02-24

  修回日期: 2016-03-31

  网络出版日期: 2016-09-15

基金资助

国家自然科学基金(61575197)和中国科学院科学融合教育创新项目资助

Unconstrained optimization attack on double random phase cryptosystem

  • WANG Guohua ,
  • LI Tuo ,
  • ZHANG Sanguo ,
  • SHI Yishi
Expand
  • 1 University of Chinese Academy of Sciences, Beijing 100049, China;
    2 Key Laboratory of Big Data Mining and Knowledge Management, Chinese Academy of Sciences, Beijing 100049, China;
    3 Academy of Opto-electronics, Chinese Academy of Sciences, Beijing 100094, China

Received date: 2016-02-24

  Revised date: 2016-03-31

  Online published: 2016-09-15

摘要

提出一种针对双随机光学相位加密系统的无约束最优化攻击算法.在已知明文条件下,首次将双随机相位加密系统的攻击问题转化为一个单目标无约束最优化模型.基于该模型,在相应的攻击算法设计中,采用拟牛顿矩阵代替Hessian矩阵以准确获取系统的密钥,避免传统牛顿法需要计算Hessian矩阵的逆等严重缺陷.同时,因有效利用拟牛顿矩阵的正定、对称、可迭代求逆的特点,新的攻击算法具有恢复效果好、收敛速度快、初值依赖弱、鲁棒性较强等优势.此外,本算法所需约束条件较少,可方便地移植到其他光学加密系统的攻击中.

本文引用格式

王国华 , 李拓 , 张三国 , 史祎诗 . 双随机相位加密系统的无约束最优化攻击[J]. 中国科学院大学学报, 2016 , 33(5) : 604 -611 . DOI: 10.7523/j.issn.2095-6134.2016.05.005

Abstract

An unconstrained optimization method is proposed to attack the double phase encryption system.Under the condition of knowing the plaintext, the new attack method builds an unconstrained optimization model and gets the accurate phase key via this model. Using the acquired phase key, the attacker decrypts the followed cipher. The new attack method transforms the problem of attacking the double phase encryption system into an unconstrained optimization model. The new attack method replaces Hessian matrix by quasi-Newton matrix to avoid computation of the reverse of Hessian matrix. The new attack method has fast convergence speed and strong robustness, and it is not too sensitive to the original values of the variables. This attack method can be applied to other encryption systems.

参考文献

[1] Refregier P, Javidi B. Optical image encryption based on input plane and Fourier plane random encoding[J]. Optics Letters, 1995, 20(7):767-769.
[2] Arturo C, Mario M U, Sergio A, et al. Vulnerability to chosen-cyphertext attacks of optical encryption schemes based on double random phase keys[J]. Optics Letters, 2010, 30(30):1644-1646.
[3] Peng X, Wei H Z, Zhang P. Chosen-plaintext attack on lensless double-random phase encoding in the Fresnel domain[J]. Optics Letters, 2006, 31(22):3261-3263.
[4] He W Q, Peng X, Meng X F. A hybrid strategy for cryptanalysis of optical encryption based on double-random phase-amplitude encoding[J]. Optics & Laser Technology, 2012, 44(5):1203-1206.
[5] He W Q, Peng X, Meng X F, et al. Collision in optical image encryption based on interference and a method for avoiding this security leak[J]. Optics & Laser Technology, 2013, 47(47):31-36.
[6] Situ G H, Peolrini G,Osten W. Strategy for cryptanalysis of optical encryption in the Fresnel domain[J].Applied Optics, 2010, 49(3):457-462.
[7] Peng X, Zhang P, Wei H Z, et al. Known-plaintext attack on optical encryption based on double random phase keys[J]. Optics Letters, 2006, 31(8):1044-1046.
[8] John Fredy B, Carlos V, Myrian T, et al. Known-plaintext attack on a joint transform correlator encrypting system[J]. Optics Letters, 2010, 35(21):3553-3555.
[9] Wang X G,Chen Y X,Dai C Q, et al. Discussion and a new attack of the optical asymmetric cryptosystem based on phase-truncated Fourier transform[J]. Applied Optics, 2014, 53(2):208-213.
[10] Gopinathan U, Monaghan D S, Naughton T J, et al. A known-plaintext heuristic attack on the Fourier plane encryption algorithm[J]. Optics Express, 2006, 14(8):3181-3186.
[11] Yann F, Albertina C, Naughton T J, et al. Resistance of the double random phase encryption against various attacks[J]. Optics Express, 2014, 15(16):10253-10265.
[12] Li T, Wang Y L,Zhang J, et al. Analytic known-plaintext attack on a phase-shifting interferometry-based cryptosystem[J]. Applied Optics, 2015, 54(2):306-311.
[13] Zhang C G,Liao M H,He W Q, et al. Ciphertext-only attack on a joint transform correlator encryption system[J]. Optics Express, 2013, 21(23):28523-28530.
[14] 史祎诗, 王雅丽, 肖俊,等. 基于位相抽取的三维信息加密算法研究[J]. 物理学报, 2011, 60(3):236-241.
[15] 刘祥磊, 潘泽, 王雅丽, 等. 基于叠层衍射的数字水印算法研究[J]. 物理学报, 2015, 64(23):234201.
[16] Li T,Shi Y S. Security risk of diffractive-imaging-based optical cryptosystem[J]. Optics Express, 2015, 23(16):21384-21391.
[17] Fukushima M,Li D H. On the global convergence of the bfgs method for nonconvex unconstrained optimization problems[J]. Siam J Optim Vol, 2001, 11(4):1054-1064.
[18] Liu D C, Nocedal J. On the limited memory BFGS method for large scale optimization[J]. Mathematical Programming, 1989, 45(3):503-528.
[19] Hoffmann K H, Christoph M, Hanf M. Optimizing simulated annealing[C]//Parallel Problem Solving from Nature. Springer Berlin Heidelberg, 1991:221-225.
[20] Romeijn H E, Smith R L. Simulated annealing for constrained global optimization[J]. Journal of Global Optimization, 1994, 5(2):101-126.
[21] Anthony M, Bartlett P L. Neural network learning:theoretical foundations[J].Ai Magazine, 2001, 22(2):99-100.
[22] Jones G, Willett P, Glen R C, et al. Development and validation of a genetic algorithm for flexible docking[J]. Journal of Molecular Biology, 1997, 267(3):727-748.
[23] Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm:NSGA-Ⅱ, IEEE Trans. on Evol[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2):182-197.

文章导航

/