TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Google's threat model for post-quantum cryptography

255 pointsby yuedongzeabout 1 year ago

11 comments

tptacekabout 1 year ago
<i>Stateless tokens come with independent security concerns, and moving towards stateful tokens is prudent just to ensure more robust systems. [...] Our main recommendation is to use stateful tokens where possible, given their additional security benefits.</i><p>This is smart. PQC schemes often add too much overhead for interoperable cookie sizes. Instead of trying to cram a PQC signature into a cookie, just stop using the stateless cookie designs that require asymmetric signatures.<p>I&#x27;m not sure I buy the Global Risk Institute chart. I get that they need to motivate adoption, but practical cryptanalytic work with quantum computers seems unpromising right now.
评论 #39674493 未加载
评论 #39674348 未加载
评论 #39678821 未加载
评论 #39674798 未加载
评论 #39674159 未加载
评论 #39680332 未加载
thadtabout 1 year ago
A counter-point that perhaps everyone is taking PQ a bit too seriously [1].<p>Personally, it seems reasonable to at least spend some effort preparing for it, given the rather long lead time required to develop, study and stress the constructions needed. It might be a long time (if ever) before cryptographically relevant quantum computers show up, but if they do, we&#x27;ll be glad we had a decade or two to get ready. The alternative of scrambling at the last minute while everything gets cracked seems unenviable.<p>[1] <a href="https:&#x2F;&#x2F;www.cs.auckland.ac.nz&#x2F;~pgut001&#x2F;pubs&#x2F;heffalump_crypto.pdf" rel="nofollow">https:&#x2F;&#x2F;www.cs.auckland.ac.nz&#x2F;~pgut001&#x2F;pubs&#x2F;heffalump_crypto...</a>
评论 #39678048 未加载
评论 #39677715 未加载
评论 #39678455 未加载
xystabout 1 year ago
Besides encrypting your user data at rest using these post-quantum cryptography algo.<p>What can be done from a design point of view to make it as hard as possible to deter attackers?<p>Would it make sense to segregate different types of data into other dbs rather than as a separate table?<p>“Name DB” “Account DB” “Address DB”<p>An attacker would need to have advanced knowledge of the app backend to know you have to snag both the account db and address db. Otherwise, the decrypted data is useless with only 1 db.<p>Drawbacks of course include “performance degradation”, “increasingly complex app”.<p>Ideally, if you did not need to store sensitive data or collect other user info such as address or zip code. Then not asking for it at all would be optimal. Maybe regulation is needed here.
评论 #39674428 未加载
评论 #39678876 未加载
评论 #39674825 未加载
评论 #39674335 未加载
评论 #39674378 未加载
comexabout 1 year ago
&gt; There are several alternatives to simply replacing classical signatures with quantum-safe signatures, which could address the performance issues when it comes to PKI. We are currently looking to experiment in this space to gather data for more solid recommendations, which we will share in a future blog post.<p>Does anyone know what those alternatives might be? Some way to collapse a chain of signatures into one? Long-term symmetric session keys? Neither of those sound like good ideas but I&#x27;m grasping at straws.
评论 #39674495 未加载
JanisErdmanisabout 1 year ago
The threat estimate for a quantum computer that breaks cryptography shall be based on currently available data and the understanding that only the Schor algorithm is known to provide exponential speedup for factorisation.<p>Let’s give IBM credit for attempting to factor in the number 35 in 2022, although they failed there [1]. Before that, the successful factorisation happened for the number 21 in 2012 [2] and the first factorisation of 15 in 2001 [3].<p>Now we have three points. There is a trend that the factorised number grows by a number of 10 for every ten years. Thus, to get a quantum computer that facilitates RSA-2048, we shall wait for 2^2048 years.<p>[1]: <a href="https:&#x2F;&#x2F;arxiv.org&#x2F;pdf&#x2F;2103.13855v1.pdf" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;pdf&#x2F;2103.13855v1.pdf</a><p>[2]: <a href="https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;nphoton.2012.259" rel="nofollow">https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;nphoton.2012.259</a><p>[3]: <a href="https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;414883a" rel="nofollow">https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;414883a</a>
评论 #39674880 未加载
评论 #39674357 未加载
Retr0idabout 1 year ago
Just from reading this it&#x27;s a bit unclear to me why they recommend only SPHINCS+ for &quot;Firmware Signatures&quot;, while for &quot;Software Signatures&quot; they recommend Dilithium3+hybrid <i>or</i> SPHINCS+.<p>Is SPHINCS+ more lightweight?
评论 #39676688 未加载
shireboyabout 1 year ago
I’ve wondered if the institutional buy up of BTC via ETFs and corporate and governmental balance sheets has adequately considered this risk. Could a bad actor steal BTC by cracking sha256 keys on a quantum computer? There could be a catch-22 - doing so would zero the value of btc, so if they didn’t immediately transfer to a quantum resistant asset, their heist would be worthless. Still, they could profit by shorting or it could be on agenda of other assets to just zero btc.
dvhabout 1 year ago
This may be a naive question but why not go back to Vernam? Storage is cheap.
评论 #39674469 未加载
评论 #39674196 未加载
评论 #39674692 未加载
评论 #39681092 未加载
deadbabeabout 1 year ago
How close or far do people speculate we are from Q-Day?
评论 #39676998 未加载
Alquds2024about 1 year ago
Yes, there is some truth to that
rihegherabout 1 year ago
In short all encrypted data transiting through internet will get uncrypted once quantum computing is there. As if we didn&#x27;t already had enough threats to worry about...
评论 #39673676 未加载
评论 #39674017 未加载