From owner-freebsd-security@freebsd.org Sun Oct 29 00:20:55 2017 Return-Path: Delivered-To: freebsd-security@mailman.ysv.freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:1900:2254:206a::19:1]) by mailman.ysv.freebsd.org (Postfix) with ESMTP id 367BCE51E2E for ; Sun, 29 Oct 2017 00:20:55 +0000 (UTC) (envelope-from eric@metricspace.net) Received: from mail.metricspace.net (mail.metricspace.net [IPv6:2001:470:1f11:617::107]) by mx1.freebsd.org (Postfix) with ESMTP id 077DB1BA0; Sun, 29 Oct 2017 00:20:55 +0000 (UTC) (envelope-from eric@metricspace.net) Received: from [IPv6:2001:470:1f11:617:3210:b3ff:fe77:ca3f] (unknown [IPv6:2001:470:1f11:617:3210:b3ff:fe77:ca3f]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (Client did not present a certificate) (Authenticated sender: eric) by mail.metricspace.net (Postfix) with ESMTPSA id 881061766; Sun, 29 Oct 2017 00:20:54 +0000 (UTC) Subject: Re: Crypto overhaul To: Jules Gilbert , Poul-Henning Kamp , Nathan Whitehorn , "freebsd-security@freebsd.org security" , Ben Laurie , pg@eth1.com, Jeremiasfeliz References: <13959.1509132270@critter.freebsd.dk> From: Eric McCorkle Message-ID: <2ec1f3bc-cb6d-0073-9a6e-704a2cf1b3c4@metricspace.net> Date: Sat, 28 Oct 2017 20:20:54 -0400 User-Agent: Mozilla/5.0 (X11; FreeBSD amd64; rv:52.0) Gecko/20100101 Thunderbird/52.4.0 MIME-Version: 1.0 In-Reply-To: Content-Type: text/plain; charset=utf-8 Content-Language: en-US Content-Transfer-Encoding: 8bit X-BeenThere: freebsd-security@freebsd.org X-Mailman-Version: 2.1.23 Precedence: list List-Id: "Security issues \[members-only posting\]" List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 29 Oct 2017 00:20:55 -0000 On 10/27/2017 19:17, Jules Gilbert wrote: > These days no one talks about how wonderful CPM was, we used it because > at one time, it was the only OS available. > > So what is our excuse for using SSL?, because I'm fairly certain the NSA > and just about everyone else in the neighborhood has hacked it. > > Question for the group...  Does anyone believe that factoring is > actually hard.  It was once, I know.  But today? > > I'm not a crypto person, but even I wrote a simple factoring program.  > In C, using MAPM.  I produce a few of the left-most bits for a,b, where: > > c = a*b; > > where a is:  3 .. sqrt(c) > > and (of course,) b must be: greater than sqrt(c) > > from this I bisect the space of 3 .. sqrt(c) and begin the recursive > descent.  The program does about 5,000 prime pairs an hour and this > using MAPM!! > > I gave away the source code, let me know if you didn't get a copy.  > You'll need g++ and MAPM This isn't the place for discussions of number theory, but I don't see what you could possibly use for a binary search here. More generally, discovering a polynomial-time prime factorization algorithm would likely win you a fields medal, given that it's one of the oldest open problems in mathematics. So it's extremely unlikely that a solution exists.