US5220606A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cryptographic system and method
Assignee: Individual
•
Filing: 1992-02-10
•
Granted: 1993-06-15
•
Expires: 2012-02-10
Abstract
Abstract I present a cryptographic communications system and method. The system includes a communications channel that is coupled to an encryption device and to a decryption device. A sender's plaintext message is encoded into ciphertext at the encryption device by first transforming the plaintext into a number sequence M. The encryption device couples the sender's signature S with an encoding key K to convert M into a ciphertext C. Ciphertext C is then transmitted over the communications channel to the intended receiver of the message. The receiver's decryption device acquires the ciphertext C. The decryption device takes the sender's signature S and the encoding key K and develops an inverted form of S which is the sequence T. The device uses T and K to decode C and obtain the digital message M. Sequence M is then converted to the original plaintext message. The sender's signature S is known at the encryption and decryption devices. S is kept secret from unauthorized persons. The encoding key K is developed by either of two alternatives. In one alternative, K is calculated as a sequence of numbers from the coupling of S with a sequence of random numbers R. In a second alternative, a sequence of random numbers R is developed in special relation to S and the encoding key K is then taken equal to R. In both alternatives, the sequence of random numbers R may be public. Any eavesdropper must have knowledge of the sender's signature S to decode the plaintext message. The cryptographic method for encryption, decryption, encoding key formation entails the consideration of each of the number sequences M, S, K, C, T, and R as the coefficients of polynomials that are in the finite field Z p of integers modulo the prime number p. The theory involved in the study of polynomials of this nature comes under the heading of Galois field theory. The calculations in the invention follow Galois theory but are performed using only the coefficients and not the actual polynomials.
Inventors
- 👤 Harold Greenberg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 11:15
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/30; H04L9/3006; H04L9/3026; H04L9/3066
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
378 words
A method for establishing cryptographic communications between a sender and a receiver; said method developed at said sender comprising the steps of: A. considering a sequence of digital message words M={m.sub.0, m.sub.1, . . . , m.sub.r }, 1≦m.sub.i ≦p-1, p a prime number, B. regarding the polynomial form of M as M.sub.1 =m.sub.0 +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r ; C. using said sender's signature number sequence S={s.sub.0, s.sub.1, . . . , s.sub.n }, 1≦s.sub.i ≦p-1, as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; D. developing an encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }, with polynomial form K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u ; E. transforming said digital message words M into a sequence of ciphertext words C as coefficients of the polynomial defined by C.sub.1 =S.sub.1 M.sub.1 mod(K.sub.1 and p) that results in C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v and ciphertext C={c.sub.0, c.sub.1, . . . , c.sub.v }, which is then sent to an authorized receiver; said method developed at said receiver comprises the additional steps of: F. considering said acquired ciphertext C={c.sub.0, c.sub.1, . . . , c.sub.v }, in its polynomial form C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v ; G. using said sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n } as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; H. using said encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u } as the polynomial form K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u ; I. using T, an inverse sequence to S, as T={t.sub.0, t.sub.1, t.sub.2, . . . , t.sub.g } with polynomial form T.sub.1 =t.sub.0 +t.sub.1 x+t.sub.2 x.sup.2 + . . . +t.sub.g x.sup.g where S.sub.1 T.sub.1 =1 mod(K.sub.1 and p); J. transforming said ciphertext words C into said digital message words M from the coefficients of the polynomial M 1 defined by M.sub.1 =C.sub.1 T.sub.1 mod(K.sub.1 and p), which results in M.sub.1 =m.sub.0 +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r with said original digital message words being M={m.sub.0, m.sub.1, . . . , m.sub.r }.
Claim 2
Independent Claim
378 words
A method for establishing cryptographic communications between a sender and a receiver; said method developed at said sender comprising the steps of: A. considering a sequence of digital message words M={m.sub.0, m.sub.1, . . . , m.sub.r }, 1≦m.sub.i ≦p-1, p a prime number, B. regarding the polynomial form of M as M.sub.1 =m.sub.0 +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r ; C. using said sender's signature number sequence S={s.sub.0, s.sub.1, . . . , s.sub.n }, 1≦s.sub.i ≦p-1, as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; D. developing an encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }, with polynomial form K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u ; E. transforming said digital message words M into a sequence of ciphertext words C as coefficients of the polynomial defined by C.sub.1 =S.sub.1 M.sub.1 mod(K.sub.1 and p) that results in C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v and ciphertext C={c.sub.0, c.sub.1, . . . , c.sub.v }, which is then sent to an authorized receiver; said method developed at said receiver comprises the additional steps of: F. considering said acquired ciphertext C={c.sub.0, c.sub.1, . . . , c.sub.v }, in its polynomial form C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v ; G. using said sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n } as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; H. using said encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u } as the polynomial form K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u ; I. using T, an inverse sequence to S, as T={t.sub.0, t.sub.1, t.sub.2, . . . , t.sub.g } with polynomial form T.sub.1 =t.sub.0 +t.sub.1 x+t.sub.2 x.sup.2 + . . . +t.sub.g x.sup.g where S.sub.1 T.sub.1 =1 mod(K.sub.1 and p); J. transforming said ciphertext words C into said digital message words M from the coefficients of the polynomial M 1 defined by M.sub.1 =C.sub.1 T.sub.1 mod(K.sub.1 and p), which results in M.sub.1 =m.sub.0 +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r with said original digital message words being M={m.sub.0, m.sub.1, . . . , m.sub.r }.
Claim 3
Independent Claim
184 words
A method for developing an encoding key K and a random signature inversion T comprising the steps of: A. using a sender's signature number sequence S={s.sub.0, s.sub.1, . . . , s.sub.n }, 1≦s.sub.i ≦p-1, p a prime number, as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; B. developing a sequence of random digits R={r.sub.0, r.sub.1, . . . , r.sub.s }, 1≦r.sub.i ≦p-1, with polynomial form R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s ; C. producing said encoding key K from the coefficients of the polynomial K 1 defined by K.sub.1 =S.sub.1 R.sub.1 -1 mod p, which results in K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u and the encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }; D. obtaining the inverse of signature S from the result S.sub.1 R.sub.1 =1 mod(K.sub.1 and p), which produces T 1 =R 1 as the inverse polynomial to S 1 and T=R as the inverse of S with T in the form T={t.sub.0, t.sub.1, t.sub.2, . . . ,t.sub.g }.
Claim 4
Independent Claim
184 words
A method for developing an encoding key K and a random signature inversion T comprising the steps of: A. using a sender's signature number sequence S={s.sub.0, s.sub.1, . . . , s.sub.n }, 1≦s.sub.i ≦p-1, p a prime number, as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; B. developing a sequence of random digits R={r.sub.0, r.sub.1, . . . , r.sub.s }, 1≦r.sub.i ≦p-1, with polynomial form R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s ; C. producing said encoding key K from the coefficients of the polynomial K 1 defined by K.sub.1 =S.sub.1 R.sub.1 -1 mod p, which results in K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u and the encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }; D. obtaining the inverse of signature S from the result S.sub.1 R.sub.1 =1 mod(K.sub.1 and p), which produces T 1 =R 1 as the inverse polynomial to S 1 and T=R as the inverse of S with T in the form T={t.sub.0, t.sub.1, t.sub.2, . . . ,t.sub.g }.
Claim 5
Independent Claim
185 words
A method for developing a random encoding key K with the further development of a signature inversion T comprising the steps of: A. using a sender's signature number sequence S={s.sub.0, s.sub.1, . . . , s.sub.n }, 1≦s.sub.i ≦p-1, p a prime number, as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; B. developing a sequence of random digits R={r.sub.0, r.sub.1, . . . , r.sub.s }, 1≦r.sub.i ≦p-1, with polynomial form R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s so that GCD(S 1 , R 1 )=1; C. taking K 1 =R 1 , which produces K=R as the encoding key and the form of K as K={k.sub.0, k.sub.1, . . . , k.sub.u }; D. determining the inverse of signature S from the calculation of the T 1 that satisfies S.sub.1 T.sub.1 =1 mod(K.sub.1 and p) and produces T.sub.1 =t.sub.0 +t.sub.1 x+t.sub.2 x.sup.2 + . . . +t.sub.g x.sup.g as the inverse polynomial to S 1 with the inverse of S as in the form T={t.sub.0, t.sub.1, t.sub.2, . . . ,t.sub.g }.
Claim 6
Independent Claim
185 words
A method for developing a random encoding key K with the further development of a signature inversion T comprising the steps of: A. using a sender's signature number sequence S={s.sub.0, s.sub.1, . . . , s.sub.n }, 1≦s.sub.i ≦p-1, p a prime number, as the polynomial form S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n ; B. developing a sequence of random digits R={r.sub.0, r.sub.1, . . . , r.sub.s }, 1≦r.sub.i ≦p-1, with polynomial form R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s so that GCD(S 1 , R 1 )=1; C. taking K 1 =R 1 , which produces K=R as the encoding key and the form of K as K={k.sub.0, k.sub.1, . . . , k.sub.u }; D. determining the inverse of signature S from the calculation of the T 1 that satisfies S.sub.1 T.sub.1 =1 mod(K.sub.1 and p) and produces T.sub.1 =t.sub.0 +t.sub.1 x+t.sub.2 x.sup.2 + . . . +t.sub.g x.sup.g as the inverse polynomial to S 1 with the inverse of S as in the form T={t.sub.0, t.sub.1, t.sub.2, . . . ,t.sub.g }.
Claim 7
Dependent Claim
532 words
A cryptographic system for sending messages over a communications channel comprising: an encryption system and a decryption system, said encryption system including, a first input means for inserting a plaintext message in alphanumeric form into said encryption system; a converter means coupled to said input means for transforming the plaintext message from its alphanumeric form into a digital form M={m.sub.0, m.sub.1, . . . , m.sub.r }; a first signature storage means for obtaining a message sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a second input means for inserting an encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }, into the system; an encoder means coupled to said converter means, said signature storage means, and said second input means for linking said digital message M, said signature S, and said encoding key K to obtain an encoded form of the message by said encoder means considering M, K, and S as converted to their polynomial forms M.sub.1 =m.sub.O +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r, K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u, S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n, and developing a ciphertext C as the coefficients of the polynomial C 1 produced from C.sub.1 =S.sub.1 M.sub.1 mod(K.sub.1 and p) as given by C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v, with result that said ciphertext is C={c.sub.0, c.sub.1, . . . , c.sub.v }; a transmitting means coupled to said encoder means for sending said ciphertext C over said communications channel; and said decryption system having, a receiving means for acquiring the ciphertext C={c.sub.0, c.sub.1, . . . , c.sub.v } from said communications channel for insertion into said decryption system; a second signature storage means for obtaining the sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a third input means for inserting the encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u } into said decryption system; a decoder means coupled to said receiving means, said second signature storage means, and third input means for determining T, the inverted form of the signature S, and the digital message M by said decoder means considering S and K as converted to their polynomial forms S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n, K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u u.sup.u, developing T as the coefficients of the polynomial T 1 produced from S.sub.1 T.sub.1 =1 mod(K.sub.1 and p) with result that T.sub.1 =t.sub.0 +t.sub.1 x+t.sub.2 x.sup.2 + . . . +t.sub.g x.sup.g and T={t.sub.0, t.sub.1, t.sub.2, . . . , t.sub.g } and then linking T with the ciphertext C, considered in its polynomial form C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v, and the encoding key K to obtain the digital message M as the coefficients of the polynomial M 1 defined by M.sub.1 =C.sub.1 T.sub.1 mod(K.sub.1 and p), with result M.sub.1 =m.sub.0 +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r and digital message M={m.sub.0, m.sub.1, . . . , m.sub.r }; a converter means coupled to said decoder means for transforming the digital message M into the original plaintext message.
Claim 8
Dependent Claim
532 words
A cryptographic system for sending messages over a communications channel comprising: an encryption system and a decryption system, said encryption system including, a first input means for inserting a plaintext message in alphanumeric form into said encryption system; a converter means coupled to said input means for transforming the plaintext message from its alphanumeric form into a digital form M={m.sub.0, m.sub.1, . . . , m.sub.r }; a first signature storage means for obtaining a message sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a second input means for inserting an encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }, into the system; an encoder means coupled to said converter means, said signature storage means, and said second input means for linking said digital message M, said signature S, and said encoding key K to obtain an encoded form of the message by said encoder means considering M, K, and S as converted to their polynomial forms M.sub.1 =m.sub.O +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r, K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u, S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n, and developing a ciphertext C as the coefficients of the polynomial C 1 produced from C.sub.1 =S.sub.1 M.sub.1 mod(K.sub.1 and p) as given by C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v, with result that said ciphertext is C={c.sub.0, c.sub.1, . . . , c.sub.v }; a transmitting means coupled to said encoder means for sending said ciphertext C over said communications channel; and said decryption system having, a receiving means for acquiring the ciphertext C={c.sub.0, c.sub.1, . . . , c.sub.v } from said communications channel for insertion into said decryption system; a second signature storage means for obtaining the sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a third input means for inserting the encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u } into said decryption system; a decoder means coupled to said receiving means, said second signature storage means, and third input means for determining T, the inverted form of the signature S, and the digital message M by said decoder means considering S and K as converted to their polynomial forms S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n, K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u u.sup.u, developing T as the coefficients of the polynomial T 1 produced from S.sub.1 T.sub.1 =1 mod(K.sub.1 and p) with result that T.sub.1 =t.sub.0 +t.sub.1 x+t.sub.2 x.sup.2 + . . . +t.sub.g x.sup.g and T={t.sub.0, t.sub.1, t.sub.2, . . . , t.sub.g } and then linking T with the ciphertext C, considered in its polynomial form C.sub.1 =c.sub.0 +c.sub.1 x+c.sub.2 x.sup.2 + . . . +c.sub.v x.sup.v, and the encoding key K to obtain the digital message M as the coefficients of the polynomial M 1 defined by M.sub.1 =C.sub.1 T.sub.1 mod(K.sub.1 and p), with result M.sub.1 =m.sub.0 +m.sub.1 x+m.sub.2 x.sup.2 + . . . +m.sub.r x.sup.r and digital message M={m.sub.0, m.sub.1, . . . , m.sub.r }; a converter means coupled to said decoder means for transforming the digital message M into the original plaintext message.
Claim 9
Independent Claim
151 words
A system for developing an encoding key K comprising: a signature storage means for obtaining a message sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a random number generator means for obtaining a string of random numbers R={r.sub.0, r.sub.1, . . . , r.sub.s }; a key creator means coupled to said signature storage means and said random number generator means for developing an encoding key K by said key creator means considering S and R as the polynomials forms S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s and developing the encoding key K as the coefficients of the polynomial K 1 , defined by K.sub.1 =S.sub.1 R.sub.1 -1 mod p, as K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u with resulting encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }.
Claim 10
Independent Claim
151 words
A system for developing an encoding key K comprising: a signature storage means for obtaining a message sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a random number generator means for obtaining a string of random numbers R={r.sub.0, r.sub.1, . . . , r.sub.s }; a key creator means coupled to said signature storage means and said random number generator means for developing an encoding key K by said key creator means considering S and R as the polynomials forms S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s and developing the encoding key K as the coefficients of the polynomial K 1 , defined by K.sub.1 =S.sub.1 R.sub.1 -1 mod p, as K.sub.1 =k.sub.0 +k.sub.1 x+k.sub.2 x.sup.2 + . . . +k.sub.u x.sup.u with resulting encoding key K={k.sub.0, k.sub.1, . . . , k.sub.u }.
Claim 11
Independent Claim
186 words
A system for developing an encoding key K comprising: a signature storage means for obtaining a message sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a random number generator means for obtaining a string of random numbers R={r.sub.0, r.sub.1, . . . , r.sub.s }; a greatest common divisor (GCD) tester means coupled to said signature storage means and said random number generator means for developing the encoding key K by said GCD tester means considering S and R as the polynomials forms S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s and obtaining a suitable R, with the property that GCD(S 1 , R 1 )=1 modulo p, with the result that the encoding key is given by K=R and is of the form K={k.sub.0, k.sub.1, . . . , k.sub.u }; when no suitable R is obtained, the GCD is not one, said GCD tester means signals said random number generator means to develop a new string of random numbers R for testing and producing the encoding key K.
Claim 12
Independent Claim
186 words
A system for developing an encoding key K comprising: a signature storage means for obtaining a message sender's signature S={s.sub.0, s.sub.1, . . . , s.sub.n }; a random number generator means for obtaining a string of random numbers R={r.sub.0, r.sub.1, . . . , r.sub.s }; a greatest common divisor (GCD) tester means coupled to said signature storage means and said random number generator means for developing the encoding key K by said GCD tester means considering S and R as the polynomials forms S.sub.1 =s.sub.0 +s.sub.1 x+s.sub.2 x.sup.2 + . . . +s.sub.n x.sup.n R.sub.1 =r.sub.0 +r.sub.1 x+r.sub.2 x.sup.2 + . . . +r.sub.s x.sup.s and obtaining a suitable R, with the property that GCD(S 1 , R 1 )=1 modulo p, with the result that the encoding key is given by K=R and is of the form K={k.sub.0, k.sub.1, . . . , k.sub.u }; when no suitable R is obtained, the GCD is not one, said GCD tester means signals said random number generator means to develop a new string of random numbers R for testing and producing the encoding key K.
References Cited (Backward Citations)
US4165444A
Cited
US4797921A
Cited
US4972475A
Cited
US4878246A
Cited
US5031129A
Cited
US5008938A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-06-14 | 1996-12-14 | 1997-06-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-06-14 | 2000-12-14 | 2001-06-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-06-14 | 2004-12-14 | 2005-06-15 | $7700.00 | Window Closed / Lapsed |