A method of encrypting data in a nonvolatile memory device (NVM) includes; programming data in selected memory cells, sensing the selected memory cells at a first time during a develop period to provide random data, sensing the selected memory cells at a second time during the develop period to provide main data, encrypting the main data using the random data to generate encrypted main data, and outputting the encrypted main data to an external circuit, wherein the randomness of the random data is based on a threshold voltage distribution of the selected memory cells.

A method of encrypting data in a nonvolatile memory device (NVM) includes; programming data in selected memory cells, sensing the selected memory cells at a first time during a develop period to provide random data, sensing the selected memory cells at a second time during the develop period to provide main data, encrypting the main data using the random data to generate encrypted main data, and outputting the encrypted main data to an external circuit, wherein the randomness of the random data is based on a threshold voltage distribution of the selected memory cells.

The present disclosure relates to methods of mining a block of a distributed ledger. The methods include: receiving a block to be mined, the block including a header hash and a plurality of transactions; creating a first signature based on a first function, where inputs to the first function include the header hash and the plurality of transactions; and creating a second signature based on a second function, where an input to the second function is the first signature. In one example, the second function is a multiplicative inverse function and the method further includes creating the second signature that is a multiplicative inverse value of the first signature with respect to a first irreducible polynomial. The method additionally includes creating a chain of signatures, where each of the signatures is a multiplicative inverse value of a previous output with respect to a respective irreducible polynomial.

Described herein are systems and methods for providing secure blockchain routing utilizing an extended blockchain protocol. In some embodiments, a blockchain routing node may join an overlay network including a plurality of blockchain routing nodes. The blockchain routing node may receive a plurality of forwarding tables from the plurality of blockchain routing nodes in accordance with an extended blockchain protocol. The blockchain routing node may determine a routing table for the overlay network based at least on part on the plurality of forwarding tables. In some embodiments, the blockchain routing node may route a payload message to a destination blockchain routing node in the overlay network in accordance with the determined routing table.

Systems and techniques are disclosed for a blockchain network based on machine learning-based proof of work. One of the methods includes accessing a blockchain associated with a blockchain network, and obtaining a first error value specified in a block of the blockchain, the first error value being associated with a machine learning model identified in the block, and the blockchain recording machine learning models. A new machine learning model associated with a second error value is determined, with the second error value being less than the first error value. A block proposal identifying the new machine learning model is generated, the block proposal specifying the first error value. Transmission of the block proposal to other entities is caused. In response to greater than a threshold percentage of the entities approving the block proposal, inclusion of the block proposal in the blockchain is caused.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for establishing a proof of storage over a specified period of time. One of the methods includes: (i) receiving, at a prover, an initial input challenge; (ii) producing, at the prover, an output proof proving that the prover has access to specified data for a specified time, wherein producing the output proof includes: (a) producing, at the prover, an initial proof responsive to the initial input challenge, the initial proof proving that the prover is storing specified data; (b) generating, at the prover, a new input challenge based at least in part on the initial proof: (c) producing, at the prover, a new proof responsive to the new input challenge, the new proof proving that the prover is storing the specified data; and (d) repeating, at the prover, the generating step and the producing a new proof responsive to the new input challenge step a number of times, the repeating step generating sequential proofs of storage to determine time of storage , wherein each generating step is based at least in part on a most recent new proof; and (iii) forwarding the output proof, e.g., to a blockchain.

Systems and methods of the present disclosure enable operation authorization using a dynamic code. Embodiments includes a computing system for receiving, from an access control server, an operation authorization request to authorize an operation by an initiator, where the operation authorization request includes a user identifier associated with the operation authorization request, and a dynamic code. The computing system accesses a dynamic key embedded in a user credential associated with the user identifier and generates a recalculated dynamic code using a cryptographic algorithm and the dynamic key. The computing system authenticates the operation authorization request based on the dynamic code being equivalent to the recalculated dynamic code and returns the authentication to the access control server to authorize the operation.

A method for encrypting messages is provided. The method for encrypting messages includes: generating a seed; generating a mask based on the seed; generating a masked message by masking an original message using the mask; acquiring a target message by performing white box encryption on the masked message; and disclosing the target message and the seed.

The present invention is directed to a computer-implemented method for linking identity information of a physical identifier to a digital identifier. The identity information comprises a plurality of symbols. The method comprises cryptographically obfuscating one or more symbols of the identity information separately into an obfuscated symbol such that a separate deobfuscation information is needed for each obfuscated symbol to deobfuscate it and storing the obfuscated symbols within the digital identifier.

Integrated circuits, methods, and circuitry are provided for performing multiplication such as that used in Galois field counter mode (GCM) hash computations. An integrated circuit may include selection circuitry to provide one of several powers of a hash key. A Galois field multiplier may receive the one of the powers of the hash key and a hash sequence and generate one or more values. The Galois field multiplier may include multiple levels of pipeline stages. An adder may receive the one or more values and provide a summation of the one or more values in computing a GCM hash.