Get the latest tech news
Cryptographic Right Answers: Post Quantum Edition
One of our favorite blog posts is our “crypto right answers” post. It’s intended to be an easy-to-use guide to help engineers pick the best cryptography choices without needing to go too far down a rabbit hole. With post-quantum cryptography (PQC) recently transitioning from an academic research topic to a more practical cryptography concern we figured it’s time for an update of our cryptography recommendations. One thing that makes recommending PQC challenging is that historically, we’ve been able to provide “better” answers for classical cryptography.
The drum banging comes from the realization that quantum computers large enough to pose a threat to current cryptographic algorithms could be realized in the next 20 years, which by Mosca's Theorem means we should start moving about now. FN-DSA was chosen to satisfy applications that require smaller public key and signature sizes, even though its implementation is difficult, especially on constrained devices given the amount of resources it consumes and propensity to side-channel attacks. In fact, if you’re worried about encryption, key length, symmetric “signatures”, hashing, random IDs, password handling, online backups, our opinion hasn’t changed that much from our previous post.
Or read this on Hacker News
