From mboxrd@z Thu Jan 1 00:00:00 1970 Path: news.gmane.io!.POSTED.blaine.gmane.org!not-for-mail From: Michael Heerdegen Newsgroups: gmane.emacs.help Subject: Re: Noob dumb question (extending emacs) Date: Sun, 24 Oct 2021 10:16:29 +0200 Message-ID: <87ilxmsuqq.fsf@web.de> References: <86k0i6uoxd.fsf@duenenhof-wilhelm.de> <871r4ernmt.fsf@zoho.eu> <87o87hnrpt.fsf@zoho.eu> <87y26kkuag.fsf@web.de> <87zgr0t3vw.fsf@web.de> <87o87fy4t3.fsf@zoho.eu> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: ciao.gmane.io; posting-host="blaine.gmane.org:116.202.254.214"; logging-data="31264"; mail-complaints-to="usenet@ciao.gmane.io" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/29.0.50 (gnu/linux) To: help-gnu-emacs@gnu.org Cancel-Lock: sha1:lnOrHZYe+4NFjuvkKfLKnyjiQTU= Original-X-From: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane-mx.org@gnu.org Sun Oct 24 10:17:42 2021 Return-path: Envelope-to: geh-help-gnu-emacs@m.gmane-mx.org Original-Received: from lists.gnu.org ([209.51.188.17]) by ciao.gmane.io with esmtps (TLS1.2:ECDHE_RSA_AES_256_GCM_SHA384:256) (Exim 4.92) (envelope-from ) id 1meYhK-0007xY-Hn for geh-help-gnu-emacs@m.gmane-mx.org; Sun, 24 Oct 2021 10:17:42 +0200 Original-Received: from localhost ([::1]:57636 helo=lists1p.gnu.org) by lists.gnu.org with esmtp (Exim 4.90_1) (envelope-from ) id 1meYhJ-0004dT-DN for geh-help-gnu-emacs@m.gmane-mx.org; Sun, 24 Oct 2021 04:17:41 -0400 Original-Received: from eggs.gnu.org ([2001:470:142:3::10]:38504) by lists.gnu.org with esmtps (TLS1.2:ECDHE_RSA_AES_256_GCM_SHA384:256) (Exim 4.90_1) (envelope-from ) id 1meYgN-0004dL-PJ for help-gnu-emacs@gnu.org; Sun, 24 Oct 2021 04:16:43 -0400 Original-Received: from ciao.gmane.io ([116.202.254.214]:43708) by eggs.gnu.org with esmtps (TLS1.2:ECDHE_RSA_AES_256_GCM_SHA384:256) (Exim 4.90_1) (envelope-from ) id 1meYgM-0008N7-7b for help-gnu-emacs@gnu.org; Sun, 24 Oct 2021 04:16:43 -0400 Original-Received: from list by ciao.gmane.io with local (Exim 4.92) (envelope-from ) id 1meYgI-0006f8-Rr for help-gnu-emacs@gnu.org; Sun, 24 Oct 2021 10:16:38 +0200 X-Injected-Via-Gmane: http://gmane.org/ Received-SPF: pass client-ip=116.202.254.214; envelope-from=geh-help-gnu-emacs@m.gmane-mx.org; helo=ciao.gmane.io X-Spam_score_int: -13 X-Spam_score: -1.4 X-Spam_bar: - X-Spam_report: (-1.4 / 5.0 requ) BAYES_00=-1.9, FREEMAIL_FORGED_FROMDOMAIN=0.249, FREEMAIL_FROM=0.001, HEADER_FROM_DIFFERENT_DOMAINS=0.25, SPF_HELO_NONE=0.001, SPF_PASS=-0.001 autolearn=no autolearn_force=no X-Spam_action: no action X-BeenThere: help-gnu-emacs@gnu.org X-Mailman-Version: 2.1.23 Precedence: list List-Id: Users list for the GNU Emacs text editor List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane-mx.org@gnu.org Original-Sender: "help-gnu-emacs" Xref: news.gmane.io gmane.emacs.help:134093 Archived-At: Emanuel Berg via Users list for the GNU Emacs text editor writes: > Cool, how did you compute that? Not hard to do (unless I'm missing something): For which password length l exist approximately 2^48 different passwords using an alphabet of n characters? 2^48 = n^l 48 ln 2 = l ln n l = 48 ln 2 / (ln n) If you use lowercase and uppercase letters and, say, 8 other symbols, n=26*2+8=60 48 ln(2) l = -------- ~ 8.13. ln(60) That would mean that already for a length of 9 only a small fraction of passwords are computable. Michael.