US5627893A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cryptographic method
Assignee: Telstra Corp Ltd
•
Filing: 1993-12-20
•
Granted: 1997-05-06
•
Expires: 2013-12-20
Abstract
Abstract A cryptographic method including selecting secret keys p and q, being prime numbers greater than 3, selecting public parameters for a series of data values which belong to one of a plurality of pairs of groups whereby any one of the data values in one of the pairs of groups is recovered by performing an operation kN i +1 times modulo n beginning with the any one of the data values, where k is an integer, N i is the order of the ith pair of groups and n=p.q, selecting a public encryption key e which is a factor of kN i +1 for all i, and processing communications data as a member of one of the pairs of groups by performing the operation on the communications data, whereby the order N i of the pair of groups i that the communications data belongs to can be determined on the basis of p and q, and a secret decryption key d i can be determined using e.d i =kN i +1.
Inventors
- 👤 Nicholas Demytko
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 18:33
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/60; G06F7/72; G06F7/724; G06F7/725; H; H04; H04L; H04L9/00; H04L9/30; H04L9/3006; H04L9/302; H04L9/3066; H04L9/32; H04L9/3247
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
171 words
A cryptographic method including: selecting secret keys p and q, being prime numbers greater than 3; selecting public parameters for a series of data values which belong to one of a plurality of pairs of groups whereby any one of said data values in one of said pairs of groups is recovered by performing an operation kN i +1 times modulo n beginning with said any one of said data values, where k is an integer, N i is the order of the ith pair of groups and n=p.q; selecting a public encryption key e which is a factor of kN i +1 for all i; and processing communications data as a member of one of said pairs of groups by performing said operation on said communications data, whereby the order N i of the pair of groups i that said communications data belongs to can be determined on the basis of p and q, and a secret decryption key d i can be determined using e.d i =kN i +1.
Claim 2
Dependent Claim
171 words
A cryptographic method including: selecting secret keys p and q, being prime numbers greater than 3; selecting public parameters for a series of data values which belong to one of a plurality of pairs of groups whereby any one of said data values in one of said pairs of groups is recovered by performing an operation kN i +1 times modulo n beginning with said any one of said data values, where k is an integer, N i is the order of the ith pair of groups and n=p.q; selecting a public encryption key e which is a factor of kN i +1 for all i; and processing communications data as a member of one of said pairs of groups by performing said operation on said communications data, whereby the order N i of the pair of groups i that said communications data belongs to can be determined on the basis of p and q, and a secret decryption key d i can be determined using e.d i =kN i +1.
Claim 3
Dependent Claim
29 words
A cryptographic method as claimed in claim 1, including encrypting message data having a data value x to obtain ciphertext s by performing said operation e times on x.
Claim 4
Dependent Claim
62 words
A cryptographic method as claimed in claim 1, including decrypting ciphertext having a data value s by determining which one of said pairs of groups s belongs to and N i and d i for said one of said pairs of groups on the basis of e, p, q and said public parameters, and performing said operation d i times on s.
Claim 5
Dependent Claim
68 words
A cryptographic method as claimed in claim 1, including obtaining a digital signature, on message data having a data value x by determining which one of said pairs of groups x belongs to and N i and d i for said one of said pairs of groups on the basis of e, p and q and said public parameters, and performing said operation d i times on x.
Claim 6
Dependent Claim
27 words
A cryptographic method as claimed in claim 1, including verifying a digital signature having a data value s by performing said operation e times to obtain plaintext.
Claim 7
Dependent Claim
31 words
A cryptographic method as claimed in claim 3, wherein only said ciphertext s, said public parameters and p and q are required to determine said one of said pairs of groups.
Claim 8
Dependent Claim
32 words
A cryptographic method as claimed in claim 4, wherein only said message data x, said public parameters and p and q are required to determine said one of said pairs of groups.
Claim 9
Dependent Claim
21 words
A cryptographic method as claimed in claim 1, wherein said pairs of groups include complementary groups which include indeterminate data values.
Claim 10
Dependent Claim
24 words
A cryptographic method as claimed in claim 1, wherein said parameters are parameters of curve and said data values represent points on said curve.
Claim 11
Dependent Claim
13 words
A cryptographic method as claimed in claim 9, wherein said curve is elliptic.
Claim 12
Dependent Claim
44 words
A cryptographic method as claimed in claim 10, wherein said curve includes said points (x,y) such that y.sup.2 =x.sup.3 +ax+b(mod n) where a and b are said public parameters and gcd (4a 3 +27b 2 , n)=1, and said data values represent x coordinates.
Claim 13
Dependent Claim
29 words
A cryptographic method as claimed in claim 11, wherein said operation is a point multiplication on said curve denoted by the symbol #, such that (x,y)#{kN.sub.i +1}≡(x,y)#e.d.sub.i ≡(x,y)(mod n).
Claim 14
Dependent Claim
28 words
A cryptographic method as claimed in claim 12, wherein y may be indeterminate and equal u√v where u is an integer and v is a fixed quadratic non-residue.
Claim 15
Dependent Claim
99 words
A cryptographic method as claimed in claim 13, wherein for a point (s,t) obtained by performing said operation on a point (x,y), (s,t) belongs to one of four of said pairs of groups, i equal to 1, 2, 3 or 4, where ##EQU13## α and β being constants such that let |α|≦2√p and |β|≦2√q and ##EQU14## being the Legendre symbol, whereby said one of said pairs of groups has an order N 1 , N 2 , N 3 or N 4 and corresponding decryption key d 1 , d 2 , d 3 or d 4 , respectively.
Claim 16
Dependent Claim
26 words
A cryptographic method as claimed in claim 14, including encrypting plaintext having a data value x to obtain ciphertext s by performing the following (s,t)≡(x,y)#e(mod n).
Claim 17
Dependent Claim
27 words
A cryptographic method as claimed in claim 14, including decrypting ciphertext having a data value s to obtain plaintext x by performing the following (x,y)≡(s,t)#d.sub.i (mod n).
Claim 18
Dependent Claim
40 words
A cryptographic method as claimed in claim 14, including obtaining a digital signature having data value s on plaintext x by performing the following (s,t)≡(x,y)#d.sub.i (mod n) and substituting z for w to determine N i and d i .
Claim 19
Dependent Claim
28 words
A cryptographic method as claimed in claim 14, including verifying a digital signature having a data value s to obtain plaintext x by performing the following (x,y)≡(s,t)#e(mod n).
Claim 20
Dependent Claim
85 words
A cryptographic method as claimed in claim 14, wherein x=X/Z (mod n) and y=Y/Z (mod n) and (x j , y j )≡(X j /Z j , Y j , Z j (X/Z, Y/Z)#j(mod n), and points in said groups are obtained using the following X.sub.2j ≡(X.sub.j.sup.2 -aZ.sub.j.sup.2).sup.2 -8bX.sub.j Z.sub.j.sup.3 ( mod n) Z.sub.2j ≡4Z.sub.j (X.sub.j.sup.3 +aX.sub.j Z.sub.j.sup.2 +bZ.sub.j.sup.3) (mod n) X.sub.2j+1 ≡Z[4bZ.sub.j.sup.2 Z.sup.2.sub.j+1 +2(aZ.sub.j Z.sub.j+1 +X.sub.j X.sub.j+1) (X.sub.j Z.sub.j+1 +X.sub.j+1 Z.sub.j)]-X(X.sub.j Z.sub.j+1 -X.sub.j+1 Z.sub.j).sup.2 (mod n) Z.sub.2j+1 ≡Z(X.sub.j Z.sub.j+1 -X.sub.j+1 Z.sub.j).sup.2 (mod n). 20.
Claim 21
Dependent Claim
32 words
A cryptographic method as claimed in claim 19, including encrypting plaintext having a data value x to obtain ciphertext s using the following s≡x.sub.e ≡X.sub.e /Z.sub.e (mod n) where X=x and Z=1.
Claim 22
Dependent Claim
31 words
A cryptographic method as claimed in claim 19, including decrypting ciphertext having a data value s to obtain plaintext x using the following x≡s.sub.di S.sub.di Z.sub.di (mod n) where S=s, Z=1.
Claim 23
Dependent Claim
45 words
A cryptographic method as claimed in claim 19, including generating a digital signature having a data value s from plaintext x using the following s≡X.sub.di /Z.sub.di (mod n) where X=x, Z=1 and to determine N i and d i , z is substituted for w.
Claim 24
Dependent Claim
34 words
A cryptographic method as claimed in claim 19, including verifying a digital signature having a data value s to obtain plaintext x by performing the following: x≡S.sub.e /Z.sub.e (mod n) where S=s and Z=1.
References Cited (Backward Citations)
JPS63217739A
Cited
US4933970A
Cited
DE3905824A1
Cited
US4935962A
Cited
US4944007A
Cited
WO1992014318A1
Cited
US5146500A
Cited
US5272755A
Cited
US5159632A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-05-05 | 2000-11-04 | 2001-05-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-05-05 | 2004-11-04 | 2005-05-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-05-05 | 2008-11-04 | 2009-05-06 | $7700.00 | Window Closed / Lapsed |