Cryptoanalysis of asymmetrical schemes
The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are
- RSA and the problem of factorization
- DSA and the discrete logarithm problem
- Merkel-Hellman and the knapsack and grid problem
- McEliece and the problem of decoding
- Matsumoto-Imai and the multivariate Polynomial System
Knowledge in the areas of IT security and cryptography is obligatory.