A system described herein may provide a technique for compressing sets of files using a packet-based conversion algorithm. The algorithm may compress and decompress files using a packet-based approach, whereby packet-sized sections of file data are compressed and arranged in a specified order such that the sections may be retrieved, decompressed, and reassembled to restore the original files as needed. The packet-based approach may allow for the size of a file set to be dramatically reduced, while the resulting compressed data may not be easily accessed by unauthorized entities. Compression and decompression may utilize a pointer associated with each file in the set of files. The pointer may be generated based on data associated with a file, such as file name, size, and/or other attributes or metadata. The compressed packets may be arranged relative to the pointer within a compressed file such that the packets may be identified and decompressed.

The present disclosure describes digital watermark detection systems and methods. In one such system, a plurality of intellectual property cores are integrated on a system-on-chip, such that the intellectual property cores comprise a first intellectual property core and a second intellectual property core. The system further includes a first network interface connected to the first intellectual property core that can encode a first digital watermark into a packet stream designated for the second intellectual property core. The system further includes a second network interface connected to the second intellectual property core that can receive the packet stream and decode the packet stream to generate a second digital watermark. The second network interface is further configured to perform a validation test on the packet stream and deliver the packet stream to the second intellectual property core when the first digital watermark is determined to match the second digital watermark.

A first apparatus comprises an error correction coding part that receives a message M to be transmitted to a second apparatus, performs coding using a predetermined error correction code, and outputs a codeword C; a message authentication tag generation part that receives the message M and outputs a predetermined message authentication tag T; and a transmission part that transmits the codeword C and the tag T as transmission information S to the second apparatus. The second apparatus receives a message M* to be verified and a tag T′, which are obtained from the transmission information S, and determines that the message M* to be verified has not been tampered with when a tag T* obtained from the message M* to be verified and the tag T′ satisfy a predetermined identity criterion.

A method is provided for communicating a non-speech message as audio from a first device to a second device such that information can be passed between the first and second device. The method includes: encoding the non-speech message as a dissimilar speech message having a plurality of phonemes; transmitting the speech message over one or more audio communications channels from the first device; receiving the speech message at the second device; recognizing the speech message; and decoding the dissimilar speech message to the non-speech message. By using existing audio functionality, and the increasingly more reliable voice recognition applications, an improved method is provided for sharing complex data messages using commonly available communication channels.

Physical Unclonable Functions, PUFs, are hardware devices designed to generate a number that is random (i.e., two identical PUFs should produce randomly different numbers from each other) and persistent (i.e., a PUF should consistently generate the same number over time). Over time, aspects of the PUF hardware may change or drift, which may ultimately cause the generated number to change, and therefore no longer be persistent. Failure to generate a persistent number may cause difficulties for other devices that rely on the persistence of the number generated by the PUF, for example as part of a cryptographic process. The present disclosure relates to monitoring over time the physical characteristics of the PUF that are used to generate its number, and thereby keep track of its reliability to generate a random number that is persistent. By monitoring PUFs in this way, it may be possible to detect in advance a PUF that is at risk of generating a number that is no longer persistent, so that pre-emptive action may be taken before the PUF actually fails.

A method of transforming a data file, the method executed by a processor. The method includes segmenting the data file into data segments and creating a bit index for each data segment having a size that is based on a configurable or preset data group unit. The method then involves indexing each data segment into its corresponding bit index by reading all data group unit values within the data segment and updating the bit index based on the read values, and generating an output data file or files comprising the bit indexes that represent the original data file.

The present disclosure provides systems and methods for improving provision of secret data on programmable devices. An appliance receives physical unclonable function (PUF) data pertaining to an integrated circuit. Secret data is provided to the appliance from a secret vault. Public and private PUF keys are derived based upon the PUF data. Further, ephemeral public and private keys are derived by the appliance. The public and private PUF keys, along with the ephemeral public and private keys are used to establish a secure channel for programming the secret data on the programmable device.

Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for storing blockchain data. One of the methods includes receiving a plurality of blocks from a blockchain node in the blockchain network; for each of the plurality of blocks: determining a first number of blockchain nodes that store a dataset divided from an error correction coding (ECC) encoded version of the block and a second number of blockchain nodes that store a dataset comprised of redundant bits divided from the ECC encoded version of the block; calculating a priority value of the block based on the first number and the second number; and encoding at least a portion of the plurality of blocks using ECC to generate a plurality of encoded blocks based on the priority value.

Methods and apparatus for using characterized devices such as memories. In one embodiment, characterized memories are associated with a range of performances over a range of operational parameters. The characterized memories can be used in conjunction with a solution density function to optimize memory searching. In one exemplary embodiment, a cryptocurrency miner can utilize characterized memories to generate memory hard proof-of-work (POW). The results may be further validated against general compute memories; such that only valid solutions are broadcasted to the mining community. In one embodiment, the validation mechanism is implemented for a plurality of searching apparatus in parallel to provide a more distributed and efficient approach. Various other applications for characterized memories are also described in greater detail herein (e.g., blockchain, social media, machine learning, probabilistic applications and other error-tolerant applications).

A verification code generation method is performed in an electronic device which is for performing encoding to generate a video/audio stream having multiple data segments. The verification code generation method includes the following steps. Each time one of the data segments is generated by the encoding, a first-level checksum associated with the data segment is generated, and the first-level checksum is recorded in an accompanying verification file. At an interval of every N data segments of the data segments, a second-level checksum is generated for W consecutive first-level checksums, and the second-level checksum is recorded in the accompanying verification file, such that a subsequent verification method can quickly verify integrity of a part of data according to the accompanying verification file. Wherein, W is a positive integer greater than or equal to 2, N is a positive integer greater than 0 and smaller or equal to W.