2024-07-20 –, Track 2
In this talk we provide a brief introduction to common cryptographic algorithms and weaknesses within their implementation. We show how quantum computing trivializes the exploitation of these weaknesses and how modern quantum resistant cryptographic algorithms seek to overcome these issues.
This talk covers the RSA and Elliptic curve cryptographic algorithms, their implementation and where they are used. Then we discuss common weakness that may occur during the implementation phase of these algorithms.
We present the basics of quantum computing and why it posses a risk to current asymmetric cryptographic keys. Shor's prime factorization algorithm will be explained with relevant examples to illustrate the factorization process. Then using Quantum Fourier Transforms we will show how quantum principles are used to reliably factorize large primes.
We conclude the talk with an overview of quantum resistant cryptographic algorithms and how quantum cryptography can be used to encrypt data in the future.
I have been a cyber security researcher for over 15 years. Mostly working with the CSIR and SANDF. For the last few years I have been working for BlueVision ITM as the head of Research, Development and Innovation. This has allowed me to build cyber security challenges for universities and to get involved with cyber security conferences such as BSides and 0xCon.
Sa'ad Kari, a Mathematician with a Bachelor's Degree in Physics & Mathematics, a Honours Degree in Mathematics and professional experience working as a cryptography developer. He is currently pursuing his Masters Degree with a strong focus on quantum-resistant cryptography.
TBD