{"created":"2021-03-01T06:10:20.658067+00:00","id":3867,"links":{},"metadata":{"_buckets":{"deposit":"ed81d052-16a3-4519-8cd6-0fb908519ded"},"_deposit":{"id":"3867","owners":[],"pid":{"revision_id":0,"type":"depid","value":"3867"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00003867"},"item_10_biblio_info_6":{"attribute_name":"\u66f8\u8a8c\u60c5\u5831","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2001-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicPageEnd":"398","bibliographicPageStart":"394","bibliographicVolumeNumber":"50","bibliographic_titles":[{"bibliographic_title":"IEEE Transactions on computers"}]}]},"item_10_description_4":{"attribute_name":"\u6284\u9332","attribute_value_mlt":[{"subitem_description":"A fast algorithm for multiplicative inversion in GF(2m) using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat's Theorem and require O(logm) multiplications. The number of multiplications is reduced by decomposing m y 1 into several factors and a small remainder.","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/5292"}]},"item_10_publisher_32":{"attribute_name":"\u51fa\u7248\u8005","attribute_value_mlt":[{"subitem_publisher":"IEEE"}]},"item_10_relation_11":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://doi.org/10.1109/12.926155","subitem_relation_type_select":"DOI"}}]},"item_10_rights_12":{"attribute_name":"\u6a29\u5229","attribute_value_mlt":[{"subitem_rights":"Copyright c 2005 IEEE. Reprinted from (relevant publication info). This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Nagoya University\u2019s products or services. Internal or 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 must be obtained from the IEEE by writing to pubs-permissions@ieee.org."}]},"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":"00189340","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":"\u9ad8\u6728, \u76f4\u53f2"}],"nameIdentifiers":[{"nameIdentifier":"9764","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Takagi, Naofumi"}],"nameIdentifiers":[{"nameIdentifier":"9765","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-19"}],"displaytype":"detail","filename":"00926155.pdf","filesize":[{"value":"195.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"00926155.pdf","url":"https://nagoya.repo.nii.ac.jp/record/3867/files/00926155.pdf"},"version_id":"512b8ea7-f25e-4ace-ad07-087d65a7e8f3"}]},"item_keyword":{"attribute_name":"\u30ad\u30fc\u30ef\u30fc\u30c9","attribute_value_mlt":[{"subitem_subject":"Finite field","subitem_subject_scheme":"Other"},{"subitem_subject":"finite field inversion","subitem_subject_scheme":"Other"},{"subitem_subject":"Fermat's theorem","subitem_subject_scheme":"Other"},{"subitem_subject":"normal basis","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":"A fast algorithm for multiplicative inversion in GF(2m) using normal basis","item_titles":{"attribute_name":"\u30bf\u30a4\u30c8\u30eb","attribute_value_mlt":[{"subitem_title":"A fast algorithm for multiplicative inversion in GF(2m) using normal basis"}]},"item_type_id":"10","owner":"1","path":["312/313/314"],"pubdate":{"attribute_name":"\u516c\u958b\u65e5","attribute_value":"2006-01-10"},"publish_date":"2006-01-10","publish_status":"0","recid":"3867","relation_version_is_last":true,"title":["A fast algorithm for multiplicative inversion in GF(2m) using normal basis"],"weko_creator_id":"1","weko_shared_id":3},"updated":"2021-03-01T13:21:33.598845+00:00"}