Sujet : Re: ℙ≠ℕℙ proof
De : wyniijj5 (at) *nospam* gmail.com (wij)
Groupes : comp.theoryDate : 18. May 2024, 13:18:45
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <1977b1a397a014fa436e3db5e4959331ee50f31f.camel@gmail.com>
References : 1 2
User-Agent : Evolution 3.50.2 (3.50.2-1.fc39)
On Sat, 2024-05-18 at 12:36 +0200, immibis wrote:
On 18/05/24 12:10, wij wrote:
If no more information of the
key is given, the computation of key_exist(..) can only be done by
visiting each one of O(2^|ctext|) possibilies of the key.
prove it
You cut off the relevant phrase. "Every key has to be visited", though phrased differently
ℙ≠ℕℙ proof
Re: ℙ≠ℕℙ proof