Re: How to be co-prime?
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: How to be co-prime?

From: bobic <fbloveu@hotmail.com>
Date: Wed Apr 05 2006 - 14:17:42 CEST

tomstdenis@gmail.com wrote:
> bobic wrote:
> > Here, we have t+1 numbers, r_1,...r_t, a, then how to make that r_i
> > (i=1,...,t) is co-prime with a by a same method?
>
> What does "same method" mean?
>
> This one really sounds like a homework question because it has no
> practical value in day to day crypto.
>
> As for making a list of numbers co-prime with a single value it's
> trivial. Make the list a list of primes not equal to or a power of
> "a".
>
> Tom

First, it is not from homework! I have no homework any more.

Second, "same method" means that by some function f(x), such that
f(r_i) is co-prime with "a".

Bobic
Received on Mon May 1 01:55:16 2006