About
As quantum computers advance, they pose a significant threat to our current cryptographic infrastructure, particularly RSA encryption. This presentation will explore how RSA can be broken using Shor's algorithm and examine the landscape of post-quantum encryption algorithms.
## Presentation Overview
### Introduction to RSA and Its Importance in Modern Cryptography
- Brief history of RSA - Current widespread use in secure online transactions and communications
### The Quantum Threat: Shor's Algorithm and Its Impact on RSA
- Explanation of Shor's algorithm - How quantum computers can factor large numbers exponentially faster than classical computers - Implications for RSA security
### Post-Quantum Cryptography: An Overview
- Introduction to post-quantum cryptographic algorithms - Types of post-quantum cryptography (lattice-based, code-based, multivariate polynomial, hash-based signatures)
### Standardization Efforts: NIST's Post-Quantum Cryptography Project
- Overview of NIST's standardization process - Selected algorithms (CRYSTALS-Dilithium, FALCON, SPHINCS+, CRYSTALS-Kyber) - Challenges in standardization and implementation
### Implementation Considerations for Post-Quantum Algorithms
- Integration into existing cryptographic libraries - Performance comparisons with classical algorithms - Security analysis and known vulnerabilities
The talk
Credits and licence
- Institution
- CERN
- Department
- Inverted CSC
- Speaker
- Vasvi Sharma
- Year
- 2025
- Language
- English
- Subjects
- Computer science
- Source
- CERN
- Licence
- CERN, as CERN states it. CERN's terms
- Attribution
- © CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
- Who can watch
- CERN gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed