Earlier quoted context omitted.
The risk is non-linear advances That's what everybody said about AI, then sudden advances ~2013 led to the situation today.
A non-linear advance probably wouldn't involve Shor's algorithm. As what happened with AI algorithms. What we call post quantum cryptography is really post Shor's cryptography.
Google's threat model for post-quantum cryptography
61–70 of 81 posts
Re: Google's threat model for post-quantum cryptography
#62Earlier quoted context omitted.
> It might be a long time (if ever) before cryptographically relevant quantum computers show up Don’t be so sure. From the article, Google seems to believe quantum computers will arrive in the next 10 years.
Certainly three engineers in Google want to project that claim. I'd be interested to know if there's been a recent study of expert consensus on it.
Re: Google's threat model for post-quantum cryptography
#63Stateless 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. 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 st…
Are there privacy concerns with stateful tokens?
Re: Google's threat model for post-quantum cryptography
#64Stateless 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. 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 st…
> I'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. Yeah; that doesn't look right to me either. Perhaps "cryptographically relevant" has some unusual meaning (parity with conventional computing?). Otherwise, the consensus view is that there's, pessimistically, a 4% probability of a total b…
Re: Google's threat model for post-quantum cryptography
#65A counter-point that perhaps everyone is taking PQ a bit too seriously [1]. 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'll be glad we had a decade or two to get ready. The al…
It also depends on what your personal requirements for forward secrecy are. As a major platform operator Google should aim somewhere towards the top of that distribution.
Re: Google's threat model for post-quantum cryptography
#66Besides encrypting your user data at rest using these post-quantum cryptography algo. What can be done from a design point of view to make it as hard as possible to deter attackers? Would it make sense to segregate different types of data into other dbs rather than as a separate table? “Name DB” “Account DB” “Address DB” An attacker would need to have advanced knowledge of the app backend to know you have to snag bot…
> Besides encrypting your user data at rest using these post-quantum cryptography algo. If you're encrypting data at rest, just keep using an appropriate mode of AES (or ChaCha20 or whatever+) and exercising good key management practices. Quantum computing is largely irrelevant to conventional symmetric ciphers. + for tightly constrained values of 'whatever'
Re: Google's threat model for post-quantum cryptography
#67Earlier quoted context omitted.
Is there any insight why there is no PQC signature with a short signature? Is it just us failing to find one, or something more fundamental prevents a quantum resistant short signature like?
I’m confused because there are such things. What you want here is authentication, and there are hashing modes which provide that.
Re: Google's threat model for post-quantum cryptography
#68Earlier quoted context omitted.
I’m confused because there are such things. What you want here is authentication, and there are hashing modes which provide that.
They specifically asked about PQC signatures, not MACs.
Cookies are signed by the server, not the client, and only the server needs to check the signature, so there really isn’t any reason to use much more expensive asymmetric cryptography. And post-quantum security is just a bonus.
In the context of cookies, authenticated hashing IS a PQC signature.
Re: Google's threat model for post-quantum cryptography
#69This may be a naive question but why not go back to Vernam? Storage is cheap.
Re: Google's threat model for post-quantum cryptography
#70This may be a naive question but why not go back to Vernam? Storage is cheap.
In addition to the usual argument about the impracticality of the one time pad. There is also that it is symmetric cryptography (the one time pad is a shared secret). Symmetric algorithms (AES-256 in particular) are generally considered to be quantum resistant. Here is what written about it in the article. > Symmetric cryptography, using a single secret key to encrypt and authenticate data: In our current understandi…