首页|Reports Summarize Symmetric Cryptology Research from Radboud University (Permuta tion-Based Hashing Beyond the Birthday Bound)
Reports Summarize Symmetric Cryptology Research from Radboud University (Permuta tion-Based Hashing Beyond the Birthday Bound)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News Daily News – Investigators publish new report on sy mmetric cryptology. According to news reporting out of Nijmegen, Netherlands, by NewsRx editors, research stated, “It is known that the sponge construction is t ightly indifferentiable from a random oracle up to around 2c/2 queries, where c is the capacity.” Our news correspondents obtained a quote from the research from Radboud Universi ty: “In particular, it cannot provide generic security better than half of the u nderlying permutation size. In this paper, we aim to achieve hash function secur ity beating this barrier. We present a hashing mode based on two b-bit permutati ons named the double sponge. The double sponge can be seen as the sponge embedde d within the double block length hashing paradigm, making two permutation calls in parallel interleaved with an efficient mixing function. Similarly to the spon ge, the permutation size is split as b = r+c, and the underlying compression fun ction absorbs r bits at a time. We prove that the double sponge is indifferentia ble from a random oracle up to around 22c/3 queries.”
NETL
NSTL
