作者: Léo Perrin , Dmitry Khovratovich
DOI: 10.1007/978-3-662-46706-0_5
关键词:
摘要: In this paper, we investigate the properties of iterative non-injective functions and security primitives where they are used. First, introduce Collision Probability Spectrum (cps) parameter to quantify how far from a permutation function is. particular, show that output size decreases linearly with number iterations whereas collision trees grow quadratically.