Security of Single-permutation-based Compression Functions
by
Jooyoung Lee
,
Daesung Kwon
| Citations: | 1 - 1 self |
BibTeX
@MISC{Lee_securityof,
author = {Jooyoung Lee and Daesung Kwon},
title = {Security of Single-permutation-based Compression Functions},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In this paper, we study security for a certain class of permutation-based compression functions. Denoted lp231 in [12], they are 2n-bit to n-bit compression functions using three calls to a single n-bit random permutation. We prove that lp231 is asymptotically preimage resistant up to (2 2n 3 /n) queries, adaptive preimage resistant up to (2 n 2 /n) queries/commitments, and collision resistant up to (2 n 2 /n 1+ɛ) queries for ɛ> 0. 1
