[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

*From*: Jerry Leichter <leichter AT lrw.com>*Subject*: Re: [Cryptography] Quantum computers and the Government*Date*: Fri, 3 Sep 2021 11:24:45 -0400*Cc*: John Levine <johnl AT iecc.com>, cryptography AT metzdowd.com*List-archive*: <https://www.metzdowd.com/pipermail/cryptography>*Sender*: "cryptography" <cryptography-bounces+ben=bentasker.co.uk AT metzdowd.com>*To*: Sam Hartman <hartmans AT mit.edu>

That's an over-simpliifcation.
(The power of Grover's result is somewhat weakened by later work that shows that some ancillary computations have to be efficiently implementable for it to work. This is the case for factoring, but the last I saw - I don't keep up with the field - it was unknown if it was true for inverting AES.) Crystal clear, right? :-) It's a complex, very technical field. -- Jerry |

_______________________________________________ The cryptography mailing list cryptography AT metzdowd.com https://www.metzdowd.com/mailman/listinfo/cryptography

**References**:**Re: [Cryptography] Quantum computers and the Government***From:*John Levine

**Re: [Cryptography] Quantum computers and the Government***From:*Sam Hartman

- Prev by Date:
**Re: [Cryptography] Quantum computers and the Government** - Next by Date:
**Re: [Cryptography] Quantum computers and the Government** - Previous by thread:
**Re: [Cryptography] Quantum computers and the Government** - Next by thread:
**Re: [Cryptography] Quantum computers and the Government** - Index(es):