RSA troubles...
From: lakis (lakis2000_at_hotmail.com)
Date: 07/08/03
- Next message: Tom St Denis: "Re: RSA troubles..."
- Previous message: Thomas Moore: "How to crypt for 1,000,000 years into the future?"
- Next in thread: Tom St Denis: "Re: RSA troubles..."
- Reply: Tom St Denis: "Re: RSA troubles..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 7 Jul 2003 16:32:33 -0700
Just get a little bit stucked!!!
i want to show that
RSA(a)*RSA(b) = RSA(a*b) for every a,b that are in *Zn
where *Zn is the set: *Zn= {all integers x such that gcd(x,n)=1}
and RSA(x)= x^e modn, where x,e,n=p*q integers(p,q primes) and e is
odd such that gcd(e,phi(n))=1 (i dont know if this helps somewhere or
its useless but it stands)
*******************************************************************************
My solution
I prooved that [RSA(a)*RSA(b)] modn = RSA(a*b) modn for every a,b that
are in Z. Does this help?
Thank you
********************************************************************************
- Next message: Tom St Denis: "Re: RSA troubles..."
- Previous message: Thomas Moore: "How to crypt for 1,000,000 years into the future?"
- Next in thread: Tom St Denis: "Re: RSA troubles..."
- Reply: Tom St Denis: "Re: RSA troubles..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
