Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
189 words
A method of generating key values for use in public key cryptography by a requesting entity, including the step of generating at a parent entity, public key values N, e, where N is the product of first and second prime numbers P,Q and e is a corresponding public key integer value, comprising: selecting, at said parent entity, third and fourth prime numbers R,S; transmitting to said requesting entity a first value N mi and a second value Φ(N mi ) where said first value N mi =N·R·S and where said second value Φ(N mi )=Φ(N)·(R-1)·(S-1), wherein the symbol Φ represents Euler's totient function; selecting, at said requesting entity, fifth and sixth prime numbers, T,U; and computing, at said requesting entity, a third value N m and a fourth value d m , where N m =N mi ·T·U, and where d m =[1+K Φ(N m )]/e; wherein Φ(N m )=Φ(N mi )·(T-1)·(U-1); and wherein K and d m are integers, whereby d m is adapted to be used by said requesting entity as a secret key counterpart of the public key value e with respect to N m .
Claim 2
Independent Claim
189 words
A method of generating key values for use in public key cryptography by a requesting entity, including the step of generating at a parent entity, public key values N, e, where N is the product of first and second prime numbers P,Q and e is a corresponding public key integer value, comprising: selecting, at said parent entity, third and fourth prime numbers R,S; transmitting to said requesting entity a first value N mi and a second value Φ(N mi ) where said first value N mi =N·R·S and where said second value Φ(N mi )=Φ(N)·(R-1)·(S-1), wherein the symbol Φ represents Euler's totient function; selecting, at said requesting entity, fifth and sixth prime numbers, T,U; and computing, at said requesting entity, a third value N m and a fourth value d m , where N m =N mi ·T·U, and where d m =[1+K Φ(N m )]/e; wherein Φ(N m )=Φ(N mi )·(T-1)·(U-1); and wherein K and d m are integers, whereby d m is adapted to be used by said requesting entity as a secret key counterpart of the public key value e with respect to N m .
Claim 3
Dependent Claim
29 words
A method according to claim 1 wherein said parent entity includes storage means, said method further comprising: storing the values of N, Φ(N) and e in said storage means.
Claim 4
Dependent Claim
32 words
A method according to claim 2, further comprising: storing in said storage means an identification code identifying said requesting entity, said first value N mi and said second value Φ(N mi ).
Claim 5
Dependent Claim
45 words
A method according to claim 3 wherein said requesting entity includes further storage means, said method further comprising: computing, at said requesting entity, a fifth value N mv , where N mv =N m /N; and storing said fifth value in said further storage means.
Claim 6
Dependent Claim
37 words
A method according to claim 4, further comprising: multiplying the value N mv by the value N to yield the value N m , utilization of which, with the value e, enables the verification of digital signatures.
Claim 7
Dependent Claim
17 words
A method according to claim 6 wherein said public key integer value e is a prime number.
Claim 8
Dependent Claim
36 words
A method according to claim 4, further comprising: multiplying the value N mv by the value N to yield the value N m , utilization of which, with the value e, enables the enciphering of data.
Claim 9
Dependent Claim
17 words
A method according to claim 1 wherein said public key integer value e is a prime number.