Chang, D.
, Dworkin, M.
, Hong, S.
, Kelsey, J.
and Nandi, M.
(2012),
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 April 16, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
A Keyed Sponge Construction with Pseudorandomness in the Standard Model
Published
Author(s)
, , Seokhie Hong, , Mridul Nandi
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.Proceedings Title
N/A
Conference Dates
March 22-23, 2012
Conference Location
Washington, DC, US
Conference Title
The Third SHA-3 Candidate Conference
Pub Type
Conferences
Download Paper
Keywords
indifferentiability, pseudorandomness, sponge construction
Citation
Created March 21, 2012, Updated October 12, 2021