WEKO3
アイテム
{"_buckets": {"deposit": "3a765f60-e53c-435a-881e-f818424f3d20"}, "_deposit": {"created_by": 1, "id": "22931", "owners": [1], "pid": {"revision_id": 0, "type": "depid", "value": "22931"}, "status": "published"}, "_oai": {"id": "oai:u-fukui.repo.nii.ac.jp:00022931", "sets": ["2404"]}, "author_link": ["66877"], "item_10001_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2006", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "225", "bibliographicPageStart": "210", "bibliographicVolumeNumber": "4047", "bibliographic_titles": [{"bibliographic_title": "Lecture Notes in Computer Science"}]}]}, "item_10001_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collision-resistant hash functions: Any collision-finding attack on them is at most as efficient as the birthday attack in the random oracle model or in the ideal cipher model. A new security notion is also introduced, which we call indistinguishability in the iteration, with a construction satisfying the notion.", "subitem_description_type": "Abstract"}]}, "item_10001_publisher_8": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Springer"}]}, "item_10001_relation_11": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "TD00007169", "subitem_relation_type_select": "NCID"}}]}, "item_10001_relation_14": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1007/11799313_14", "subitem_relation_type_select": "DOI"}}]}, "item_10001_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "3029743", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_version_type_20": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_b1a7d7d4d402bcce", "subitem_version_type": "AO"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "HIROSE, Shoichi"}], "nameIdentifiers": [{"nameIdentifier": "66877", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-08-04"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "s-hirose.pdf", "filesize": [{"value": "196.3 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 196300.0, "url": {"label": "s-hirose.pdf", "url": "https://u-fukui.repo.nii.ac.jp/record/22931/files/s-hirose.pdf"}, "version_id": "28c4d1f6-d67a-4fd5-8e69-755bea25f672"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "other", "resourceuri": "http://purl.org/coar/resource_type/c_1843"}]}, "item_title": "Some Plausible Constructions of Double-Block-Length Hash Functions", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Some Plausible Constructions of Double-Block-Length Hash Functions"}]}, "item_type_id": "10001", "owner": "1", "path": ["2404"], "permalink_uri": "http://hdl.handle.net/10098/1779", "pubdate": {"attribute_name": "公開日", "attribute_value": "2008-11-25"}, "publish_date": "2008-11-25", "publish_status": "0", "recid": "22931", "relation": {}, "relation_version_is_last": true, "title": ["Some Plausible Constructions of Double-Block-Length Hash Functions"], "weko_shared_id": -1}
Some Plausible Constructions of Double-Block-Length Hash Functions
http://hdl.handle.net/10098/1779
http://hdl.handle.net/10098/17794762e525-2d1a-4482-945c-5a91c32043d6
名前 / ファイル | ライセンス | アクション |
---|---|---|
s-hirose.pdf (196.3 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-11-25 | |||||
タイトル | ||||||
タイトル | Some Plausible Constructions of Double-Block-Length Hash Functions | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_1843 | |||||
資源タイプ | other | |||||
著者 |
HIROSE, Shoichi
× HIROSE, Shoichi |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collision-resistant hash functions: Any collision-finding attack on them is at most as efficient as the birthday attack in the random oracle model or in the ideal cipher model. A new security notion is also introduced, which we call indistinguishability in the iteration, with a construction satisfying the notion. | |||||
書誌情報 |
Lecture Notes in Computer Science 巻 4047, p. 210-225, 発行日 2006 |
|||||
出版者 | ||||||
出版者 | Springer | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 3029743 | |||||
書誌レコードID | ||||||
識別子タイプ | NCID | |||||
関連識別子 | TD00007169 | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1007/11799313_14 | |||||
著者版フラグ | ||||||
出版タイプ | AO | |||||
出版タイプResource | http://purl.org/coar/version/c_b1a7d7d4d402bcce |