Systems, apparatuses, and methods are disclosed for quantum entanglement authentication (QEA). An example method includes transmitting, a first electronic identification of a first subset of a first set of entangled quantum particles to a first computing device, transmitting, by the classical communications circuitry, a second number to a second computing device, wherein each entangled quantum particle in the first set of entangled quantum particles is entangled with a respective entangled quantum particle in a second set of entangled quantum particles, receiving, from the first computing device, a first number, the first number representative a measurement of the first subset of the first set of the entangled quantum particles, and in an instance in which the second number corresponds to the first number, authenticating a session between the first computing device and the second computing device.

A system, method and apparatus that uses a quantum event-based, binary data generation apparatus operating in combination with a single-party or two-party, symmetric and/or asymmetric key storage system to create both random numbers and encryption keys to be used for purposes of encryption and decryption of a user's or organization's file data.

In some aspects, the instant disclosure relates to the multiplexed encryption of information on nucleic acid molecules. In some aspects, the instant disclosure relates to a method of secure communication of information disseminated across at least one nucleic acid molecule, the method comprising (a) obtaining a modified keyboard comprising a personalized platform for translating text into a nucleic acid sequence; (b) translating a quantum of information into a nucleic acid message sequence using the modified keyboard of (a); and, (c) obtaining an at least one nucleic acid molecule, each molecule comprising: (i) the complete or a portion of the nucleic acid message sequence, and (ii) at least one contiguous stretch of randomized variable nucleic acid sequence flanking and/or inserted into the message sequence, thereby producing a nucleic acid molecule or a set of nucleic acid molecules containing the entire quantum of information.

This invention provides a secure method for sending data—private, arrival-time messaging. Private, arrival-time messaging is based on classical physics and not quantum mechanics. It insures a private language for communicators with privately-synchronized clocks. In this method, there is no encrypted message available to an eavesdropper. A private message is mapped onto a time measurement known only to an intended sender and an intended receiver such that a third party knowing only the arrival time of the message and not the time measurement can never know the private message.

One-time-pad (OTP) encryption systems and methodologies are resistant to cracking, even by advanced quantum computers. In contrast to some purported solutions, the required elements of an unbreakable OTP system are preserved under Claude Shannon's mathematical proof. In alternative embodiments, the invention uses a secure network to reconstitute blockchain systems without the use of asymmetric encryption. Described extensions of these block chain systems are described which enable an entirely new set of applications for protecting privacy, sharing information, performing validations and analysis of data, and creating system actions that are constrained by complex data algorithms.

A method of transmitting a message includes, for each data block, generating a root matrix using a generator, generating a quasi-cyclic matrix H using the root matrix, encoding the block using H to create a codeword, and transmitting the codeword. The root matrix includes three submatrices: an identity matrix in an upper-left-hand portion of the root matrix, an identity matrix in a lower-left-hand portion of the root matrix, and a circulant matrix in a right-hand portion of the root matrix. The circulant matrix equals the sum of an identity matrix and an identity matrix with rows shifted once to the right. Generating H includes expanding the root matrix by replacing 0 elements in the root matrix by a square matrix of 0 elements and replacing 1 elements in the root matrix by a shifted diagonal matrix. Non-zero elements of the diagonal matrix are selected from GF(q) based on the generator.

An entity authentication method includes: an entity A generates and sends N.sub.A to an entity B; the entity B generates N.sub.B and ZSEED.sub.B, computes a key MKA∥KEIA and first encrypted authentication data AuthEncData.sub.B, and sends the N.sub.B∥N.sub.A∥AuthEncData.sub.B to the entity A for verification; the entity A generates ZSEED.sub.A, computes second encrypted authentication data AuthEncData.sub.A, a shared key seed Z, a master key MK and a first message authentication identifier MacTag.sub.A, and sends the N.sub.A∥N.sub.B∥AuthEncData.sub.A∥MacTag.sub.A to the entity B for verification; the entity B computes Z, MK and MacTag.sub.A, compares the MacTag.sub.A with the received MacTag.sub.A, and if the two are equal, considers that the entity A is valid; the entity B computes and sends a second message authentication identifier MacTag.sub.B to the entity A; and the entity A computes MacTag.sub.B, compares the MacTag.sub.B with the received MacTag.sub.B, and if the two are equal, considers that the entity B is valid.

A consent block is a type of block that may be stored in a blockchain. Each consent block has an owner and may store an owner consent contract, i.e., a smart contract containing owner-specified access rules that determine who may access data assets that are stored in other blocks of the blockchain and owned by the same owner. The consent block may alternatively store a global consent contract containing global access rules that supersede owner-specified access rules. The consent block also stores a hash value determined from the consent contract and a previous hash value of the block immediately preceding the consent block. The consent contract and the position of the consent block in the blockchain are verifiable from the hash value. Each consent block, once added to the blockchain, becomes part of the immutable record of data stored in the blockchain, and therefore leaves an auditable trail.

Encryption systems for initiating, encrypting, decrypting, storing and transporting undetectable secure electronic data communications over public and private networks, including the Internet or the like.

Plurality of users share a common key while permitting change of members sharing the common key and computational complexity required for key exchange is reduced. R.sub.i and c.sub.i are computed based on a twisted pseudo-random function in a first key generation step. sid is generated based on a target-collision resistant hash function and (sid, R.sub.α, R.sub.β) is transmitted to communication devices U.sub.i in a session ID generation step. T.sub.1 and T′ are computed based on a pseudo-random function in a representative second key generation step. T.sub.j is computed based on the pseudo-random function in a general second key generation step. k′ is computed based on the twisted pseudo-random function and T′.sub.j is computed with respect to each j in a third key generation step. K.sub.1.sup.1 and k.sub.1 are computed in a first session key generation step. A common key K.sub.2 is generated based on the pseudo-random function in a second session key generation step.