Quantum computing may not be coming quite as fast as some in the field had certainly feared (or perhaps hoped). Google did, however, solve an impressive problem this year.
They published a paper in Nature. It stated that their quantum processor solved a problem that, in contrast, a digital computer would take 10,000 years to solve. The problem that was solved deals with generating certifiably random numbers. Their processor, ‘Sycamore’, uses 53 qubits, which corresponds to a search space of 1016.
Sorry for the interruption! I just wanted to mention that you should check out my new free cryptography course. It’s designed to teach you the crypto basics you need to get started in cybersecurity while writing code in the Go programming language.
Lattice-based Cryptography (LBC) is one of our best bets for secure “Post Quantum Cryptography”. Therefore, almost half of the second round of NIST’s PQC contest is based on lattice math.
In addition, Matthew Dozer has a great introductory video:
Bitcoin – Schnorr Signatures
Instead of the current ECDSA implementation, Bitcoin might be switching to Schnorr signatures in order to get more efficiency when signing transactions. Instead of signing each transaction separately, with Schnorr, we can generate a single signature to validate many transactions at once. This allows Bitcoin to scale by requiring less data to be broadcast on the network when grouping transactions.
More Rigorous Testing of Hash Functions
Also, Nicky Mouha published a paper exposing a vulnerability in Apple’s CoreCrypto Library. This affects 11 out of 12 implemented hashes. However, MD2 is the only function to remain secure. As a result, a new test is founded which can help detect similar problems moving forward