Seminar
Security Evaluation of PublicKey Cryptography

Hold Date 
20160112 12:00～20160112 13:00 


Place 
Lecture Room M W1C512, West Zone 1, Ito campus, Kyushu University 


Object person 



Speaker 
Tsuyoshi Takagi (Institute of Mathematics for Industry, Kyushu University) 

Abstract:
The security of publickey cryptography is based on the hardness of some mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP). However, some efficient algorithms for solving the problems have been developed in 80's such as number field sieve and elliptic curve method. In 1994, Shor proposed a quantum polynomial time algorithm for solving the IFP and DLP, and thus the widely used publickey cryptography (RSA cryptosystem and elliptic curve cryptography) become vulnerable eventually. In this talk, we give an overview of the recent research on the postquantum cryptography (PQC), which is still secure in the era of quantum computer. Interestingly, PQC is constructed by some new mathematical problems such as the shortest vector problem over lattices, the problem of solving multivariate polynomial system, the isogney problem of elliptic curve cryptography.