{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235051","sets":["1164:10193:11470:11670"]},"path":["11670"],"owner":"44499","recid":"235051","title":["Upper bounding the quantum space complexity for computing class group and principal ideal problem"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-06-20"},"_buckets":{"deposit":"ac3f13ef-be8e-48a3-bc63-c602182d7a25"},"_deposit":{"id":"235051","pid":{"type":"depid","value":"235051","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Upper bounding the quantum space complexity for computing class group and principal ideal problem","author_link":["641719","641720"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Upper bounding the quantum space complexity for computing class group and principal ideal problem"},{"subitem_title":"Upper bounding the quantum space complexity for computing class group and principal ideal problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-06-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Mathematics, Nagoya University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Mathematics, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/235051/files/IPSJ-QS24012004.pdf","label":"IPSJ-QS24012004.pdf"},"date":[{"dateType":"Available","dateValue":"2026-06-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS24012004.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"53"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2d6d43a7-c158-46e6-b5cf-41bbc644618e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Iu-Iong, Ng"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Iu-Iong, Ng","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12894105","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2435-6492","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In this paper, we calculate the upper bound on quantum space complexity of the quantum algorithms proposed by Biasse and Song (SODA'16) for solving class group computation and the principal ideal problem using the reductions to S-unit group computation. We follow the approach of Barbulescu and Poulalion (AFRICACRYPT'23) and the framework given by de Boer, Ducas, and Fehr (EUROCRYPT'20) and Eisentrger, Hallgren, Kitaev, and Song (STOC'14).","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we calculate the upper bound on quantum space complexity of the quantum algorithms proposed by Biasse and Song (SODA'16) for solving class group computation and the principal ideal problem using the reductions to S-unit group computation. We follow the approach of Barbulescu and Poulalion (AFRICACRYPT'23) and the framework given by de Boer, Ducas, and Fehr (EUROCRYPT'20) and Eisentrger, Hallgren, Kitaev, and Song (STOC'14).","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-06-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"2024-QS-12"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":235051,"updated":"2025-01-19T09:37:28.539348+00:00","links":{},"created":"2025-01-19T01:37:02.199491+00:00"}