|
18 Kasım 2015, 15:45 
Atılım Üniversitesi Matematik Bölümü SeminerleriClassification of some mathematical problems used in cryptography Murat Cenk
The problems of integer factorization, discrete logarithm and primality are three
fundamental problems used in cryptography. In this talk, the classification of these
problems in complexity theory is introduced, and then how very large primes are generated
efficiently for cryptographic purposes is discussed.
Şifreleme ve Bilgi Güvenliği İngilizce FEF 404 - Seminar Room admin 20.03.2020 |
