# US 2013/0159702 A1 · Combined digital certificate

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0159702 A1
- Document ID: US20130159702A1
- Status: Published application
- Kind: A1
- Application number: 13/326,837
- Filed: 2011-12-15
- Published: 2013-06-20
- Earliest claimed: 2011-12-15
- Assignees: Texas Instruments Incorporated
- Inventors: ERIC THIERRY PEETERS
- Web page: https://patentgrep.com/patent/US20130159702A1

## CPC

- H04L 9/3263: {involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements (network architectures or network communication protocols for supporting authentication of entities using certificates in a packet data network H04L63/0823)}
- H04L 9/006: {involving public key infrastructure [PKI] trust models (network architecture or network communication protocol for supporting authentication of entities using certificates in a packet data network H04L63/0823)}
- H04L 9/3066: {involving algebraic varieties, e.g. elliptic or hyper-elliptic curves}
- H04L 9/3268: {using certificate validation, registration, distribution or revocation, e.g. certificate revocation list [CRL]}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A system can comprise a memory to store computer readable instructions and a processing unit to access the memory and to execute the computer readable instructions. The computer readable instructions can comprise a certificate manager configured to request generation of N number of random values, where N is an integer greater than or equal to one. The certificate manager can also be configured to request a digital certificate from at least one certificate authority of at least two different certificate authorities. The request can include a given one of the N number of random values. The certificate manager can also be configured to generate a private key of a public-private key pair, wherein the private key is generated based on a private key of each of the least two certificate authorities.

## Claims

### Claim 1

A system comprising:
a memory to store computer readable instructions; and
a processing unit to access the memory and to execute the computer readable instructions;
wherein the computer readable instructions comprise:
a certificate manager configured to:
request generation of N number of random values, where N is an integer greater than or equal to one;
request a digital certificate from at least one certificate authority of at least two different certificate authorities, wherein the request includes a given one of the N number of random values; and
generate a private key of a public-private key pair, wherein the private key is generated based on a private key of each of the at least two different certificate authorities.

### Claim 2 (depends on 1)

The system of claim 1, wherein the certificate manager employs elliptic curve cryptography to generate the private key.

### Claim 3 (depends on 1)

The system of claim 1, wherein the at least two different certificate authorities comprises at least three different certificate authorities.

### Claim 4 (depends on 1)

The system of claim 1, wherein certificate manager is further configured to request another digital certificate from another of the at least two certificate authorities and wherein the digital certificate generated by each of the at least two different certificate authorities for the certificate manager are generated independently of each other.

### Claim 5 (depends on 1)

The system of claim 1, wherein a digital certificate generated by another certificate authority of the at least two different certificate authorities is generated based on data received from the given certificate authority of the at least two different certificate authorities.

### Claim 6 (depends on 1)

The system of claim 1, wherein the system is a crypto processor.

### Claim 7

A method for generating a combined digital certificate comprising:
generating, at a computer, N number of random values, wherein N is an integer greater or equal to two;
providing, from the computer, a request that includes a given one of the of the N number of random values to a corresponding certificate authority of N number of certificate authorities;
receiving, at the computer, a digital certificate from each of the N number of certificate authorities in response to the request;
generating, at the computer, a private key for the computer based on a combination of data received from each of the N number of certificate authorities; and
generating, at the computer, a combined digital certificate based on a combination of each digital certificate received from each of the N number of certificate authorities.

### Claim 8 (depends on 7)

The method of claim 7, wherein each digital certificate received from each of the N number of certificate authorities is generated based on elliptical curve cryptography.

### Claim 9 (depends on 8)

The method of claim 8, wherein each of the N number of random values characterizes a point on an elliptical curve.

### Claim 10 (depends on 9)

The method of claim 9, wherein a given digital certificate from the N number of certificate authorities comprises a set of numbers characterizing a point on the elliptical curve, wherein the point on the elliptical curve is calculated based on the given one of the of the N number of random values.

### Claim 11 (depends on 8)

The method of claim 8, wherein the private key for the computer is configured such that:
SKey
=
(
∑
i
=
1
N


s
i
+
r
i

e
i
)


(
mod


n
)
or
SKey
=
(
∑
i
=
1
N


(
s
i
+
r
i
)

∏
j
≠
i


e
j
)


(
mod


n
)
wherein:
SKey denotes the private key for the computer;
ri denotes the given one of the N random values generated by the computer;
ei denotes results of a hash function executed at a certificate authority i of the N number of certificate authorities;
si denotes an integer provided from the certificate authority i; and
n denotes a number of points on the elliptical curve.

### Claim 12 (depends on 7)

The method of claim 7, wherein the given one of the N number of random values is generated at a time of manufacture of the computer and a remainder of the N number of random value is generated after activation of the computer.

### Claim 13 (depends on 7)

The method of claim 7, wherein each digital certificate received from each of the N number of certificate authorities is generated independently from each other.

### Claim 14 (depends on 13)

The method of claim 13, wherein N is at least three.

### Claim 15

A method for generating a combined digital certificate comprising:
generating, at a computer, a random value;
providing the random value to a first of two certificate authorities;
receiving, at the computer, a digital certificate from a second of the two certificate authorities, wherein the digital certificate is based on a digital certificate generated at the first certificate authority;
generating, at the computer, a private key for the computer based on a number from each of the two certificate authorities; and
generating, at the computer, a combined digital certificate based on data included in the digital certificate received at the computer.

### Claim 16 (depends on 15)

The method of claim 15, further comprising generating a public key for the computer corresponding to the private key for the computer, wherein the public key is based on a public key of each of the two certificate authorities.

### Claim 17 (depends on 15)

The method of claim 15, wherein the digital certificate received from the second of the two certificate authorities is based on elliptical curve cryptography.

### Claim 18 (depends on 17)

The method of claim 17, wherein the private key for the computer is configured such that:
SKey=e(s1+r)+s2 mod n;
wherein:
SKey denotes the private key for the computer;
r denotes the random value generated by the computer;
s1 denotes an integer provided from the first certificate authority of the two certificate authorities;
s2 denotes an integer provided from the second certificate authority of the two certificate authorities;
e denotes results of a hash function executed at the second certificate authority of the two certificate authorities; and
n denotes a number of points in an elliptical curve employed to calculate s1 and s2.

### Claim 19 (depends on 18)

The method of claim 18, further comprising generating, at a third party, a public key corresponding to Skey.

### Claim 20 (depends on 17)

The method of claim 17, wherein the computer is a crypto processor.

### Claim 21

A non-transitory computer readable medium having computer executable instructions for performing a method, the method comprising:
requesting generation of N number of random values, where N is an integer greater than or equal to one;
requesting a digital certificate from at least one certificate authority of at least two different certificate authorities, wherein the request includes a given one of the N number of random values; and
requesting generation of a private key of a public-private key pair, wherein the private key is generated based on a private key of each of the at least two different certificate authorities.
