Seminar Khoa Toán - Cơ - Tin học ngày 21/01/2016

Thời gian: 14h30, thứ 5, ngày 21/1/2016

Địa điểm: P304, T4, Khoa Toán-Cơ-Tin học, Trường ĐH Khoa học Tự nhiên Hà Nội, 334 Nguyễn Trãi, Thanh Xuân, HN.

Báo cáo viên: GS Olivier Ruatta

Tên báo cáo: Code-rank based cryptography

Tóm tắt báo cáo: Since Shor, we know that complexity of some classical problems arising from number theory (namely factorization and some discrete logarithms) is polynomial using a quantum computer. So, up to the realization of a quantum computer, some of the most used cryptosystems (RSA, ECC, …) can be broken in polynomial time. This leads security agencies to look for cryptosystems those are quantum resistant, i.e. for which we think that the underlying problem is still hard on a quantum computer. Several approaches are proposed : code-based, lattice-based or multivariate cryptography and a current call is running to normalize such systems. Here, we introduce a new public key system of the family of  code-based cryptosystems. This is a McEliece type cryptosystem but used with special codes: rank metric codes. We introduce rank metric codes and a new family of such codes: LRPC (low rank parity check codes). We discuss syndrome decoding problem those codes and present a cryptosystem of McEliece type based on this problem. We show that we can achieve high security with good parameters (reasonable size of the keys).