本文へジャンプ

  • HOME
  • 講演会情報

講演会情報

The Mersenne Cryptosystem
講演者:Antoine Joux(フランス・ソルボンヌ大学(旧UPMC))
平成30年4月18日(水)13時30分〜15時30分 理学部7号館地下007講義室
Modern public-key cryptography is mostly based on the hardness of Factoring and computing discrete logarithms. However, due to Shor’s algorithm, large scale Quantum computer if and when they become available would put these systems at risk, with the danger of compromising the security of all computer applications. In this talk, we present one of the numerous candidates systems to address this threat. It is mainly based on the hardness of recognizing integral numbers of the form f*(g^(-1)) mod P where P is a large Mersenne prime and f, g two integers with low Hamming weight in their binary decomposition.