Version 1.0.3

lecture: Post-Quantum Crypto


The security of asymmetric crypto algorithms today like RSA and ECC is based on mathematical operations, that have no computable "reverse function" in classical mathematics. Shor (1994) has shown that both algorithms can be broken by using a quantum computer – and the development in this field has speed up during the last years commercial systems today work with 500 and more Q bits (although adiabatic and not as an ideal quantum computer). Therefore it is time to focus our attention on post-quantum cryptology that is not compromised by quantum computers. If we don't start today, we will probably not be ready if we really need the new algorithms…


Day: 2014-09-05
Start time: 15:00
Duration: 01:00
Room: Pupin

Language: en



Click here to let us know how you liked this event.

Concurrent events