Re: rsa - handwaving proofs
- From: "ping pong" <mosescuadro@xxxxxxxx>
- Date: Sun, 10 Apr 2011 18:56:13 +0930
"unruh" <unruh@xxxxxxxxxxxxxxxxxxxxxxx> wrote in message news:slrniq1d2b.csd.unruh@xxxxxxxxxxxxxxxxxxxxxxxxxx
On 2011-04-09, ping pong <mosescuadro@xxxxxxxx> wrote:Thanks for that. I shall check.o.k. Don't be mad at me now for stupid ideas!
Any info on a suitable easy to modify c implementation of the function that
follows, for key lengths 64 - 2048 say would be useful?
c = m^e mod (p * q), n = p*q, p and q are secret.
where (e,n) is public and m controlled by myself?
There are many versions of public domain implimentations of rsa. Eg,
Get them and read them.
Bye for now.
.You could be kind at at least give a bit of guidance on that simple thing?
I am pleading here! Not tring to prove anything spectacular or amazing!
I mean it's a simple and quite harmless request - right?
"Tom St Denis" <tom@xxxxxxx> wrote in message
On Apr 9, 9:53 am, "ping pong" <mosescua...@xxxxxxxx> wrote:Do you think the number theory operators can express what I am saying?
Or do you think it's a waste of time?
Can they express spatial arrangements of objects?
It's a genuine query?
Don't top post. It's annoying.
As for the general question you're asking, you don't know what you're
talking about. Learn some basic number theory and RSA will become
much more understandable.
- Prev by Date: Re: rsa - handwaving proofs
- Next by Date: Re: 2nd try for a "correct" starting point for signature gcreation in RSA algorithm
- Previous by thread: Re: rsa - handwaving proofs
- Next by thread: Re: rsa - handwaving proofs