Re: New Rabin-type PK system
From: Kristian Gjøsteen (kristiag+news_at_item.ntnu.no)
Date: 08/23/05
- Next message: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Previous message: Kristian Gjøsteen: "Re: New Rabin-type PK system"
- In reply to: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Next in thread: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Reply: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Tue, 23 Aug 2005 17:58:52 +0000 (UTC)
<tomstdenis@gmail.com> wrote:
>Kristian Gjøsteen wrote:
>> ECM is subexponential in the size of the smallest prime factor,
>> and polynomial in the size of the composite number. So it will
>> find small factors in huge numbers easily.
>
>So you make p ~ q in size then?
Yep. I believe that's optimal against ECM.
-- Kristian Gjøsteen
- Next message: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Previous message: Kristian Gjøsteen: "Re: New Rabin-type PK system"
- In reply to: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Next in thread: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Reply: tomstdenis_at_gmail.com: "Re: New Rabin-type PK system"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]