Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).
NIST Authors in Bold
|Author(s):||Dong H. Chang; Morris J. Dworkin; Seokhie Hong; John M. Kelsey; Mridul Nandi;|
|Title:||A Keyed Sponge Construction with Pseudorandomness in the Standard Model|
|Published:||March 22, 2012|
|Abstract:||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.|
|Conference:||The Third SHA-3 Candidate Conference|
|Dates:||March 22-23, 2012|
|Keywords:||indifferentiability, pseudorandomness, sponge construction|
|Research Areas:||Computer Security|
|PDF version:||Click here to retrieve PDF version of paper (521KB)|