ERASE VERIFICATION FOR A NONVOLATILE MEMORY

    公开(公告)号:US20250077109A1

    公开(公告)日:2025-03-06

    申请号:US18460041

    申请日:2023-09-01

    Abstract: In some examples, a system includes a nonvolatile memory to store information, and a controller subsystem to perform various tasks. The controller subsystem receives, from an entity, an input to trigger an erase verification operation after an erase of a memory region of the nonvolatile memory containing the information. The controller subsystem generates a pseudorandom pattern in response to the input, and writes the pseudorandom pattern to the memory region as part of the erase verification operation. After the writing, the controller subsystem provides, from the nonvolatile memory to the entity, the pseudorandom pattern retrieved from the memory region for verification that the erasing of the information of the memory region has occurred.

    BASEBOARD MANAGEMENT CONTROLLER TO CONVEY DATA

    公开(公告)号:US20200342109A1

    公开(公告)日:2020-10-29

    申请号:US16397538

    申请日:2019-04-29

    Abstract: Examples disclosed herein relate to using a baseboard management controller (BMC) to convey data between two networks. The BMC has a network interface. Before the BMC connects to a first network, it performs a security assessment including a check on a storage. Then the BMC receives and stores, on the storage, data from the first network. The network interface is then disconnected from the first network and connected to a second network. The data is conveyed to another device using the second network.

    SUBNETWORKS OF PEER TO PEER NETWORKS
    6.
    发明申请
    SUBNETWORKS OF PEER TO PEER NETWORKS 审中-公开
    与同行网络相关的子网

    公开(公告)号:US20160212205A1

    公开(公告)日:2016-07-21

    申请号:US14915899

    申请日:2013-09-26

    Inventor: Chris Davenport

    Abstract: A respective identifier of each node of a plurality of nodes in a plurality of subnetworks of a peer to peer network may be generated. The identifier may include a node address identifying the node and a subnetwork address identifying a subnetwork in the plurality of subnetworks in which the node is located. For each pairwise permutation of the plurality of nodes comprising a first node and second node, a range and a distance between the first and second nodes may be based on their identifiers. For each pairwise permutation, the second node may be added to a list of one or more peer nodes of the first node if the distance between the first and second nodes is closer than the distance between the first node and any other node of the plurality of nodes that has the same range as the range between the first and second nodes.

    Abstract translation: 可以生成对等网络的多个子网中的多个节点的每个节点的相应标识符。 标识符可以包括标识节点的节点地址和标识节点所在的多个子网中的子网的子网地址。 对于包括第一节点和第二节点的多个节点的每个成对置换,第一和第二节点之间的范围和距离可以基于它们的标识符。 对于每个成对排列,如果第一和第二节点之间的距离比第一节点和第二节点之间的距离更接近,则第二节点可被添加到第一节点的一个或多个对等节点的列表中 具有与第一和第二节点之间的范围相同范围的节点。

    HASHING VALUES USING SALTS AND PEPPERS

    公开(公告)号:US20210344497A1

    公开(公告)日:2021-11-04

    申请号:US16861285

    申请日:2020-04-29

    Abstract: In some examples, a management controller includes a communication interface to communicate with a computing device, where the management controller is separate from a processor of the computing device. The management controller includes a management processor to receive, from the computing device, a first hash value that is based on a first hash function applied on an input value and a salt, generate a second hash value based on applying a second hash function on the first hash value and a pepper, and send the second hash value to the computing device.

    Task Distribution in Peer to Peer Networks
    9.
    发明申请
    Task Distribution in Peer to Peer Networks 审中-公开
    对等网络中的任务分配

    公开(公告)号:US20160217014A1

    公开(公告)日:2016-07-28

    申请号:US14916092

    申请日:2013-09-26

    Inventor: Chris Davenport

    CPC classification number: G06F9/5088 G06F9/5072 H04L67/1074

    Abstract: For each pairwise permutation comprising a first and second node of a plurality of nodes in a peer to peer network, the second node may be a peer node of the first node if a distance between the first and second nodes is closer than a distance between the first node and any other node that has a same range as a range between the first and second nodes. The instructions to perform and distribute a task may be sent from a root node of the plurality of nodes to each of its peer nodes. For each of the nodes other than the root node, the instructions may be received by each of the peer nodes of the each node if the range between the each node and the each peer node is less than the range between the each node and the node from which the instructions were received.

    Abstract translation: 对于包括对等网络中的多个节点的第一和第二节点的每个成对置换,如果第一和第二节点之间的距离比第一和第二节点之间的距离更近,则第二节点可以是第一节点的对等节点 第一节点和与第一和第二节点之间的范围具有相同范围的任何其他节点。 执行和分发任务的指令可以从多个节点的根节点发送到每个对等节点。 对于除根节点之外的每个节点,如果每个节点和每个对等节点之间的范围小于每个节点和节点之间的范围,则每个节点的每个对等节点可以接收指令 从中收到指示。

    Hashing values using salts and peppers

    公开(公告)号:US11641281B2

    公开(公告)日:2023-05-02

    申请号:US16861285

    申请日:2020-04-29

    Abstract: In some examples, a management controller includes a communication interface to communicate with a computing device, where the management controller is separate from a processor of the computing device. The management controller includes a management processor to receive, from the computing device, a first hash value that is based on a first hash function applied on an input value and a salt, generate a second hash value based on applying a second hash function on the first hash value and a pepper, and send the second hash value to the computing device.

Patent Agency Ranking