Re: RSA claims 33 and 37 of U.S. patent 4,405,829

Thread View: sci.crypt

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Dane C. Butzer Wed, 07 Oct 1992 14:52

#993

Author: Dane C. Butzer
Date: Wed, 07 Oct 1992 14:52

17 lines
1170 bytes

Just another (possibly naive) thought,

Isn't it true that any ploynonmial in a computer is by default:

        polynomial mod 2^n

n being the length in bits of the variable used to store the
solution?  And weren't there at least a few encrpytion programs with
polynomials in them before RSA?  Couldn't this be prior art, too?  Or
does prior art have to be intentional (ie. yes, the equations were mod
2^n, but that wasn't on purpose...)?  Comments?


Dane Butzer
_______________________________________________________________________
Standard disclaimer applies...
-----------------------------------------------------------------------

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads