A Simple Variant of the Merkle-Damg°ard Scheme with a Permutation

Material type: 文書・図像類

Author: HIROSE, Shoichiほか

Publisher: Springer Verlag

Publication date: 2007-12

Material Format: Digital

Capacity, size, etc.: -

NDC: -

View All

Notes on use

Note (General)：: We propose a new composition scheme for hash functions. It is a variant of the Merkle-Damg°ard construction with a permutation applied right before th...

Related materials as well as pre- and post-revision versions

The original publication is available at www.springerlink.com

Search by Bookstore

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

Ｕｎｉｖｅｒｓｉｔｙ　ｏｆ　Ｆｕｋｕｉ　Ａｃａｄｅｍｉｃ　Ｒｅｐｏｓｉｔｏｒｙ
Digital
You can check the holdings of institutions and databases with which Institutional Repositories DataBase(IRDB)(Institutional Repository) is linked at the site of Institutional Repositories DataBase(IRDB)(Institutional Repository).
Ｕｎｉｖｅｒｓｉｔｙ　ｏｆ　Ｆｕｋｕｉ　Ａｃａｄｅｍｉｃ　Ｒｅｐｏｓｉｔｏｒｙ

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type: 文書・図像類
Title: A Simple Variant of the Merkle-Damg°ard Scheme with a Permutation
Author/Editor: HIROSE, Shoichi
PARK, Je Hong
YUN, Aaram
Author Heading: HIROSE, Shoichi
PARK, Je Hong
YUN, Aaram
Publication, Distribution, etc.: Springer Verlag
Publication Date: 2007-12
Publication Date (W3CDTF): 2007-12
Periodical title: Advances in Cryptology–ASIACRYPT 2007
No. or year of volume/issue: 4833
Volume: 4833
Pages: 113-129
Text Language Code: eng
Target Audience: 一般
Note (General): We propose a new composition scheme for hash functions. It is a variant of the Merkle-Damg°ard construction with a permutation applied right before the processing of the last message block. We analyze the security of this scheme using the indifferentiability formalism, which was first adopted by Coron et al. to the analysis of hash functions. And we study the security of simple MAC constructions out of this scheme. Finally, we also discuss the random oracle indifferentiability of this scheme with a double-block-length compression function or the Davies-Meyer compression function composed of a block cipher.
Access Restrictions: 限定公開
Related Material: The original publication is available at www.springerlink.com
Related Material (DOI): 10.1007/978-3-540-76900-2
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 福井大学 : 福井大学学術機関リポジトリ