A computer-implemented method of operating an electronic draw system, the method comprising: obtaining a bit sequence in one or more blocks of one or more different blockchains; generating a seed value based on the bit sequence in the one or more blocks of the one or more different blockchains; applying a random number generator algorithm to calculate a sequence of random numbers using the seed value as input; and converting the sequence of random numbers to an electronic drawing output of the electronic draw system.

A cryptographic method and system. A plurality of ciphers is identified in a message received by a recipient, such message encrypting a digital asset. A private key associated with the recipient is obtained. The private key corresponds to a public key associated with the recipient. The method includes solving for x in the equation: [(f.sub.0(R.sub.0.sup.−1 N′.sub.0 mod S)+P′+f.sub.λ(R.sub.n.sup.−1 N′.sub.n mod S))/(h.sub.0(R.sub.0.sup.−1 N′.sub.0 mod S)+Q′+h.sub.λ(R.sub.n.sup.−1 N′.sub.n mod S))]*h(x)−f(x)=0 mod p, where (i) P′, Q′, N′.sub.0, and N′.sub.n correspond to the ciphers in the received message; (ii) R.sub.0, R.sub.n and S are data elements of the private key; (iii) f(.Math.) is a polynomial function defined by coefficients f.sub.0, f.sub.1, . . . f.sub.λ that are also data elements of the private key; and (iv) h( ) is a polynomial function defined by coefficients h.sub.0, h.sub.1, . . . h.sub.λ that are also data elements of the private key. The value of x is assigned to the digital asset, which is then stored in non-transitory memory or packaged in a message sent over the data network.

The instant disclosure illustrates how the privacy and security of activities occurring on distributed ledger-based networks (DLNs) can be enhanced with the use of zero-knowledge proofs (ZKPs) that can be used to verify the validity of at least some aspects of the activities without private information related to the activities necessarily being revealed publicly. Methods and systems that are directed at facilitating the tracking and recovery of assets stolen on ZKP-enabled DLNs while preserving the confidentiality of the tokens are presented herein.

Provided is a highly practical cryptographic technology which is capable of being used when encryption and decryption are performed in a single data processing device and which can be said to be unbreakable, or close to unbreakable. A data processing device is configured to generate encrypted data by encrypting processing target data and record the generated encrypted data in a predetermined recording medium, and to decrypt the encrypted data recorded in the recording medium back into the processing target data. The processing target data is data of a text. Encryption is performed in units of plaintext split data generated by splitting the processing target data into pieces having a predetermined number of bits. The units of the splitting are equal to or shorter than a bit length of a code for identifying characters in the text.

Communication devices and methods for multi-link secured retransmissions are provided. One exemplary embodiment provides a multi-link device (MLD) configured to operate with a first plurality of affiliated STAs, comprising: circuitry, which in operation, sets up a robust security network association (RSNA) with a second MLD that is configured to operate with a second plurality of affiliated STAs, wherein two or more links have been established between STAs of the first plurality of affiliated STAs and corresponding STAs of the second plurality of affiliated STAs, wherein the circuitry constructs an Additional Authentication Data (AAD) and a Nonce that are used for cryptographical encapsulation of a MAC protocol data unit (MPDU) to form an encapsulated MPDU, wherein the AAD includes an Address 1 (A1) field, an Address 2 (A2) field, an Address 3 (A3) field and a Sequence Control (SC) field, and the Nonce includes an Address 2 (A2) field, wherein the SC field of the AAD is based on a SC field of the MPDU, and transmitter, which in operation, transmits the encapsulated MPDU to the second MLD on a first link as an initial transmission, and upon failure of the initial transmission, retransmits the encapsulated MPDU on a second link without reperforming the cryptographical encapsulation.

Examples are described for dynamically applying a digital watermark to a file, such as a dataset of genomic sequencing data. In one example, a method of dynamically applying a watermark to at least a portion of a file includes generating, using a secret key, a first random seed, generating, using the first random seed, an ordered pseudorandom set of integers, generating, using entity information and timing information, a second random seed, selecting, using the second random seed, a subset of the ordered pseudorandom set of integers, and modifying data at data locations in the file corresponding to at least a portion of the identifiers included in the subset to generate a watermarked file. The method may further include performing a check to determine whether the watermark is present in a file using a sequence of watermark elements that are generated based on the secret key.

Methods of data encryption using a mutating encryption key are disclosed. The methods generate an encryption key and utilize a codex to mutate or vary the encryption key value. The encryption key may be generated using a random number generator. The encryption key value in pre-mutation state, together with the codex, is used to generate the next valid value for the encryption key. Unencrypted message data may be used together with the codex to mutate the encryption key. A valid encryption key and the unencrypted or successfully deciphered message are thus required to mutate the encryption key to the next key post-mutation state at each end.

Embodiments of present disclosure relates to and systems to reduce propagation delays in hardware implementation of 3GPP confidentiality or standardized algorithm 128-EEA3 and 3GPP integrity algorithm 128-EIA3 using ZUC module. The reduction of the propagation delays is achieved by improving or optimizing secondary critical paths, which are subsequent to primary critical path, related to the 3GPP confidentiality or standardized algorithm 128-EEA3 and the 3GPP integrity algorithm 128-EIA3. Non-conventional modifications in the hardware implementation are proposed for the improvement or optimization.

An example process includes breaking content into multiple fragments; and transmitting at least two of the multiple fragments over different physical channels in order to isolate the at least two fragments during transmission. The example process may include generating session keys; encrypting at least some of the fragments using different session keys; and associating, with each fragment, a session key used to encrypt a different fragment to produce fragment/session key pairs.

A method may include obtaining, by a first entity, a verification key from a second entity to which an asset is to be transferred. The method may also include proving to an administrator of a blockchain that the first entity is a current owner of the asset, the blockchain hosting a token associated with the asset. The method may additionally include providing an updated randomness value and the token to the second entity. The method may also include sending an updated hash value of the token and the updated randomness, a signed indication of the transfer of the asset from the first entity to the second entity, and the verification key of the second entity to an administrator of the blockchain.