From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org [172.17.192.35]) by mail.linuxfoundation.org (Postfix) with ESMTPS id 6E54B7E for ; Wed, 12 Aug 2015 19:59:53 +0000 (UTC) Received: from bedivere.hansenpartnership.com (bedivere.hansenpartnership.com [66.63.167.143]) by smtp1.linuxfoundation.org (Postfix) with ESMTP id CEAC41C2 for ; Wed, 12 Aug 2015 19:59:52 +0000 (UTC) Message-ID: <1439409591.2825.86.camel@HansenPartnership.com> From: James Bottomley To: Andy Lutomirski Date: Wed, 12 Aug 2015 12:59:51 -0700 In-Reply-To: References: <20436.1438090619@warthog.procyon.org.uk> <1438096213.5441.147.camel@HansenPartnership.com> <1438097471.5441.152.camel@HansenPartnership.com> <1438099839.5441.165.camel@HansenPartnership.com> <1438100102.26913.183.camel@infradead.org> <30361.1438101879@warthog.procyon.org.uk> <1438111168.26913.189.camel@infradead.org> <1438121016.5441.233.camel@HansenPartnership.com> <16035.1439324695@warthog.procyon.org.uk> <11239.1439403720@warthog.procyon.org.uk> <1439405139.3100.147.camel@infradead.org> <1439406931.2825.74.camel@HansenPartnership.com> <1439408625.2825.79.camel@HansenPartnership.com> Content-Type: text/plain; charset="UTF-8" Mime-Version: 1.0 Content-Transfer-Encoding: 7bit Cc: Luis Rodriguez , "ksummit-discuss@lists.linuxfoundation.org" , Kyle McMartin Subject: Re: [Ksummit-discuss] [TECH TOPIC] Firmware signing List-Id: List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , On Wed, 2015-08-12 at 12:45 -0700, Andy Lutomirski wrote: > On Wed, Aug 12, 2015 at 12:43 PM, James Bottomley > wrote: > > On Wed, 2015-08-12 at 12:25 -0700, Andy Lutomirski wrote: > >> All that's moot, though. IMO the only reason we should support RSA > >> here is if there are vendor keys already out there (or Authenticode, > >> sigh) that use RSA. RSA keys and signatures are rather large. > > > > In either case security rests on the discrete log problem. > > RSA is based on factoring, not discrete log. Security is based on the discrete log: RSA relates the private to the public key via an inverse operation: if you can solve the discrete log problem, you can recover the private key from just the public key. If you can factor n in RSA, you can also recover the public key. It is a theorem that these two problems are effectively equivalent. James