H04L2209/34

Adaptive identification systems and methods

A computer system is provided. The computer system includes a memory and a processor coupled to the memory. The processor is configured to receive a first message from an identity provider, the first message including an arbitrary identifier generated by the identity provider, the arbitrary identifier being incompatible with a dependent process that is reliant upon the identity provider; encode, in response to reception of the first message, the arbitrary identifier into an encoded identifier that is compatible with the dependent process; and transmit a second message including the encoded identifier to the dependent process.

Encoding and decoding information in synthetic DNA with cryptographic keys generated based on polymorphic features of nucleic acids
11539516 · 2022-12-27 · ·

The invention is notably directed to a method for encoding information. This method first comprises generating an encryption key according to polymorphic features of nucleic acids from one or more entities. Next, information is encrypted based on the generated key. Finally, the encrypted information is encoded into synthetic DNA. Another aspect concerns a method for retrieving information. Consistently with the above encoding scheme, synthetic DNA in provided, which encodes encrypted information. Such information is read by sequencing the synthetic DNA and by decrypting the information read using a decryption key. The latter is generated according to polymorphic features of nucleic acids from one or more entities (e.g., from the legitimate individual(s) requesting access to information). Thus, the encoded information cannot be interpreted unless a suitable decryption key is available. The invention is further directed to related DNA samples and systems, including DNA vaults.

Method and system for securing data using random bits and encoded key data

Methods and systems for securing data using random bits and encoded key data. A plurality of true random number generator (TRNG) disks and a plurality of key data sets are provided. A key data set from the plurality of key data sets is associated with each of the plurality of TRNG disks, respectively. The key data set comprises at least a block of random bits of an associated TRNG disk. An encoded key data set is formed by encoding at least two of the key data sets together. The source data can be encrypted with the encoded key data set to produce a quantity of encrypted data. The encrypted data can be decrypted with the encoded key data set or the at least two of the key data sets retrieved from the associated TRNG disks.

WIDEBAND FEATURELESS RATELESS CHAOTIC WAVEFORM GENERATION METHOD

A wideband chaotic waveform that is rateless in that it may be modulated at virtually any rate and has a minimum of features introduced into the waveform. Further, the waveform provided may be operated below a signal to noise ratio wall to further enhance the LPD and LPE aspects, thereof. Additionally, the present disclosure may provide a mix of coherent and non-coherent processing techniques applied to signal samples to efficiently achieve coarse synchronization with a waveform that is faster, more efficient and more accurate than using time domain signal correlators alone.

Reducing amount of helper data in silicon physical unclonable functions via lossy compression without production-time error characterization

A method, system and computer program product for reducing the amount of helper data that needs to be stored using two innovative techniques. The first technique uses bit-error-rate (BER)-aware lossy compression. By treating a fraction of reliable bits as unreliable, it effectively reduces the size of the reliability mask. With the view of practical costs of production-time error characterization, the second technique enables economically feasible across-temperature per-bit BER evaluation for use in a number of fuzzy extractor optimizations based on bit-selection to reduce overall BER (with or without subsequent compression) using room-temperature only production-time characterization. The technique is based on stochastic concentration theory and allows efficiently forming confidence intervals for average across-temperature BER of a selected set of bits. By using these techniques, it is economically feasible to achieve a dramatic reduction in the amount of helper data that needs to be stored in non-volatile memory and/or one-time-programmable memory.

Blockchained media stored in a material exchange format file
11522710 · 2022-12-06 ·

Digital media that has been blockchained into a blockchain file format may be stored into a secondary file format like a Material eXchange Format (MXF) digital file by deconstructing the blockchain file and storing its subcomponent blockchain data and blockchain hash digests for each block within separate structures of the MXF digital file by generating a table for the blockchain hash digests that links to the blockchain data through data pointers. These separate structures of the MXF digital file are the generic container for a media file and a SDTI-CP (Serial Data Transport Interface—Content Package) compatible system item.

Encryption and decryption techniques using shuffle function

Encryption and decryption techniques based on one or more transposition vectors. A secret key is used to generate vectors that describe permutation (or repositioning) of characters within a segment length equal to a length of the transposition vector. The transposition vector is then inherited by the encryption process, which shifts characters and encrypts those characters using a variety of encryption processes, all completely reversible. In one embodiment, one or more auxiliary keys, transmitted as clear text header values, are used as initial values to vary the transposition vectors generated from the secret key, e.g., from encryption-to-encryption. Any number of rounds of encryption can be applied, each having associated headers used to “detokenize” encryption data and perform rounds to decryption to recover the original data (or parent token information). Format preserving encryption (FPE) techniques are also provided with application to, e.g., payment processing.

Retrieving data in a storage network
11513685 · 2022-11-29 · ·

A method for execution by a dispersed storage and task (DST) client module includes issuing a read threshold number of read slice requests are issued to storage units of the set of storage units. One or more encoded slices of a selected read threshold number of encoded slices are received. When a next encoded data slice of a decode threshold number of encoded data slices is received within a response timeframe, outputting of the next encoded data slice is initiated. When the next encoded data slice is not received within the response timeframe, receiving of another decode threshold number of encoded slices of the set of encoded slices is facilitated. The other decode threshold number of encoded slices are decoded to produce recovered encoded data slices, where the recovered encoded data slices includes at least a recovered next encoded data. Outputting of the recovered next encoded data slice is initiated.

Memory devices with cryptographic components

An apparatus, such as a memory system (e.g., a NAND memory system), can have a controller with a first error correction code component and a memory device (e.g., a NAND memory device) coupled to the controller. The memory device can have an array of memory cells, a second error correction code component coupled to the array and configured to correct data from the array, and a cryptographic component coupled to receive the corrected data from the second error correction code component.

Security device generating key based on physically unclonable function and method of operating the same

A security device generates a key based on a physically unclonable function (PUF). The security device includes a physically unclonable function (PUF) block, an integrity detector, and a post processor. The PUF block outputs a plurality of first random signals and a plurality of corresponding first inverted random signals each having a logic level opposite to that of each of the plurality of corresponding first random signals. The integrity detector determines data integrity of the plurality of first random signals by using the plurality of first random signals and the plurality of corresponding first inverted random signals. The post processor generates a first row key that includes validity signals satisfying the data integrity.