A method is described for encrypting data that provides increase resistance to brute Identify data segments force attacks by parallel computing means, such as by a quantum computer. To encrypt the data, it is separated into a plurality of data segments, and each of the data segments is encrypted using a different encryption key. The encrypted data segments are then arranged as an encrypted data file in Assign encryption order a manner that impedes parallel attack of the encrypted data segments. For example, the lengths of the encrypted data segments may be non-uniform and/or the spacing of the encrypted data segments within the encrypted data file may be non-uniform. Each encrypted segment may contain a pointer to the next segment, thus permitting an authorised recipient to sequentially decrypt the data file without prior knowledge of the lengths and/or spacings of the encrypted data segments.

The technology encompasses new uses of already-known cryptographic techniques. The technology entails computer-based methods of sharing information securely, in particular an asymmetric method of secure computation that relies on the private-key/public key paradigm with homomorphic encryption. The methods and programmed computing apparatuses herein apply mathematical concepts to services or tasks that are commercially useful and that have not hitherto been possible. Applications of the methods within cloud computing paradigms are presented. Applications of the methods and apparatus herein are far-ranging and include, but are not limited to: purchase-sale transactions such as real estate or automobiles, where some aspect of price negotiation is expected; stock markets; legal settlements; salary negotiation; auctions, and other types of complex financial transactions.

A computer implemented method for decrypting an encrypted data store at a target computer system, the data store being encrypted by a ransomware algorithm using a searchable encryption algorithm, the method including determining an encryption algorithm used by the ransomware algorithm; determining seed parameters used by the encryption algorithm to generate an encryption key; generating the encryption key using the seed parameters; and decrypting the encrypted data store.

Systems, methods, and computer-readable media are disclosed for performing message padding of input messages in a manner that preserves the integrity of the input data regardless of whether the input message is in a bit-oriented format or a bit-reversed format. Each byte of a partial input message block of an input message may be converted from a bit-reversed format to a bit-oriented format prior to performing message padding in order to ensure that input data bits are not lost during the message padding. Subsequent to the message padding that generates one or more padded message blocks, the padded message block(s) may be converted from a bit-oriented format to a bit-reversed format to enable further processing of the input message to be performed to obtain a message digest.

A virtual enigma cipher system is described herein that allows for symmetric encryption and decryption of data. During encryption, a plurality of wheels representing sequences of data are used to encrypt a message. The plurality of wheels includes at least one dynamic wheel, which is generated based on a password, and a plurality of static wheels. During encryption, the unencrypted message is iterated from beginning to end. During each step of iteration, the encrypted payload value for a particular position is determined by performing an exclusive or (XOR) operation between the value of the unencrypted message at the position, and the values of the wheels at their respective wheel pointer positions. The particular position is then incremented, as are the wheel pointer positions, and iteration continues until the entire unencrypted message has been encrypted as part of the encrypted payload. Padding data and the message length are appended to the encrypted payload. During decryption, the steps are reversed.

A device may receive a request for a contract associated with a project. The request may include a blockchain identifier for an organization associated with the project and a set of project requirements for the project. The device may generate the contract using information included in the request. The contract may include one or more conditions that are associated with the set of project requirements. The device may create one or more blocks in a blockchain using the one or more conditions of the contract and the blockchain identifier. The device may receive multimedia data associated with completion of a phase of the project. The device may verify whether the phase of the project is complete using metadata associated with the multimedia data. The device may perform one or more actions based on verifying whether the phase of the project is complete.

Method of authenticating a client to a server, the client having beforehand registered on the server by storing therein a valid identifier (ID) and a hashed word (H.sub.0; H.sub.n) generated by applying a hash function to a disposable random variable (RAND.sub.0; RAND.sub.n; R.sub.n) possessed/known by both the client and the server and concatenated with a sequence (ISC.sub.0; ISC.sub.n) resulting from hashing the concatenation of a password (PWD) known from the client, said disposable random variable (RAND.sub.0; RAND.sub.n; R.sub.n) and an initialization sequence (ISC.sub.init) possessed by the client.

Confidential, secret data may be shared via one or more blockchains. Mortgage applications, medical records, financial records, and other electronic documents often contain social security numbers, names, addresses, account information, and other personal data. A secret sharing algorithm is applied to any secret data to generate shares. The shares may then be integrated or written to one or more blockchains for distribution.

A cryptoprocessor has a processor core for receiving and executing instructions of a program code based on a program flow chart, a program memory unit which stores the program code with instructions in an individually encrypted format, wherein the respective instructions contain at least one instruction data word and an instruction data key allocated to the respective instruction, a respective instruction is encrypted using a program data key and the instruction data key of a respective preceding instruction, which is to be executed immediately beforehand in accordance with the program flow chart, and wherein the same instruction data key is allocated to the corresponding possible preceding instructions only in the event that a corresponding instruction in the program flow chart has a plurality of possible preceding instructions, the respective instruction data keys otherwise being unique to the instruction. A decryption unit is also described.

A computer-implemented method according to one aspect includes creating an initialization vector, utilizing an instance of plaintext and a secret key; encrypting the instance of plaintext, utilizing the initialization vector, the secret key, and the instance of plaintext; combining the initialization vector and the encrypted instance of plaintext to create a ciphertext string; and outputting the ciphertext string.