Security of permutation-based compression function lp231lp231

In this paper, we study security of a certain class of permutation-based compression functions. Denoted by lp231lp231 in [10], they are 2n -to-n -bit compression functions using three calls to a single n -bit random permutation. We prove that lp231lp231 is asymptotically preimage resistant up to 22n...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2014-07, Vol.114 (7), p.372-381
Main Authors: Lee, Jooyoung, Kwon, Daesung
Format: Article
Language:English
Subjects:
Asymptotic properties
Complexity
Compressing
Computer information security
Data processing
Optimization
Permutations
Query processing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study security of a certain class of permutation-based compression functions. Denoted by lp231lp231 in [10], they are 2n -to-n -bit compression functions using three calls to a single n -bit random permutation. We prove that lp231lp231 is asymptotically preimage resistant up to 22n3/n query complexity and collision resistant up to 2n2/n1+[Greek Lunate Epsilon] query complexity for any [Greek Lunate Epsilon]>0[Greek Lunate Epsilon]>0. Based on a single permutation, lp231lp231 provides both efficiency and almost optimal collision security.
ISSN:0020-0190
DOI:10.1016/j.ipl.2014.02.008