Item type |
Symposium(1) |
公開日 |
2020-10-19 |
タイトル |
|
|
タイトル |
On the Weil Descent Attack against the Multivariate Quadratic Problem |
タイトル |
|
|
言語 |
en |
|
タイトル |
On the Weil Descent Attack against the Multivariate Quadratic Problem |
言語 |
|
|
言語 |
eng |
キーワード |
|
|
主題Scheme |
Other |
|
主題 |
Weil Descent,MQ problem,Degree of Regularity |
資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_5794 |
|
資源タイプ |
conference paper |
著者所属 |
|
|
|
Department of Mathematical Informatics, University of Tokyo |
著者所属 |
|
|
|
Department of Mathematical Informatics, University of Tokyo |
著者所属(英) |
|
|
|
en |
|
|
Department of Mathematical Informatics, University of Tokyo |
著者所属(英) |
|
|
|
en |
|
|
Department of Mathematical Informatics, University of Tokyo |
著者名 |
Yacheng, Wang
Tsuyoshi, Takagi
|
著者名(英) |
Yacheng, Wang
Tsuyoshi, Takagi
|
論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Among candidates for post-quantum cryptography, multivariate cryptography is known for constructing good signature schemes with short signature length. Its security depents on the hardness of solving a set of multivariate polynomials that are used as public key in a multivariate cryptographic scheme, which is often refered to as multivariate quadratic problem (MQ problem).<br>In this paper, we investigate a method for solving the MQ problem, which first transforms a set of multivariate polynomials over a finite field into a new set of multivariate polynomials over its subfield, and then solve it by using algebraic tools like XL or Groebner bases. The complexity of this method is derived by analysing non-trivial syzygies and the behavior in the XL algorithm. |
書誌情報 |
コンピュータセキュリティシンポジウム2020論文集
p. 338-345,
発行日 2020-10-19
|
出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |