A multivariate quadratic challenge toward post-quantum generation cryptography

Takanori Yasuda, Xavier Dahan, Yun Ju Huang, Tsuyoshi Takagi, Kouichi Sakurai

研究成果: ジャーナルへの寄稿学術誌査読

5 被引用数 (Scopus)


Multivariate polynomials over finite fields have found applications in Public Key Cryptography (PKC) where the hardness to find solutions provides the "one-way function" indispensable to such cryptosystems. Several schemes for both encryption and signature have been proposed, many of which are using quadratic (degree 2) polynomials. Finding a solution to such systems in general is called MQ problem, which easiest "generic" instances are NP-hard. An important feature of this Multivariate Pubic Key Cryptography (MPKC) is the resistance to quantum computers: no faster quantum algorithm than classical ones to solve MQ problem is known. Besides being thereby a candidate for Post-Quantum Cryptography, signatures are much shorter than to other candidates. We have established an open public "MQ Challenge" (https://www.mqchallenge.org) to stimulate progress in the design of efficient algorithms to solve MQ problem, and thus test limit parameters guaranteeing security of MPKC.

ジャーナルACM Communications in Computer Algebra
出版ステータス出版済み - 9月 2015

!!!All Science Journal Classification (ASJC) codes

  • 計算理論と計算数学
  • 計算数学


「A multivariate quadratic challenge toward post-quantum generation cryptography」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。