Title | Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations |

Publication Type | Journal Article |

Year of Publication | 2024 |

Authors | Carolan, J, Poremba, A |

Journal | To appear in the proceedings of CRYPTO 2024 |

Date Published | 3/7/2024 |

Abstract | Sponge hashing is a novel class of cryptographic hash algorithms which underlies the current international hash function standard SHA-3. In a nutshell, a sponge function takes as input a bit-stream of any length and processes it via a simple iterative procedure: it repeatedly feeds each block of the input into a so-called block function, and then produces a short digest which consists of a subset of the final output bits. While much is known about the post-quantum security of the sponge construction in the case when the block function is modeled as a random function or permutation, the case of invertible permutations, which more accurately models the construction underlying SHA-3, has so far remained a fundamental open problem. |

URL | https://arxiv.org/abs/2403.04740 |

DOI | 10.48550/arXiv.2403.04740 |