IETF Logo Mail Archive

Re: [CFRG] Combinitorics probabilities

Taylor R Campbell <campbell+cfrg@mumble.net> Mon, 08 August 2022 21:06 UTC

Return-Path: <campbell@mumble.net>
X-Original-To: cfrg@ietfa.amsl.com
Delivered-To: cfrg@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id C3B3AC14F738 for <cfrg@ietfa.amsl.com>; Mon, 8 Aug 2022 14:06:19 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.906
X-Spam-Level:
X-Spam-Status: No, score=-1.906 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, RCVD_IN_ZEN_BLOCKED_OPENDNS=0.001, SPF_HELO_NONE=0.001, SPF_PASS=-0.001, T_SCC_BODY_TEXT_LINE=-0.01, URIBL_BLOCKED=0.001, URIBL_DBL_BLOCKED_OPENDNS=0.001, URIBL_ZEN_BLOCKED_OPENDNS=0.001] autolearn=ham autolearn_force=no
Received: from mail.ietf.org ([50.223.129.194]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id mE-xauL-5xgX for <cfrg@ietfa.amsl.com>; Mon, 8 Aug 2022 14:06:15 -0700 (PDT)
Received: from jupiter.mumble.net (jupiter.mumble.net [74.50.56.165]) (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits) key-exchange X25519 server-signature RSA-PSS (2048 bits) server-digest SHA256) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id D26ADC157B32 for <cfrg@ietf.org>; Mon, 8 Aug 2022 14:06:15 -0700 (PDT)
Received: by jupiter.mumble.net (Postfix, from userid 1014) id 7D708608D6; Mon, 8 Aug 2022 21:06:14 +0000 (UTC)
From: Taylor R Campbell <campbell+cfrg@mumble.net>
To: Robert Moskowitz <rgm-sec@htt-consult.com>
CC: cfrg@ietf.org
In-reply-to: <44268f7f-168e-fe67-af53-e6b26be2ef9c@htt-consult.com> (rgm-sec@htt-consult.com)
Date: Mon, 08 Aug 2022 21:06:07 +0000
Sender: Taylor R Campbell <campbell@mumble.net>
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Message-Id: <20220808210614.7D708608D6@jupiter.mumble.net>
Archived-At: <https://mailarchive.ietf.org/arch/msg/cfrg/9aUroHsPIW5x511EbE3rmsMkK4o>
Subject: Re: [CFRG] Combinitorics probabilities
X-BeenThere: cfrg@irtf.org
X-Mailman-Version: 2.1.39
Precedence: list
List-Id: Crypto Forum Research Group <cfrg.irtf.org>
List-Unsubscribe: <https://www.irtf.org/mailman/options/cfrg>, <mailto:cfrg-request@irtf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/cfrg/>
List-Post: <mailto:cfrg@irtf.org>
List-Help: <mailto:cfrg-request@irtf.org?subject=help>
List-Subscribe: <https://www.irtf.org/mailman/listinfo/cfrg>, <mailto:cfrg-request@irtf.org?subject=subscribe>
X-List-Received-Date: Mon, 08 Aug 2022 21:06:19 -0000

> Date: Mon, 8 Aug 2022 16:58:45 -0400
> From: Robert Moskowitz <rgm-sec@htt-consult.com>
> 
> Well I spent the afternoon googling, but my search foo is weak.
> 
> I want the formula for the probablity of receiving at least m out of n 
> messages given the probablity of receiving any message is p.

This sounds like the coupon collector's problem?

https://en.wikipedia.org/wiki/Coupon_collector%27s_problem

v2.23.0 | Report a Bug | By Email