Article View: sci.crypt
Article #1242Re: RSA claims 33 and 37 of U.S. patent 4,405,829
From: Jon Luckey
Date: Fri, 02 Oct 1992 16:36
Date: Fri, 02 Oct 1992 16:36
13 lines
1073 bytes
1073 bytes
rcain@netcom.com (Robert Cain) writes: >Further I would like to know if anyone is aware of any prior art (filing >was Dec. 14, 1977) using a polynomial as simple as C = M^2(mod n) even that >would invalidate this claim. In volume 2 of _The Art of Computer Programming_ (Semi-numerical Algorithms), Knuth mentions a "interesting alternative to the RSA scheme" based on C=M^2(mod x), which he calls a SQRT box. It was developed by Micheal Rabin, and is described in [MIT Lab. for Comp. Sc., report TR-212 (1979)]. I'd start by looking there, even though the report is dated 1979, the concept may go back before 1977.
Technical Details
Message-ID:
<1992Oct2.163604.19384@rtfm.mlb.fl.us>Path:
arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!sgiblab!darwin.sura.net!mlb.semi.harris.com!rtfm.mlb.fl.us!luckeyReferences:
<1992Oct1.192121.16796@netcom.com>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!sgiblab!darwin.sura.net!mlb.semi.harris.com!rtfm.mlb.fl.us!luckey From: luckey@rtfm.mlb.fl.us (Jon Luckey) Subject: Re: RSA claims 33 and 37 of U.S. patent 4,405,829 Message-ID: <1992Oct2.163604.19384@rtfm.mlb.fl.us> Organization: We don't need no stinkin' batches! References: <1992Oct1.192121.16796@netcom.com> Date: Fri, 2 Oct 1992 16:36:04 GMT Lines: 14