In cybersecurity, “quantum security” is pivotal due to quantum computing’s potential to undermine encryption. This emerging field aims to develop quantum-resistant algorithms to protect digital communications against quantum threats. With quantum computers poised to break traditional cryptography, the urgency for quantum security innovations is paramount. This proactive approach, advocated by institutions like NIST, seeks to ensure a resilient cybersecurity infrastructure capable of withstanding the advanced computational power of quantum technology, thus safeguarding our digital future against potential breaches.
Quantum Computing Threats to Cybersecurity
The Yahoo data breach in 2013, where a reported three billion accounts were hacked, the Aadhaar case in 2018 and the Alibaba breach a year later, detail the turmoil that can occur in the digital realm when our guards are down, showcasing the ironies of users’ online vulnerabilities. For it is here, unfortunately, where personal data can be both priceless and worth less than a cup of coffee, and where companies pledge allegiance to privacy with one hand while leaving the back door wide open with the other.
These are just obvious examples of the countless times companies have been hacked, leading to concerns by cybersecurity experts about the potential impact that quantum computers could have on current cryptographic systems as well.
Theory Of Quantum Computing Decryption
These advanced computers operate on quantum physics principles, differing from conventional electronic systems. If fully developed, they might have the capability to decrypt widely used cryptographic methods, leaving digital communications as vulnerable as if they were not encrypted at all.
As of now, this issue remains theoretical. Existing quantum computers do not possess the ability to undermine the encryption techniques commonly deployed. Many in the industry believe that substantial technological progress is necessary before quantum computers can effectively challenge the robust encryption standards that protect internet communications.
However, the possibility of quantum computing eventually overcoming modern encryption safeguards is a valid concern. The potential future threat to the security of internet-based communication and commercial transactions necessitates a closer examination of digital cryptography, its current applications, and the ways it might be compromised.
Enhancing Cybersecurity with Quantum Technologies
The advancement of quantum computers presents a challenge to existing cybersecurity measures. Because quantum computers are theoretically capable of handling complex models and solving intricate mathematical problems, they have the potential to compromise widely-used encryption methods due to their unprecedented computational abilities. Although the technology required to break current encryption standards is not yet available and would require considerably larger machines than those existing today, the threat is taken seriously.
This concern has prompted the National Institute of Standards and Technology (NIST), a US-based certification body, to call for the development of “quantum safe” encryption algorithms. This initiative aims to introduce these new algorithms within the next decade. This move was partly influenced by a 2015 statement from the NSA, which was unexpected within the community. The NSA advised against significant investment in transitioning to Suite B elliptic curve algorithms, recommending instead to prepare for a shift to quantum-resistant algorithms.
The rationale behind this is the time required to implement a new encryption standard, which could take 5 to 10 years. The approach is precautionary, favoring readiness for quantum-resistant methods from the outset. The concern is that once a sufficiently powerful quantum computer becomes available, it might not be publicly known. This secrecy could enable malicious actors to easily decipher data encrypted with outdated methods, posing a significant risk to data security.
Post-quantum Cryptography
Post-quantum cryptography, sometimes referred to as quantum-resistant encryption, involves creating cryptographic protocols that can withstand potential attacks from quantum computers. This field focuses on securing classical computer systems against the advanced computational capabilities of quantum computing.
The concept of quantum computing emerged in the 1980s when researchers theorized that computers harnessing quantum mechanics’ principles could outperform traditional binary computers in complex calculations. Quantum computers, utilizing phenomena like superposition and entanglement, have the potential to execute specific computations much faster than their classical counterparts, reducing tasks that would take years to mere hours.
This potential was highlighted in the 1990s when mathematician Peter Shor demonstrated a theoretical quantum computer’s ability to effortlessly decipher the public key encryption (PKE) algorithm. This revelation prompted cryptographers globally to investigate the structure and feasibility of post-quantum cryptography systems. Currently, the standards for post-quantum encryption are still in the process of being established.
Lattice-Based Cryptography
The development of quantum-resistant cryptographic standards has become crucial due to the potential of quantum computers to break existing cryptographic methods. Lattice-based cryptography (LBC) is a prominent area in this field, distinguished by its reliance on complex mathematical problems related to lattices.
A lattice in LBC is akin to an infinite grid, like graph paper, with points at the intersections of lines. The complexity of LBC lies in identifying specific points on this grid, a task that is relatively easy in two dimensions but becomes exceedingly difficult in higher dimensions, such as 400. In LBC, one set of points might represent a private key, and another, more distant set, could be the public key.
Deciphering the private key from the public key in LBC would require an exhaustive search of possibilities. Even with the accelerated computation of quantum computers, this remains a daunting task that is unlikely to be accomplished quickly.
LBC is also a leading candidate in the NIST process for developing core cryptographic primitives like encryption, key encapsulation, and digital signature schemes. Examples include CRYSTALS-KYBER for public key encryption and CRYSTALS-Dilithium for digital signatures.
Standardized post-quantum cryptography algorithms aim to create systems secure against both quantum and conventional computers, compatible with existing communication protocols and networks. Companies like Utimaco are investing in post-quantum cryptography to offer quantum-resistant solutions, safeguarding systems from potential quantum computer-based attacks.
Hash-based cryptography
A hash function is a process that converts plaintext data of any size into a unique, fixed-length ciphertext, known as a “digest”. This function inputs a string and outputs a digest of a specific length, typically ranging from 256 to 512 bits. Common cryptographic hash functions include SHA2, SHA3, and Blake2.
Hash-based signature schemes build upon one-time signature schemes (OTS), where a key pair is used only once for signing a message. Using an OTS key pair for multiple messages compromises security, as it allows for signature forgery.
Merkle proposed a method allowing the signing of multiple messages. This involves creating several Lamport keypairs and assigning each public key to a leaf of a Merkle hash tree. The tree’s root becomes the “master” public key. The signer retains all Lamport keys for signing purposes.
A Merkle tree, or hash tree, is a structure where each leaf node is labeled with the hash of a data block, and each non-leaf node with the hash of its child nodes’ labels. This facilitates secure verification of large data structures.
In the Merkle Tree, each level reflects a higher order of hashing from a transaction. The lowest-level hashes, or leaves, contain hashed transaction values. The highest level, the Merkle Root, summarizes all transaction data in a single value.
Recent hash-based signature schemes like XMSS, Leighton-Micali (LMS), SPHINCS, and BPQS offer improved performance. Most are stateful, requiring updated secret keys with each use. SPHINCS, however, is stateless, with larger signatures compared to stateful schemes like XMSS and LMS. BPQS, designed for blockchain systems, and SPHINCS use WOTS+ and the HORST few-time signature mechanisms.
NIST has chosen to standardize three digital signature algorithms for quantum-safe signatures: CRYSTALS-Dilithium, FALCON, and SPHINCS+. This decision is based on the quantum safety and established understanding of hash-based signatures.
Code-based Cryptography
Code-based cryptography is a field that centers on developing cryptographic systems using error-correcting codes, a concept pioneered by McEliece and Niederreiter in the late 1970s to early 1980s. These systems are notable for their resistance to attacks from quantum computers, making them a significant focus within the broader domain of Post-Quantum Cryptography. Research in code-based cryptography currently aims to create algorithms that are rapid, secure, and efficient.
Quantum-safe Network Design
A quantum-safe network emphasizes the growing importance of adopting quantum-safe infrastructure that is immune to attack due to the increasing threat posed by quantum computing to current cryptographic standards. The focus would be on the urgency for businesses and organizations to upgrade their cybersecurity infrastructure to protect against potential quantum computing breaches.
The Future of Quantum Computing in Cybersecurity
Work on quantum computing that is currently housed in research universities, government offices and major scientific companies, is progressing rapidly. This advancement raises concerns about its potential to break modern cryptography — much like the trio of examples mentioned at the beginning — rendering current data encryption methods obsolete. The need for new cryptography to combat these powerful machines is imminent. Traditional encryption methods, like RSA and elliptic curve, could be easily solved by quantum computers, significantly reducing the time to break security keys from years to hours. Experts believe that quantum computers capable of breaking current codes could be more than a decade away, but the threat necessitates immediate action in cybersecurity planning.
Preparing for the Quantum Threat
To prepare for this future, organizations are advised to adopt defense-in-depth strategies, considering data protection in transit and at rest, and to be agile in the face of emerging threats. This includes network segmentation, leveraging 5G private networks, Zero Trust architectures, and re-encrypting old files with new technologies. The approach aims to provide comprehensive coverage against various attacks, preparing for the quantum computing era while handling current cybersecurity challenges.
As the quantum computing landscape evolves, staying informed on the latest developments and their implications for cybersecurity is crucial. The Quantum Insider encourages readers to actively engage with ongoing research and discussions surrounding quantum-resistant algorithms and encryption methods. By understanding the advancements in quantum computing, organizations can better prepare for potential threats and implement robust security measures. Focusing on agility and a proactive stance in cybersecurity strategies will ensure resilience against both current and future challenges. Keep abreast of innovations in quantum technology and cybersecurity to safeguard your digital assets and maintain trust in our increasingly interconnected world.
For more market insights, check out our latest quantum computing news here.
