A message authentication apparatus compresses a message M into a value H of 2n bits, and divides the value H into two values H[1] and H[2] each having n bits. The message authentication apparatus extracts two values U[1] and U[2] each having min{t, n/2} bits from the value H[1], generates a value V[1] of t bits, using as input the message M and the value U[1], and generates a value V[2] of t bits, using as input the message M and the value U[2]. The message authentication apparatus encrypts the value H[2] by a tweakable block cipher E, using the value V[1] as a tweak, to generate a value Z[1], and encrypts the value H[2] by the tweakable block cipher E, using the value V[2] as a tweak, to generate a value Z[2]. The message authentication apparatus generates an authenticator Z from the value Z[1] and the value Z[2].

A method for blockchain full sharding based on a P2P storage network and a multi-layer architecture is provided. The entire network blockchain nodes are divided into a shard chain, a relay chain and a beacon chain by means of network sharding, that is, shard cross-chain communication is realized by using a beacon-relay-shard three-layer architecture or an architecture with more than three layers, so that the network requirement of the nodes has a linear relationship with the total number of TPS of the network. A transaction is divided into a W primitive and a D primitive. The D primitives are grouped and hash values corresponding to the D primitives are calculated: the W primitive is executed on an initiator's shard, the D primitive is stored in the P2P storage network, and the hash value corresponding to the primitive is communicated across the chain, and finally executed on a receiver's shard.

Embodiments of the invention relate to symmetric encryption that converts plain text to Diophantine equations, i.e. cipher text, and creates a symmetric key which is held by a sender (or encryption apparatus) and a recipient (or decryption apparatus). The key is used by the decryption apparatus to decrypt the Diophantine equations, and convert them to original plain text. Particularly, undecidable encryption and artificial intelligence (AI) are employed in combination. More particularly, the AI would exclude any class of Diophantine equations which has been solved or deciphered without key, or known to be solvable. In the event certain classes of Diophantine equations are solved in the future, the AI will exclude the use of these solved or solvable classes of Diophantine equation in encryption.

Method decrypting and/or encrypting an input message: providing at least five of sixteen first order logic functions; and decrypting and/or encrypting the input message based on the at least five first order logic functions.

A computer executes a causal total order broadcast (CTOB) protocol, in a Byzantine fault-tolerant, distributed computerized system comprising a set of nodes acting as servers for clients of the system. The nodes host a trusted proxy client (TPC) process that executes in a trusted execution environment of the nodes. The TPC process includes for each client request (which include encrypted contents) received from any of the clients, signing the client request. The TPC process invokes a total order broadcast (TOB) protocol to obtain a sequence number for the signed request, whereby the nodes establish a total order in which the signed request is processed by the nodes. Upon determining that the signed request is assigned this sequence number, the TPC process reveals a decrypted version of the encrypted contents of the client request to the set of nodes, and the decrypted version is processed according to the TOB protocol.

An encryption key generating method and apparatus based on homomorphic encryption, and a ciphertext operation method and apparatus using the generated encrypt key are disclosed. The method of generating an encryption key for performing encryption based on homomorphic encryption includes receiving data, generating a first encryption key and a second encryption key used for encrypting the data based on a secret key, and transmitting the first and second encryption keys.

A master device issues memory burst transaction requests via an interconnection bus to fetch data from a slave device. A cipher engine is coupled to the interconnection bus and decrypts the fetched data to produce plaintext data for the master device. The cipher engine selectively operates according to a stream cipher operation mode, or a block cipher operation mode. The cipher engine is configured to stall a read data channel of the interconnection bus between the slave device and the master device in response to the cipher engine switching from the block cipher operation mode to the stream cipher operation mode. The read data channel is reactivated in response to a last beat of a read burst of the plaintext data produced by the cryptographic engine.

A processor may load one or more potential updates to a trusted source from an identified trusted source. The processor may determine acceptable update windows. The processor may apply at least one of the one or more potential updates to the computing device. The processor may identify if a steady state has been reached. The processor may determine whether the at least one update has succeeded.

This application provide quantum key distribution methods, devices, and storage media. In an implementation, a method comprises: determining, based on a first mapping, a first quantum key of N first quantum keys corresponding to an i.sup.th node on a target routing path; determining, based on a second mapping, a second quantum key of N second quantum keys corresponding to the i.sup.th node; and generating, by the i.sup.th node based on the first quantum key corresponding to the i.sup.th node and the second quantum key corresponding to the i.sup.th node, a third quantum key corresponding to the i.sup.th node on the target routing path.

Systems and methods providing access control and data privacy/security with decentralized ledger technology are disclosed. To ensure data privacy the decryption or access to data by a non-data owner requires joint orchestration of decentralized system nodes to provide partial decryption components with n-of-x required to fulfill request. Data can be encrypted, and access control policy can be decided including required number of key fragments to fulfill decryption. Access control policies can be stored in the decentralized ledger based system. Key information can be stored in the system in a decentralized manner with partial key fragments encrypted and split among system nodes. An access request can be sent to the system to fetch a data file, without disclosing the requester's identity in the system. The decentralized ledger based system can verify a legitimate request to access the data and denies access to malicious or faulty participants.