Security of permutation-based compression function Ip231

Security of permutation-based compression function Ip231

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2014-07, Vol.114 (7), p.372
Hauptverfasser: Lee, Jooyoung, Kwon, Daesung
Format: Artikel
Sprache:eng
Schlagworte:
Asymptotic methods
Combinatorics
Mathematical functions
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study security of a certain class of permutation-based compression functions. Denoted by ... in, they are 2n-to-n-bit compression functions using three calls to a single n-bit random permutation. We prove that ... is asymptotically preimage resistant up to ... query complexity and collision resistant up to ... query complexity for any ... Based on a single permutation, ... provides both efficiency and almost optimal collision security. (ProQuest: ... denotes formulae/symbols omitted.)
ISSN:0020-0190
1872-6119