WEKO3
アイテム
Upper bounding the quantum space complexity for computing class group and principal ideal problem
https://ipsj.ixsq.nii.ac.jp/records/235051
https://ipsj.ixsq.nii.ac.jp/records/235051b2b06da5-c46f-4500-a147-4ce14bb2a7a8
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-QS24012004.pdf (1.0 MB)
2026年6月20日からダウンロード可能です。
|
Copyright (c) 2024 by the Information Processing Society of Japan
|
|
| 非会員：¥660, IPSJ:学会員：¥330, QS:会員：¥0, DLIB:会員：¥0 | ||
| Item type | SIG Technical Reports(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2024-06-20 | |||||||
| タイトル | ||||||||
| タイトル | Upper bounding the quantum space complexity for computing class group and principal ideal problem | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Upper bounding the quantum space complexity for computing class group and principal ideal problem | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
| 資源タイプ | technical report | |||||||
| 著者所属 | ||||||||
| Graduate School of Mathematics, Nagoya University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Mathematics, Nagoya University | ||||||||
| 著者名 |
Iu-Iong, Ng
× Iu-Iong, Ng
|
|||||||
| 著者名(英) |
Iu-Iong, Ng
× Iu-Iong, Ng
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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). | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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). | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA12894105 | |||||||
| 書誌情報 |
研究報告量子ソフトウェア（QS） 巻 2024-QS-12, 号 4, p. 1-5, 発行日 2024-06-20 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 2435-6492 | |||||||
| Notice | ||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
