An Introduction to Post-Quantum Cryptography Algorithms
By Christos Kasparis, EnSilica
EETimes (May 15, 2024)
The rise of quantum computing paints a significant challenge for the cryptography we rely on today. The modern encryption standards we currently use to safeguard sensitive data and communications, such as DSA, public key RSA and those based on elliptic curves, will eventually be broken by quantum computers. Estimates vary on when, but at current rates of improvement, this is predicted by some to happen towards the end of the next decade.
Michele Mosca, co-founder of the Institute for Quantum Computing at Canada’s University of Waterloo, has estimated that there is a 50% chance of a quantum computer powerful enough to break standard public-key encryption materializing in the next 15 years. This means many embedded systems in development now stand a reasonable chance of encountering such an attack by the end of their production run’s working lives. It has also been posited that sensitive data can be stored today and decrypted once quantum computers become powerful enough.
![]() |
E-mail This Article | ![]() |
![]() |
Printer-Friendly Page |
|
EnSilica Ltd. Hot IP
Related Articles
- Intrinsic ID PUFs: An Antidote to Post-Quantum Uncertainty
- An Introduction to Direct RF Sampling in a World Evolving Towards Chiplets - Part 1
- Select the Right Microcontroller IP for Your High-Integrity SoCs
- ASICs Bring Back Control to Supply Chains
- Performance Evaluation of machine learning algorithms for cyber threat analysis SDN dataset
New Articles
- Proven solutions for converting a chip specification into RTL and UVM
- Revolutionizing Chip Design with AI-Driven EDA
- Optimizing Automated Test Equipment for Quality and Complexity
- An Introduction to Direct RF Sampling in a World Evolving Towards Chiplets - Part 1
- How to cost-efficiently add Ethernet switching to industrial devices