Provably Secure Double-Block-Length Hash Functions in a Black-Box Model

Material type: 文書・図像類

Author: HIROSE, Shoichi

Publisher: Springer Verlag

Publication date: 2004-12

Material Format: Digital

Capacity, size, etc.: -

NDC: -

View All

Notes on use

Note (General)：: In CRYPTO'89, Merkle presented three double-block-length hash functions based on DES. They are optimally collision resistant in a black-box model, tha...

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 学術機関リポジトリデータベース（IRDB）（機関リポジトリ） is linked at the site of 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）.
Ｕｎｉｖｅｒｓｉｔｙ　ｏｆ　Ｆｕｋｕｉ　Ａｃａｄｅｍｉｃ　Ｒｅｐｏｓｉｔｏｒｙ

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: Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
Author/Editor: HIROSE, Shoichi
Author Heading: HIROSE, Shoichi
Publication, Distribution, etc.: Springer Verlag
Publication Date: 2004-12
Publication Date (W3CDTF): 2004-12
Periodical title: Information Security and Cryptology-ICISC 2004
No. or year of volume/issue: 3506
Volume: 3506
Pages: 330-342
Text Language Code: eng
Subject Heading: double-block-length hash function
black-box model
block cipher
Target Audience: 一般
Note (General): In CRYPTO'89, Merkle presented three double-block-length hash functions based on DES. They are optimally collision resistant in a black-box model, that is, the time complexity of any collision-finding algorithm for them is Ω(2^<l/2>) if DES is a random block cipher, where l is the output length. Their drawback is that their rates are low. In this article, new double-block-length hash functions with higher rates are presented which are also optimally collision resistant in the blackbox model. They are composed of block ciphers whose key length is twice larger than their block length.
Source: https://u-fukui.repo.nii.ac.jp/?action=repository_action_common_download&item_id=22267&item_no=1&attribute_id=22&file_no=1
https://u-fukui.repo.nii.ac.jp/?action=repository_action_common_download&item_id=22267&item_no=1&attribute_id=22&file_no=1
Access Restrictions: 限定公開
Related Material: The original publication is available at www.springerlink.com
Related Material (DOI): 10.1007/b137120
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 福井大学 : 福井大学学術機関リポジトリ