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.
To read the full article, click here
Related Semiconductor IP
- Tensilica ConnX 120 DSP
- Tensilica DSP IP supports efficient AI/ML processing
- Tensilica Vision P1 DSP
- Tensilica Vision P6 DSP
- Tensilica Vision Q8 DSP
Related Articles
- Time Sensitive Networking: An Introduction to TSN
- Intrinsic ID PUFs: An Antidote to Post-Quantum Uncertainty
- An Introduction to Direct RF Sampling in a World Evolving Towards Chiplets - Part 1
- MIPI™ MPHY - An introduction
Latest Articles
- Enabling RISC-V Vector Code Generation in MLIR through Custom xDSL Lowerings
- A Scalable Open-Source QEC System with Sub-Microsecond Decoding-Feedback Latency
- SNAP-V: A RISC-V SoC with Configurable Neuromorphic Acceleration for Small-Scale Spiking Neural Networks
- An FPGA Implementation of Displacement Vector Search for Intra Pattern Copy in JPEG XS
- A Persistent-State Dataflow Accelerator for Memory-Bound Linear Attention Decode on FPGA