1994-05-17 - Re: Rabin

Header Data

From: Karl Lui Barrus <klbarrus@owlnet.rice.edu>
To: cypherpunks@toad.com
Message Hash: 813e13de7a9eb586125ffae3c5aa241042f9a46475919d406c055bcf0707b959
Message ID: <9405170403.AA06808@flammulated.owlnet.rice.edu>
Reply To: N/A
UTC Datetime: 1994-05-17 04:03:32 UTC
Raw Date: Mon, 16 May 94 21:03:32 PDT

Raw message

From: Karl Lui Barrus <klbarrus@owlnet.rice.edu>
Date: Mon, 16 May 94 21:03:32 PDT
To: cypherpunks@toad.com
Subject: Re: Rabin
Message-ID: <9405170403.AA06808@flammulated.owlnet.rice.edu>
MIME-Version: 1.0
Content-Type: text/plain


-----BEGIN PGP SIGNED MESSAGE-----

About Rabin (and you're welcome, Mr. Anonymous!)

Well, I looked at Schneier on p. 290 and I have to confess I'm
puzzled.  I'm sure these formulas weren't invented out of this air,
but I'm not sure why one of them must equal M.  (In the example worked
none are equal to M).  I would bet that this is a typo in the book;
check the errata sheet

I think the formulas are trying to say the following facts:

For the kinds of problems we are considering, 
If m1 = CRT(n,p,q,x1,x2)
   m2 = CRT(n,p,q,x1,q-x2)
   m3 = CRT(n,p,q,p-x1,x2)
   m4 = CRT(n,p,q,p-x1,q-x2)

then m4 = n - m1, m3 = n - m2

So you really don't need to do CRT four times; twice is good enough.

(In the example, m1 = 71, so m4 = 77 - 71 = 6
                 m2 = 50, so m3 = 77 - 50 = 27)

Karl Barrus
klbarrus@owlnet.rice.edu

-----BEGIN PGP SIGNATURE-----
Version: 2.3a

iQCVAgUBLdhB04OA7OpLWtYzAQEV3wQAjgcz1AI1ufFfzUpQmh35E0xbeD+PB4FV
mc72TL0v7lvjeK4aiGwEK8j/1vtzvw+1QCkSRTY6ATElx4HnskdV0yp4CT8WycPC
X/QmeYkqOr+Q4ed0dXgvjYOO++4FOBaqQUqRaTLLgB/BKndfDVbM683MGxtbLOSe
gCi3SP86CuU=
=REkP
-----END PGP SIGNATURE-----





Thread