A Keyed Sponge Construction with Pseudorandomness in the Standard Model
Donghoon Chang, Morris Dworkin, Seokhie Hong, John M. Kelsey, Mridul Nandi
The sponge construction, designed by Bertoni, Daemen, Peeters, and Asscheis, is the framework for hash functions such as Keccak, PHOTON, Quark, and spongent. The designers give a keyed sponge construction by prepending the message with key and prove a bound on its pseudorandomness in the ideal permutation model . In this paper we give a different keyed sponge construction that is based on the Even-Mansour permutation and prove its pseudorandomness in the standard model.
, Dworkin, M.
, Hong, S.
, Kelsey, J.
and Nandi, M.
A Keyed Sponge Construction with Pseudorandomness in the Standard Model, N/A, Washington, DC, US, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=910823
(Accessed December 1, 2023)