Re: Can someone please check these figures
From: Nigel Smart (nigel_at_cs.bris.ac.uk)
Date: 07/26/04
- Next message: John Savard: "Re: "All random number generators eventually exhibit periodicity"?????"
- Previous message: Tom St Denis: "Re: Can someone please check these figures"
- In reply to: Robert: "Can someone please check these figures"
- Next in thread: Michael Amling: "Re: Can someone please check these figures"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Mon, 26 Jul 2004 11:03:21 GMT
Robert wrote:
> I am trying to encrypt the following using RSA
>
> p = 257, q=263, e = 7, Letter for Encrption = R (ascii 82).
>
> hence:
> N= 67591
>
> C = 82^7 mod 67591
> C=59156
>
> so the encrypted value is 59156
>
> However to I have trouble decrypting it:
>
> phi:67072
> d:38327
Dont do the following....
> C^d:433370372864891793361365563191187492639486140446836071782674040345154835633626032994202073684903505243341240218748940410
Nigel
-- Dr Nigel P. Smart | Phone: +44 (0)117 954 5163 Computer Science Department, | Fax: +44 (0)117 954 5208 Woodland Road, | Email: nigel@cs.bris.ac.uk University of Bristol, BS8 1UB, UK | URL: http://www.cs.bris.ac.uk/~nigel/
- Next message: John Savard: "Re: "All random number generators eventually exhibit periodicity"?????"
- Previous message: Tom St Denis: "Re: Can someone please check these figures"
- In reply to: Robert: "Can someone please check these figures"
- Next in thread: Michael Amling: "Re: Can someone please check these figures"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|