基于旅行商问题和混沌的高效密码替换盒设计
Efficient Cryptographic Substitution Box Design Using Travelling Salesman Problem and Chaos
摘要:
对称加密是实现安全性的最可靠的选择之一。在现代分组对称密码中,替代盒作为非线性元件,对密码的实际安全性起着至关重要的作用。本文利用旅行商问题和分段线性混沌映射来合成一个高效的8 × 8置换盒结构。所提出的预期设计具有标准性能指标所证明的一致性。统计结果表明,与最近的一些研究相比,预期的替代盒在密码学上更令人印象深刻。
英文摘要:
Symmetric encryption has been a standout amongst the most reliable option by which security is accomplished. In modern block symmetric ciphers, the substitution-boxes have been playing a critical role of nonlinear components that drives the actual security of ciphers. In this paper, the travelling salesman problem and piecewise linear chaotic map are explored to synthesize an efficient configuration of 8x8 substitution-box. The proposed anticipated design has the consistency which is justified by the standard performance indexes. The statistical results manifest that the prospective substitution-box is cryptographically more impressive as compared to some recent investigations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。