Data protection method, data protection device and micro-controller
AssigneeNuvoton Technology Corporation
InventorWei-Cheng Lin
Life of this patent
Estimating the term…
Abstract
A data protection method includes the following steps. Input data is split into a plurality of data groups. The original start-address of each data group and the data length of each data group are recorded. The data groups are reordered randomly. The reordered data groups constitute random data. The new start-address of each reordered data group is recorded. The original start-addresses, the data lengths, and the new start-addresses are collected to form a look-up table. The look-up table records the original start-addresses of the data groups and the new start-addresses of the reordered data groups. Each original start-address corresponds to one new start-address. The random data is stored in the storage memory. The look-up table is stored in the memory controller.
Claims18
A data protection method comprising:
- storing input data in a first storage memory;
- splitting the input data into a plurality of data groups;
- recording an original start-address of each data group and a data length of each data group;
- using a Binary-tree search method to reorder the sequence of the data groups, wherein the reordered data groups constitute random data;
- storing the random data in the first storage memory to replace the input data;
- recording a new start-address for each reordered data group;
- collecting the original start-addresses, the data lengths, and the new start-addresses to form a look-up table, wherein the look-up table records the original start-addresses of the data groups and the new start-addresses of the reordered data groups, and each original start-address corresponds to one new start-address;
- storing the random data into a second storage memory;
- and
- storing the look-up table into a memory controller.
A data protection device comprising:
- a reordering circuit splitting input data stored in a first storage memory into a plurality of data groups and recording an original start-address of each data group and a data length of each data group, wherein the reordering circuit uses a Binary-tree search method to reorder the sequence of the data groups, the reordered data groups constitute random data, the random data is stored in the first storage memory to replace the input data, the reordering circuit records a new start-address of each reordered data group, and collects the original start-addresses, the data lengths and the new start-addresses to generate a look-up table, the look-up table records the original start-addresses of the data groups and the new start-addresses of the reordered data groups, and each original start-address corresponds to one new start-address;
- a second storage memory storing the random data;
- and
- a memory controller storing the look-up table.
Dependencies are inferred from the claim text.