Patent US5889865A successfully refreshed from Google Patents.
US5889865A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Key agreement and transport protocol with implicit signatures
Assignee: Certicom Corp
•
Filing: 1996-10-18
•
Granted: 1999-03-30
•
Expires: 2016-10-18
Abstract
Abstract A key establishment protocol between a pair of correspondents includes the generation by each correspondent of respective signatures. The signatures are derived from information that is private to the correspondent and information that is public. After exchange of signatures, the integrity of exchange messages can be verified by extracting the public information contained in the signature and comparing it with information used to generate the signature. A common session key may then be generated from the public and private information of respective ones of the correspondents.
Inventors
- 👤 Scott A. Vanstone
- 👤 Alfred John Menezes
- 👤 Mingua Qu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 16:36
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/08; H04L9/0816; H04L9/0838; H04L9/0841; H04L9/0844
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
232 words
A method of authenticating a pair of correspondents A,B to permit exchange of information therebetween, each of said correspondents having a respective private key a,b and a public key p A ,p B derived from a generator α and respective ones of said private keys a,b, said method including the steps of i) a first of said correspondents A selecting a first random integer x and exponentiating a function f(α) including said generator to a power g.sup.(x) to provide a first exponentiated function f(α) g (x) ; ii) said first correspondent A generating a first signature s A from said random integer x and said exponentiated function f(α) g (x) ; iii) said first correspondent A forwarding to a second correspondent B a message including said first exponentiated function f(α) g (x) ; iv) said correspondent B selecting a second random integer y and exponentiating a function f'(α) including said generator to a power g.sup.(y) to provide a second exponentiated function f'(α) g (y) and generating a signature S B obtained from said second integer y and said second exponentiated function f'(α) g (y) ; v) said second correspondent B forwarding a message to said first correspondent A including said second exponential function f'(α) g (y) ; vi) each of said correspondents constructing a session key K by exponentiating information made public by another correspondent with information that is private to themselves.
Claim 2
Independent Claim
232 words
A method of authenticating a pair of correspondents A,B to permit exchange of information therebetween, each of said correspondents having a respective private key a,b and a public key p A ,p B derived from a generator α and respective ones of said private keys a,b, said method including the steps of i) a first of said correspondents A selecting a first random integer x and exponentiating a function f(α) including said generator to a power g.sup.(x) to provide a first exponentiated function f(α) g (x) ; ii) said first correspondent A generating a first signature s A from said random integer x and said exponentiated function f(α) g (x) ; iii) said first correspondent A forwarding to a second correspondent B a message including said first exponentiated function f(α) g (x) ; iv) said correspondent B selecting a second random integer y and exponentiating a function f'(α) including said generator to a power g.sup.(y) to provide a second exponentiated function f'(α) g (y) and generating a signature S B obtained from said second integer y and said second exponentiated function f'(α) g (y) ; v) said second correspondent B forwarding a message to said first correspondent A including said second exponential function f'(α) g (y) ; vi) each of said correspondents constructing a session key K by exponentiating information made public by another correspondent with information that is private to themselves.
Claim 3
Dependent Claim
20 words
A method of claim 1 wherein said message forwarded by said first correspondent includes an identification of the first correspondent.
Claim 4
Dependent Claim
21 words
A method according to claim 1 wherein said message forwarded by said second correspondent includes an identification of said second correspondent.
Claim 5
Dependent Claim
21 words
A method according to claim 3 wherein said message forwarded by said first correspondent includes an identification of the first correspondent.
Claim 6
Dependent Claim
18 words
A method according to claim 1 wherein said first function including said generator f(α) is said generator itself.
Claim 7
Dependent Claim
18 words
A method according to claim 1 wherein said second function f(α) including said generator is said generator itself.
Claim 8
Dependent Claim
18 words
A method according to claim 6 wherein said first function f(α) including said generator is said generator itself.
Claim 9
Dependent Claim
24 words
A method according to claim 1 wherein said first function including said generator f(α) includes the public key p S of said second correspondent.
Claim 10
Dependent Claim
25 words
A method according to claim 1 wherein said second f unction including said generator f'α includes the public key p A of said first correspondent.
Claim 11
Dependent Claim
30 words
A method according to claim 1 wherein said signature generated by a respective one of the correspondents cosine the random integer, exponentiated function and private key of that one correspondent.
Claim 12
Dependent Claim
22 words
A method according to claim 10 wherein said signature of correspondent A is of the form x-r A aα a mod (p-1).
Claim 13
Dependent Claim
95 words
A method according to claim 11 wherein said correspondent A selects a second integer x 1 and forwards r A .sbsb.1 to correspondent B where r A .sbsb.1 =α x .sbsp.1 and said correspondent B selects a second random integer y 1 and sends r B .sbsb.1 to correspondent A, where r B .sbsb.1 =α y .sbsp.1 each of said correspondents computing a pair of keys k 1 ,k 2 equivalent to α xy and α x .sbsp.1 y .sbsp.1 respectively, said session key K being generated by XORing k 1 and k 2 .
Claim 14
Dependent Claim
24 words
A method according to claim 10 wherein said signature of correspondent A is of the form x+aα a (p B ) x mod (p-1).
Claim 15
Dependent Claim
45 words
A method according to claim 10 wherein said signature of correspondent A is of the form xr x .sbsb.1 -(r A ) r .sbsp.x.sbsp.1 a mod (p-1) where x 1 is a second random integer selected by A and r x .sbsb.1 =α x .sbsp.1.
Claim 16
Dependent Claim
24 words
A method according to claim 10 wherein said signature of correspondent B is of the form y B -r B bα b mod (p-1).
Claim 17
Dependent Claim
24 words
A method according to claim 10 wherein said signature of correspondent B is of the form y+bα b (p A ) y mod (p-1).
Claim 18
Dependent Claim
45 words
A method according to claim 10 wherein said signature of correspondent B is of the form yr y .sbsb.1 -(r B ) r .sbsp.y.sbsp.1 b mod (p-1) where y 1 is a second integer selected by correspondent B and r y .sbsb.1 =α y .sbsp.1.
References Cited (Backward Citations)
US4991210A
Cited
US4996711A
Cited
US5199070A
Cited
US5299262A
Cited
US5442707A
Cited
US5299263A
Cited
US5406628A
Cited
US5600725A
Cited
US5347581A
Cited
US5661806A
Cited
US5761305A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-03-29 | 2002-09-28 | 2003-03-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-29 | 2006-09-28 | 2007-03-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-29 | 2010-09-28 | 2011-03-30 | $7700.00 | Window Closed / Lapsed |