透過您的圖書館登入
IP:18.216.21.235
  • 期刊

Cryptanalysis of Block Ciphers via Improvised Particle Swarm Optimization and Extended Simulated Annealing Techniques

並列摘要


Optimization heuristics have been pursued in recent years as a viable approach in cryptanalysis. Even in simple ciphers where brute force method is successful, use of these techniques demonstrates their potential application in at- tacks of complex ciphers. This paper establishes the applicability of a couple of optimization heuristics to cryptanalysis studies; one based on thermostatistical persistency applied to simulated annealing and the other one based on particle swarm principle. Though both methods lead to successful attacks, our improvised version of group swarm optimization yields better performance. As a vehicle of demonstration of our concept, we choose simple yet representative block ciphers such as computationally tractable versions of DES, for our studies.

被引用紀錄


張家豪(2013)。科學園區特高壓供電系統及用戶變電站之接地系統最佳整合〔碩士論文,國立臺北科技大學〕。華藝線上圖書館。https://doi.org/10.6841/NTUT.2013.00197
白光庭(2012)。多目標測試案例優先順序之探討〔碩士論文,中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu201200509
Chang, C. M. (2015). 分析不同變異考量下之簡化模型對排序佳化的影響:以迴流產線產能分配為例 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2015.02086
Cheng, L. Y. (2012). 拆解式多目標演化演算法於平行化之設計與研究 [master's thesis, National Chung Cheng University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0033-2110201613525318
張雅惠(2012)。先進排程之產業適用性與相關技術之探討〔碩士論文,元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-2801201415020698

延伸閱讀