[prev in list] [next in list] [prev in thread] [next in thread] 

List:       openssl-users
Subject:    R: Re: how to generate relatively prime numbers
From:       "denote23 () libero ! it" <denote23 () libero ! it>
Date:       2010-04-30 18:14:56
Message-ID: 19585722.469181272651296692.JavaMail.defaultUser () defaultHost
[Download RAW message or body]



Thanks.

>----Messaggio originale----
>Da: Victor.Duchovni@morganstanley.com
>Data: 30/04/2010 19.11
>A: <openssl-users@openssl.org>
>Ogg: Re: how to generate relatively prime numbers
>
>On Fri, Apr 30, 2010 at 06:32:30PM +0200, Michael T?xen wrote:
>
>> On Apr 30, 2010, at 9:29 AM, denote23@libero.it wrote:
>> 
>> > Hi all.
>> > I need to generate a BIGNUM C that is relatively prime with a BIGNUM N    
( GCD
>> > (N,C)=1 )
>> > is there a pre-built function in openssl library ??
>>
>> Doesn't C=1 or C=N+1 solve your problem?
>
>Indeed (1) is relatively-prime to all integers, and (n+1) is
>relatively-prime to (n) for each (n). The OP perhaps has additional
>unstated requirements.
>
>-- 
>	Viktor.
>______________________________________________________________________
>OpenSSL Project                                 http://www.openssl.org
>User Support Mailing List                    openssl-users@openssl.org
>Automated List Manager                           majordomo@openssl.org
>


______________________________________________________________________
OpenSSL Project                                 http://www.openssl.org
User Support Mailing List                    openssl-users@openssl.org
Automated List Manager                           majordomo@openssl.org
[prev in list] [next in list] [prev in thread] [next in thread]