Re: RSA number support in C

"R3769" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
> TSD wrote:
> >
> >Or
> >
> >http://book.libtomcrypt.org
> >
> >That explains the math.
> >
>
> Indeed.  From page 282:
>
> "Prime numbers arise in cryptography considerably as they allow finite
fields
> to be formed.  The ability to determine whether an integer is prime or not
> quickly has been a viable subject in cryptography and number theory for
> considerable time."
>
> Splains it for me.

Hmm?  What are you commenting about?  Sure the language needs a rewrite but
it's a draft.  Cut me some slack.

As to explaining what a prime is read the paragraph before that.  As to
explaining the tests read the sections after.  If all you were pointing out
is a poorly written sentence... well stand in line.  The book ain't not
never no finished.

Recall that the goal of the book is to explain why the algorithms work.  Not
explain every ounce of theory that came before it.  You really have to know
a bit of number theory before reading the text.

Tom