Page 61 - Demo

59Post-quantum cryptographyQuantum computers, built on the principles of quantum mechanics, can solve mathematical problems that are too difficult for classical computers. In 2019, Google claimed its quantum computer needed just 200 seconds to solve a problem that would take the world%u2019s fastest supercomputer 10,000 years. In other words, a quantum computer can work 100 million times faster than a classical computer. By drastically shortening the time needed to break encryption algorithms, a quantum computer poses a major threat to public encryption systems if acquired by a malicious actor. Every encryption system can be cracked, given enough time. With a classical computer, a malicious actor may need decades to process the data involved in an encryption. But if large-scale quantum computers exist in the future (experts expect the engineering challenges to be overcome in about two decades), stolen encrypted data can be decrypted easily and efficiently. To address this potential threat, Prof. Au%u2019s team has developed cryptographic algorithms that are secure against attacks from both quantum and classical computers. These algorithms are also interoperable with existing communications protocols and networks.IN SAFE HANDS