The Implications Between C-SPR and CRn (n,n) Visited
The compression function is wildly used via many kinds of iterations in the construction of the modern hash function intended for use with standard digital signatures following the hash-and-sign mode.Some variants of secondpreimage resistance(SPR)1 assumptions of the keyless compression function,called c-SPR,r-SPR and e-SPR,have been put forth by Halevi and Krawczyk2,in order to obtain higher security properties for the dedicated-key hash function by iteration.In this paper,we compare one variant,called c-SPR,with CRn (n,n) which has been raised by Mironov3.We give several different schemes of the dedicated-key compression functions firstly,the relations between c-SPR and CRn (n,n) differ in different schemes.In the second part of this paper,we provide a full picture of the relations between c-SPR and CRn (n,n),and give the additional restrictions that ensure c-SPR of the keyless compression function to be the necessary or sufficient conditions of CRn (n,n) of the dedicated-key compression function separately.
c-SPR CRn (n,n) commpression function hash function demain extension
Lingyun Li Junqing Li Shengxian Xie Huishan Yu
School of Computer Science Liaocheng University Liaocheng, China
国际会议
2012 IEEE 14th International Conference on Communication Technology(2012年第十四届通信技术国际会议(ICCT 2012))
成都
英文
891-895
2012-11-09（万方平台首次上网日期，不代表论文的发表时间）