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

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

Research output: Contribution to journalArticle

1 Citation (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(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.

Original languageEnglish
Pages (from-to)2607-2614
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE91-A
Issue number9
DOIs
Publication statusPublished - 2008 Sep 1

Fingerprint

Small Function
Compression Function
Output
Random Oracle
Block Cipher
Collision
Design
Model

Keywords

  • Hash function
  • Ideal cipher model
  • Random oracle

ASJC Scopus subject areas

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

Cite this

Compression function design principles supporting variable output lengths from a single small function. / Chang, Donghoon; Nandi, Mridul; Lee, Jesang; Sung, Jaechul; Hong, Seokhie; Lim, Jong In; Park, Haeryong; Chun, Kilsoo.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E91-A, No. 9, 01.09.2008, p. 2607-2614.

Research output: Contribution to journalArticle

@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 Lim, {Jong In} and Haeryong Park and Kilsoo Chun",
year = "2008",
month = "9",
day = "1",
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, Jong In

AU - Park, Haeryong

AU - Chun, Kilsoo

PY - 2008/9/1

Y1 - 2008/9/1

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

UR - http://www.scopus.com/inward/citedby.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

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

SN - 0916-8508

IS - 9

ER -