Compression function design principles supporting variable output lengths from a single small function

Donghoon Chang; Mridul Nandi; Jesang Lee; Jaechul Sung; Seokhie Hong; Jongin Lim; Haeryong Park; Kilsoo Chun

doi:10.1093/ietfec/e91-a.9.2607

Compression function design principles supporting variable output lengths from a single small function

Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul Sung, Seokhie Hong, Jongin Lim, Haeryong Park, Kilsoo Chun

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with an n-bit output size. In the case of the compression function with a (t + 1)n-bit output size, in the random oracle and ideal cipher models, their maximum advantages from 2 2 the perspective of collision resistance are 0(t²q/2^tn + q₂/2 ^(t+1)n). In the case of t = 1, the advantage is near-optimal. In the case of t > 1, the advantage is optimal.

Original language	English
Pages (from-to)	2607-2614
Number of pages	8
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E91-A
Issue number	9
DOIs	https://doi.org/10.1093/ietfec/e91-a.9.2607
Publication status	Published - 2008 Sept

Keywords

Hash function
Ideal cipher model
Random oracle

ASJC Scopus subject areas

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1093/ietfec/e91-a.9.2607

Cite this

@article{da0d9164141640fcb8eee499491dc631,

title = "Compression function design principles supporting variable output lengths from a single small function",

abstract = "In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with an n-bit output size. In the case of the compression function with a (t + 1)n-bit output size, in the random oracle and ideal cipher models, their maximum advantages from 2 2 the perspective of collision resistance are 0(t2q/2tn + q2/2 (t+1)n). In the case of t = 1, the advantage is near-optimal. In the case of t > 1, the advantage is optimal.",

keywords = "Hash function, Ideal cipher model, Random oracle",

author = "Donghoon Chang and Mridul Nandi and Jesang Lee and Jaechul Sung and Seokhie Hong and Jongin Lim and Haeryong Park and Kilsoo Chun",

year = "2008",

month = sep,

doi = "10.1093/ietfec/e91-a.9.2607",

language = "English",

volume = "E91-A",

pages = "2607--2614",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "9",

}

TY - JOUR

T1 - Compression function design principles supporting variable output lengths from a single small function

AU - Chang, Donghoon

AU - Nandi, Mridul

AU - Lee, Jesang

AU - Sung, Jaechul

AU - Hong, Seokhie

AU - Lim, Jongin

AU - Park, Haeryong

AU - Chun, Kilsoo

PY - 2008/9

Y1 - 2008/9

N2 - In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with an n-bit output size. In the case of the compression function with a (t + 1)n-bit output size, in the random oracle and ideal cipher models, their maximum advantages from 2 2 the perspective of collision resistance are 0(t2q/2tn + q2/2 (t+1)n). In the case of t = 1, the advantage is near-optimal. In the case of t > 1, the advantage is optimal.

AB - In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with an n-bit output size. In the case of the compression function with a (t + 1)n-bit output size, in the random oracle and ideal cipher models, their maximum advantages from 2 2 the perspective of collision resistance are 0(t2q/2tn + q2/2 (t+1)n). In the case of t = 1, the advantage is near-optimal. In the case of t > 1, the advantage is optimal.

KW - Hash function

KW - Ideal cipher model

KW - Random oracle

UR - http://www.scopus.com/inward/record.url?scp=77953378315&partnerID=8YFLogxK

U2 - 10.1093/ietfec/e91-a.9.2607

DO - 10.1093/ietfec/e91-a.9.2607

M3 - Article

AN - SCOPUS:77953378315

SN - 0916-8508

VL - E91-A

SP - 2607

EP - 2614

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 9

ER -

Compression function design principles supporting variable output lengths from a single small function

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this