This lesson is part of the course, but it hasn't been created yet. Create it to start learning.
Create lessonNBack to chapterEscPowerful quantum computers could solve certain mathematical problems far faster than today’s machines. That would threaten widely used systems such as RSA and elliptic-curve cryptography, though not every form of encryption would fail. This selective threat is why cryptographers are redesigning public-key security rather than discarding all existing cryptography.