Compression function design principles supporting variable output lengths from a single small function
- Authors
- Chang, Donghoon; Nandi, Mridul; Lee, Jesang; Sung, Jaechul; Hong, Seokhie; Lim, Jongin; Park, Haeryong; Chun, Kilsoo
- Issue Date
- Sep-2008
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- hash function; random oracle; ideal cipher model
- Citation
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E91A, no.9, pp.2607 - 2614
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- Volume
- E91A
- Number
- 9
- Start Page
- 2607
- End Page
- 2614
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/122836
- DOI
- 10.1093/ietfec/e91-a.9.2607
- ISSN
- 1745-1337
- 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 the perspective of collision resistance are O(t(2)q/2(tn) + q(2)/2((r + 1)n)). In the case of t = 1, the advantage is near-optimal. In the case of t > 1, the advantage is optimal.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholar.korea.ac.kr/handle/2021.sw.korea/122836)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.