US 12,328,397 B2
Memory processing apparatus, memory verification apparatus, memory updating apparatus, memory protection system, method, and computer readable medium
Akiko Mukai, Tokyo (JP); Kazuhiko Minematsu, Tokyo (JP); Naofumi Homma, Miyagi (JP); and Rei Ueno, Miyagi (JP)
Assigned to NEC CORPORATION, Tokyo (JP)
Appl. No. 17/918,597
Filed by NEC Corporation, Tokyo (JP)
PCT Filed Apr. 23, 2020, PCT No. PCT/JP2020/017420
§ 371(c)(1), (2) Date Oct. 13, 2022,
PCT Pub. No. WO2021/214922, PCT Pub. Date Oct. 28, 2021.
Prior Publication US 2023/0132163 A1, Apr. 27, 2023
Int. Cl. H04L 9/32 (2006.01); H04L 9/06 (2006.01); H04L 9/08 (2006.01)
CPC H04L 9/3242 (2013.01) [H04L 9/0618 (2013.01); H04L 9/0836 (2013.01)] 11 Claims
OG exemplary drawing
 
1. A memory processing apparatus comprising:
hardware, including a processor and memory;
memory address allocation unit implemented at least by the hardware and configured to allocate, to each of nodes in a tree structure configured to protect a memory, a memory address unique to the node;
tag generation unit implemented at least by the hardware and configured to (A) define, for each of the nodes in the tree structure, a connection of a value of the memory address unique to each of the nodes and a constant, as a nonce, (B) generate, for each of leaf nodes and a specific node, a tag by inputting the nonce of each of the nodes and a plaintext of which tampering with is to be detected into a message authentication code, or by inputting the nonce of each of the nodes and constants of a plurality of child nodes of each of the nodes into the message authentication code, and (C) generate, for each of nodes other than the leaf nodes and the specific node, a tag by inputting the nonce of each of the nodes, the nonce of the specific node, and the tag of the specific node into the message authentication code, the message authentication code being a code by which a partially-updatable tag can be output; and
node generation unit implemented at least by the hardware and configured to generate each of the nodes in the tree structure by using the constant as a local counter and combining at least the tag and the local counter.