Re: RSA Decryption
From: Mxsmanic (mxsmanic_at_hotmail.com)
Date: 11/19/04
- Next message: yer mammy: "Re: RSA Decryption"
- Previous message: Arjen: "EFS encrypted harddisk"
- In reply to: Thorben Grosser: "RSA Decryption"
- Next in thread: yer mammy: "Re: RSA Decryption"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Fri, 19 Nov 2004 03:32:43 +0100
Thorben Grosser writes:
> Hy folks,
>
> I have been posed a question, and as i didn't get much out of google, I
> am asking you wheather you would help me to solve this problem:
>
> Nathaly wants to communicate to Daniel an important number, as well as
> she decides to encrypt this number using the RSA Encyption. She sends
> her the "message" (crypted): 7108707851160700458
> Daniels Public key is:
> - module N = 17401143680338538557
> - exponent e = 65537
> Surely, those numbers are too small to be confident. Findthe private
> exponent of daniel and the number crypted by Nathaly.
>
> can anyone help me out of this mess?
If d = the decryption exponent, then
1. Factor N into p and q.
2. Knowing that de = 1 mod ((p-1)(q-1)), solve for d.
The modulus in this case is quite small, so you should be able to factor
it without too much trouble.
-- Transpose hotmail and mxsmanic in my e-mail address to reach me directly.
- Next message: yer mammy: "Re: RSA Decryption"
- Previous message: Arjen: "EFS encrypted harddisk"
- In reply to: Thorben Grosser: "RSA Decryption"
- Next in thread: yer mammy: "Re: RSA Decryption"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
