Re: About RSA Cryptosystem
- From: Kristian Gjøsteen <kristiag+news@xxxxxxxxxxxx>
- Date: Tue, 27 Feb 2007 17:11:16 +0000 (UTC)
Jian-jie <jjzhao1981@xxxxxxxxx> wrote:
It is easy to prove that ((x)^b)^a=x(mod n) when x belongs to Zn*.But
how to prove the result when x belongs to Zn\Zn*.
Prove it modulo p and q separately.
--
Kristian Gjøsteen
.
- References:
- About RSA Cryptosystem
- From: Jian-jie
- About RSA Cryptosystem
- Prev by Date: Re: Blum-Micali construction reverse order
- Next by Date: Re: My attempt to break Rijndael (SAT-attack)
- Previous by thread: Re: About RSA Cryptosystem
- Next by thread: My attempt to break Rijndael (SAT-attack)
- Index(es):
