The Problem with Regular Multiple Byte Block Boundaries in Encryption

2022 IEEE 13th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)(2022)

引用 0|浏览0
暂无评分
摘要
Product ciphers composed of multi-byte permutations and substitutions are generally considered to be more secure than the substitution ciphers. However, this is not the case. In fact, product ciphers using the same boundaries can be isomorphically reduced to substitution ciphers. These product block ciphers are characterized by block definitions having the same defined block sizes. This also means that such product ciphers can be attacked using the same methodology as can be applied to all substitution (S) ciphers. We show that Permutation-Substitution-Permutation (PSP) ciphers are insignificantly more secure than a substitution cipher and propose a chosen plaintext attack for solving these product ciphers.
更多
查看译文
关键词
Cryptography,Set Theory,Polymorphic En-cryption,Ciphers,Shannon Theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要