Re: RSA Blinding
From: Tom St Denis (tomstdenis_at_yahoo.com)
Date: 03/05/04
- Next message: Tom St Denis: "Re: Countering chosen-plaintext attacks"
- Previous message: dsr_at_Florence.edu: "Re: Packet timing to send key bits"
- In reply to: mike3: "Re: RSA Blinding"
- Next in thread: mike3: "Re: RSA Blinding"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 5 Mar 2004 07:38:52 -0800
"mike3" <mike4ty4@yahoo.com> wrote in message news:<yTW1c.330$x01.244@news02.roc.ny>...
> "Tom St Denis" <tomstdenis@yahoo.com> wrote in message
> news:c8016437.0403041620.519d3812@posting.google.com...
> > "mike3" <mike4ty4@yahoo.com> wrote in message
> news:<5rL1c.4589$2X3.1341@news01.roc.ny>...
> <nip>
> > Take your pick. If you want to know a bit about the algorithms and
> > how they work read the book. [e.g. if you want to learn MP math read
> > it]. If all you want todo is hack math together well you'll get lost
> > quick. But if that is your pleasure... you can just read the source
> > code itself and skip the book.
> >
> > Seriously though if you want to learn bignum "MP" math you have to
> > read a book on the subject [if not mine than say HAC or TAOCP].
> >
> > I'm not upset because you didn't read my book. I fully admit it's a
> > draft with some weak spots. However, if you're going to comment on it
> > at least have the decency to read the book in full first. If you just
> > don't like the book so be it. Don't just make random comments that
> > totally don't apply because you're a pissy little prick. I recommend
> > [in order] HAC then TAOCP for learning MP math.
> >
> > I do recommend you learn MP math though. Experimenting is cool and
> > all but it's more efficient to also have resources so when people
> > mention things like sliding windows or montgomery reduction [or
> > whatnot] you're not totally stuck in the mud.
> >
>
>
> Well, guess what: I didn't actually need a book. Rather I just looked at some
> people's
> code to learn the basic algorithms (example code is nice becuase it shows you
> what the
> points of a WORKING, and not a "toy" implementation are), and then wrote my own
> code.
"toy" implementation? What is that supposed to mean? Last I checked
LibTomMath comes with real working code.
Tom
- Next message: Tom St Denis: "Re: Countering chosen-plaintext attacks"
- Previous message: dsr_at_Florence.edu: "Re: Packet timing to send key bits"
- In reply to: mike3: "Re: RSA Blinding"
- Next in thread: mike3: "Re: RSA Blinding"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|