2019. 03. 01. 10:00 - 2019. 03. 01. 12:00
Szeged, Bolyai Intézet, Bolyai Épület, I. emelet, Riesz terem, Aradi Vértanúk tere 1.
-
-
-
-
Esemény típusa: szeminárium
Szervezés: Külsős
-
-

Leírás

University of Szeged, Bolyai Institute, Combinatorics Seminar

Abstract. RSA is the most widely used symmetric key cryptosystem nowadays. Combining with a hash function, it is also easy to use it for digital signatures. Its security is based on the hardness of the integer factorization problem and it will be broken in the existence of quantum computers using Shor algorithm. The security of code-based cryptosystem (McEliece, Niederreiter) is based on the NP-completeness of the decoding problem of binary linear error correcting codes. In this talk we will present a digital signature scheme which uses code-based cryptosystem, hence a good candidate for the post-quantum era.