Re: How To Handle Huge Numbers In 2048 Bit RSA
From: W. Othman (rainwolf8472_at_hotmail.com)
Date: 10/24/03
- Next message: Phil Carmody: "Re: Can anybody give me some test data?"
- Previous message: Tom St Denis: "Re: generators be bound"
- In reply to: Johan van der Galien: "How To Handle Huge Numbers In 2048 Bit RSA"
- Next in thread: Bill Unruh: "Re: How To Handle Huge Numbers In 2048 Bit RSA"
- Reply: Bill Unruh: "Re: How To Handle Huge Numbers In 2048 Bit RSA"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Fri, 24 Oct 2003 13:29:45 +0200
Here are some libs to do just that in FreePascal (http://www.freepascal.org)
and in delphi 4 and higher, the source is public.
http://triade.studentenweb.org/
take a look at the FGInt-section.
regards,
wal
"Johan van der Galien" <galien8@zonnet.nl> wrote in message
news:b5368c00.0310231122.277aa1cc@posting.google.com...
> I wonder how they handle the huge numbers in RSA programs written in
> C, PASCAL and DELPHI?
>
> To my knowledge the numbers of 2048 bit RSA encryption involve the
> calculation:
>
> (decimal ascii code)^(encryption key) mod (public key)
>
> This calculation is in the order of: 255^2^2048 mod 2^2048. The
> possible encryption keys can of course be much greater the 2^2048,
> they can in fact be infinite!
>
> Without going in to the details of RSA theory, which of course the
> most of you already understand, how is for example 255^2^2048
> calculated in C, PASCAL and DELPHI programs? Since the standaard
> integers do not go further than the 64 bit signed or unsigned!
>
> unsigned 64 bit = (10)log 2^64 = about 19 decimal digits
>
> (10) log 255^2^2048 = about 9857 decimal digits (This as I said
> earlier at the low end, the high end is infinite)
>
> I hope I made my problem clear. What I am searching for is the source
> code of large integer units for C, PASCAL and DELPHI.
>
> Kind Regards,
>
> Johan.
- Next message: Phil Carmody: "Re: Can anybody give me some test data?"
- Previous message: Tom St Denis: "Re: generators be bound"
- In reply to: Johan van der Galien: "How To Handle Huge Numbers In 2048 Bit RSA"
- Next in thread: Bill Unruh: "Re: How To Handle Huge Numbers In 2048 Bit RSA"
- Reply: Bill Unruh: "Re: How To Handle Huge Numbers In 2048 Bit RSA"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
