{"_buckets": {"deposit": "abe74208-72d2-4ed9-a77b-7fe58d244417"}, "_deposit": {"id": "12035", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "12035"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00012035"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2009-08", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "8", "bibliographicPageEnd": "648", "bibliographicPageStart": "644", "bibliographicVolumeNumber": "56", "bibliographic_titles": [{"bibliographic_title": "IEEE Transactions on Circuits and Systems II: Express Briefs"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "We propose a fast hardware algorithm for division in GF(2m) based on the extended Euclid\u0027s algorithm. The algorithm requires only one iteration to perform the operations that correspond to the ones performed in two iterations of previously reported division algorithms. Since the algorithm performs modular reductions in parallel by changing the order of execution of the operations, a circuit based on this algorithm has almost the same critical path delay as the previously proposed ones. The circuit computes division in m clock cycles, whereas the previously proposed circuits take 2m - 1 or more clock cycles.", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/13911"}, {"subitem_identifier_type": "DOI", "subitem_identifier_uri": "http://dx.doi.org/10.1109/TCSII.2009.2024253"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "IEEE"}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "\u00a92009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE."}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1549-7747", "subitem_source_identifier_type": "ISSN"}]}, "item_10_text_14": {"attribute_name": "\u30d5\u30a9\u30fc\u30de\u30c3\u30c8", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Kobayashi, Katsuki"}], "nameIdentifiers": [{"nameIdentifier": "38165", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Takagi, Naofumi"}], "nameIdentifiers": [{"nameIdentifier": "38166", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "takagi.pdf", "filesize": [{"value": "229.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 229900.0, "url": {"label": "takagi.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/12035/files/takagi.pdf"}, "version_id": "d3e8cd2b-4c24-449c-9a17-8b54cbb1fa50"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "attribute_value_mlt": [{"subitem_subject": "Division", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Euclid\u0027s algorithm", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Galois field", "subitem_subject_scheme": "Other"}, {"subitem_subject": "hardware algorithm", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Fast Hardware Algorithm for Division in GF(2m) Based on the Extended Euclid\u0027s Algorithm With Parallelization of Modular Reductions", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Fast Hardware Algorithm for Division in GF(2m) Based on the Extended Euclid\u0027s Algorithm With Parallelization of Modular Reductions"}]}, "item_type_id": "10", "owner": "1", "path": ["312/313/314"], "permalink_uri": "http://hdl.handle.net/2237/13911", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2010-08-02"}, "publish_date": "2010-08-02", "publish_status": "0", "recid": "12035", "relation": {}, "relation_version_is_last": true, "title": ["Fast Hardware Algorithm for Division in GF(2m) Based on the Extended Euclid\u0027s Algorithm With Parallelization of Modular Reductions"], "weko_shared_id": null}