Back to results
US 11,888,970 B2Granted
Method and system for deriving key from basekey built-in chip
AssigneeMontage Electronics (Shanghai) Co., Ltd.
InventorZhaohui Du
Life of this patent
Estimating the term…
Abstract
The present disclosure provides systems and methods for deriving a key from a basekey built-in a chip is provided. In an exemplary embodiment, there is provided a method for deriving a key from basekey built-in a chip that may comprise obtaining a basekey built-in the chip and a current version number when the chip starts up and runs read-only boot code, and performing iterations on the basekey via a one-way function to obtain a derived key of the current version. The number of times of the iterations is equal to the difference between a maximum version number and the current version number.
Claims16
A method for deriving a key from a basekey built-in a chip, comprising:
- performing, by a hardware processor, steps of:
- obtaining a basekey built-in the chip and a current version number when the chip starts up and runs read-only boot code;
- constructing a oriented tree, each node in the oriented tree corresponds to a version, a topological order number of each node indicates a version number corresponding to the node, the basekey is located at a root node of the oriented tree, a version number of any node is smaller than a version number of its parent node,
- wherein the oriented tree adopts at least two different one-way functions;
- and
- performing iterations on the basekey by visiting the oriented tree in a topological order to obtain a derived key of a current version,
- wherein the step of performing iterations on the basekey by visiting the oriented tree in the topological order to obtain the derived key of the current version further comprises:
- hiding nodes with version numbers larger than the current version number in the oriented tree;
- and
- performing iterations on the basekey to generate derived keys of version numbers corresponding to all nodes whose parent nodes are hidden.
7 more elements
A system for deriving a key from a basekey built-in a chip, comprising:
- an acquisition module, configured to obtain a basekey built-in a chip and a current version number when the chip starts up and runs read-only boot code;
- a construction module, configured to construct an oriented tree, each node in the oriented tree corresponds to a version, a topological order number of each node indicates a version number corresponding to the node, the basekey is located at a root node of the oriented tree, a version number of any node is smaller than a version number of its parent node,
- wherein the oriented tree adopts at least two different one-way functions;
- a calculation module, configured to:
- perform iterations on the basekey by visiting the oriented tree in a topological order to obtain a derived key of a current version;
- hide nodes with version numbers larger than the current version number in the oriented tree;
- and
- perform iterations on the basekey to generate derived keys of version numbers corresponding to all nodes whose parent nodes are hidden;
- and
- a hardware processor that executes the acquisition module, the construction module, and the calculation module.
7 more elements
A method for deriving a key from a basekey built-in a chip, comprising:
- performing, by a hardware processor, steps of:
- obtaining a basekey built-in the chip and a current version number when the chip starts up and runs read-only boot code;
- constructing a oriented tree, each node in the oriented tree corresponds to a version, a topological order number of each node indicates a version number corresponding to the node, the basekey is located at a root node of the oriented tree, a version number of any node is smaller than a version number of its parent node,
- wherein the oriented tree adopts at least two different one-way functions,
- wherein the oriented tree is a two-dimensional matrix graph,
- wherein a first node in each row in the two-dimensional matrix graph comprises a longitudinal sub-node and a transverse sub-node, a last node in each row does not comprise any sub-node, and remaining nodes of the oriented tree each only comprises a transverse sub-node,
- wherein nodes in a first column in the two-dimensional matrix graph perform iterations via a first one-way function, and nodes in each row in the two-dimensional matrix graph perform iterations via a second one-way function, and
- wherein each topological order number of each node in each row decreases one by one, and the topological order number of the last node in each row is greater tha n that of all nodes on its next row;
- and
- performing iterations on the basekey by visiting the oriented tree in a topological order to obtain a derived key of a current version.
7 more elements
Dependencies are inferred from the claim text.