arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.3617cs.FL
收藏

信息安全中的词组合学:迭代哈希函数上的多重冲突攻击构造中的不确定性

Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions

Juha Kortelainen

摘要:

在经典的组合数学中,人们研究的是在固定大小的字母表上出现在足够长的符号串中的不可避免的符号。本文从另一个角度出发,研究了符号出现次数受固定常数限制的长词的组合性质。然后,我们证明了这些属性的连接,以构建所谓的广义迭代哈希函数的多冲突攻击。

英文摘要:

Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet. In this paper we take another viewpoint and focus on combinatorial properties of long words in which the number of occurrences of any symbol is restritced by a fixed constant. We then demonstrate the connection of these properties to constructing multicollision attacks on so called generalized iterated hash functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑