The iterated random function problem

DOI10.1007/978-3-319-70697-9_23MaRDI QIDQ1703944zbMATH OpenOpenAlexFDO

Authors Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Nicky Mouha, Mridul Nandi

Publication date 8 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70697-9_23

zbMATH Keywords

H-coefficient techniqueiterated random functionpassword hashingpatarinprovable securitypseudorandom functionrandom function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The iterated random permutation problem with applications to cascade encryption
• An asymptotically tight security analysis of the iterated Even-Mansour cipher
• The advantage of truncated permutations
• Indifferentiability of truncated random permutations
• On the streaming indistinguishability of a random permutation and a random function

Cited in

(9)

• The choice and agreement problems of a random function
• Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
• On the streaming indistinguishability of a random permutation and a random function
• Sieving random iterative function systems
• The iterated random permutation problem with applications to cascade encryption
• scientific article; zbMATH DE number 169737 (Why is no real title available?)
• Iterated random functions and regularly varying tails
• Random iteration with place dependent probabilities
• Forking sums of permutations for highly secure and efficient PRFs

This page was built for publication: The iterated random function problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703944)