Path: ...!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: immibis <news@immibis.com>
Newsgroups: comp.theory
Subject: =?UTF-8?B?UmU6IOKEmeKJoOKEleKEmSBwcm9vZg==?=
Date: Sat, 18 May 2024 12:36:46 +0200
Organization: A noiseless patient Spider
Lines: 6
Message-ID: <v2a0bu$2o9to$1@dont-email.me>
References: <c551b89c7c198516140458a38018e1a9a80a80fa.camel@gmail.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 18 May 2024 12:36:47 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="129ff628fc232994dee2adf5d3d62da7";
	logging-data="2893752"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19d7Nd6EQid09BDUS5OHFZM"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:6L4kHaQSHEuy0s+FTbKKNieSxZE=
Content-Language: en-US
In-Reply-To: <c551b89c7c198516140458a38018e1a9a80a80fa.camel@gmail.com>
Bytes: 1251

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