Interesting item in the abstract: "... using a quantum circuit of at most
448.n^3.log2(n)+4090.n^3 Toffoli gates." In the past I've seen mention of
qubit counts but not gate counts. While the gate count isn't exponential, it's
nevertheless formidable. For 1000 bit inputs it translates to several
teragates. How tight is that upper bound?
Are the numbers for RSA or discrete log (conventional Diffie-Hellman) similar?
If so, does that translate into "quantum computers are not a practical issue"?
paul
> On Jul 30, 2018, at 2:37 PM, Dan Brown <[email protected]> wrote:
>
> For ECC v QC, see also
>
> https://ia.cr/2017/598
_______________________________________________
IPsec mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/ipsec
