Re: RSA decryption exponent d (c++)
- From: "rossum" <rossum48@xxxxxxxxxxx>
- Date: 31 Mar 2006 08:48:06 -0800
TJakobsen wrote:
hehe sorry but i dont really understand how to use this in my program
as im only a high school student (last year though). We don't have
advanced mathematics yet and we haven't really worked with any of the
mathematics related to RSA such as modulo etc.
could someone be so kind as to go through this Extended Euclidian
algorithn using the numbers i've used in my program please?
so we can calculate d.
thanks in advance.
TJakobsen
As well as Kristian's suggestion of finding the Handbook of Applied
Cryptography, you can also get "A Computational Introduction to Number
Theory and Algebra" by Shoup free on the web, which covers more of the
mathematical background though less of the cryptography. The Extended
Euclidian algorithm is in section 4.2. Wikipedia and Mathworld will no
doubt also have explanations. Google is your friend.
You could also search libraries for "The Art of Computer Programming"
by Knuth in three volumes, you want Volume Two, algorithm 4.5.2X.
Alternatively "Prime Numbers - A Computational Perspective" by Crandall
and Pomerance has the Extended Euclidian algorithm as algorithm 2.1.4.
rossum
.
- References:
- RSA decryption exponent d (c++)
- From: TJakobsen
- Re: RSA decryption exponent d (c++)
- From: Kristian Gjøsteen
- Re: RSA decryption exponent d (c++)
- From: TJakobsen
- RSA decryption exponent d (c++)
- Prev by Date: Re: crypto++ 5 and RSA encryption/decryption problem
- Next by Date: Re: WPA/WEP key discovery time
- Previous by thread: Re: RSA decryption exponent d (c++)
- Next by thread: Re: RSA decryption exponent d (c++)
- Index(es):
Relevant Pages
|
