A method including determining, by a user device, an assigned key pair including an assigned public key and an associated assigned private key; determining, for content to be encrypted, an access key pair including an access public key and an associated access private key; encrypting the access private key by utilizing the assigned public key; encrypting a randomly generated key by utilizing the access public key; and encrypting content utilizing the randomly generated key. Various other aspects are contemplated.

The present invention discloses an image encryption method based on an improved class boosting scheme, which comprises the following steps: acquiring parameters of a hyperchaotic system according to plaintext image information: generating weights required by class perceptron networks through the plain text image information: bringing the parameters into the hyperchaotic system to obtain chaotic sequences, and shuffling the chaotic sequences by a shuffling algorithm: pre-processing the chaotic sequences after shuffling to obtain a sequence required by encryption: and bringing a plaintext image and the sequence into an improved class boosting scheme to obtain a ciphertext image, wherein the improved class boosting scheme is realized based on the class perception networks. The method solves the problems that update and prediction functions in an original boosting network are too simple and easy to predict or the like, so as to obtain the ciphertext image with higher information entropy.

Techniques for Precision-Preserving Format-Preserving Encryption (PPFPE) to protect numeric values and strings with leading/trailing and special characters, while preserving their precision, both as a protected value (e.g., ciphertext) and when decrypted are provided. In one aspect, a plaintext string is parsed to detect a first and last sentinel characters, wherein any character(s) preceding the first sentinel character comprises a leading character(s) and any character(s) following the last sentinel character comprises a trailing character(s). Any leading character(s) preceding the first sentinel character and/or any trailing character(s) following the last sentinel character are passed through. A ciphertext string is generated by encrypting the first and last sentinel character using one or more subsets of a set of encryption characters; and encrypting the portion of the plaintext string between the first and last sentinel character using the set of encryption characters.

A system and a method are disclosed for securing sensitive data for transaction requests using tokenization and encryption. A secure transfer system secures sensitive information of transaction requests. The secure transfer system may receive a transaction request file and generate a modified transaction request file by tokenizing values in the received file. For each transaction request in the file, the system may store a representation of the untokenized values in a datastore in conjunction with an identifier of the transaction request. This identifier may be generated from the tokenized values. The secure transfer system may use the identifier to query the datastore for the representation of the untokenized values. The system may decrypt encrypted values in the representation to generate a transaction request file of detokenized values, which may be provided to an automated clearing house to fulfill the transaction requests.

A time optimizing communications system and method is provided because “loose lips sink ships”. Orders get “do by” parameters, “deliver by” times and may be broken into parts according to “do by” parameters, and/or by prioritization for delivery only when the recipient has the need-to-know. Time sensitive and most secret parts are communicated just in time, some data may be sent at randomized times that may bias traffic on communications infrastructure towards bandwidth optimization. Reducing risk of decryption by adversaries occurring quickly enough to frustrate the purposes of orders. Parts may be broken into data blocks and routed and/or stored randomly. An array of pointers records details of their creation and/or storage locations to provide a key for retrieving data blocks and/or reconstructing messages; timing is managed according to mission needs, and priorities. May also reduce peak demand on communications bandwidth.

An encryption method, includes performing, by an encryption system, bit reversal permutation of pixel data of a 2D image, arranging the pixel data as first-pixel data, and applying the 2D image to a butterfly algorithm of fast Fourier transform; determining, by the encryption system, a plurality of data paths based on the first-pixel data; and performing, by the encryption system, a first encryption of the first-pixel data into second-pixel data on a specific data path based on a number of the specific data path among the plurality of data paths.

A technique for protecting a cryptographic key. A user has an identifier and an associated password. The first cryptographic key is designed to decrypt a piece of encrypted data. The user device generates a second cryptographic key by applying a key derivation algorithm to at least the password, then encrypts the first cryptographic key by applying an encryption algorithm parameterized by the second cryptographic key. The user device then provides the encryption of the first cryptographic key to a management device for storage. A response associated with a question is obtained from the user. The user device calculates a result of an application of a function to at least one response associated with a question, then provides a value dependent on the result to a management device for storage. The value then enables the user device to determine the password when it has the response to the corresponding question.

In a general aspect, a GHASH semiconductor intellectual property (IP) core can include circuitry for calculating a GHASH function. The IP core can be configured to calculate the GHASH function by calculating the following quantities:

[00001]$X_0=0;$

[00002]$X_{i+1}=H^k{X}_i+{\displaystyle {.Math.}_{j=0}^{k-1}{\displaystyle {.Math.}_{n=0}^{m-1}{C}_{ki+j}{h}_{ijn},\text{where for any}i\text{and}j;\text{and}}}$

[00003]${\displaystyle {.Math.}_{n=0}^{m-1}{h}_{ijn}=H^j,\text{where}k>1\text{and}m>1.}$

One aspect of the present invention is a secure computation method including, acquiring a plurality of pieces of encrypted analysis target information being a plurality of pieces of encrypted information about an event to be analyzed, and analyzing, based on the plurality of pieces of the encrypted analysis target information, the event without decrypting the plurality of pieces of the encrypted analysis target information. In the secure computation method, encryption keys for the plurality of pieces of the encrypted analysis target information are unitary matrices, and at least one of the encryption keys for the plurality of pieces of the encrypted analysis target information is different from another of the encryption keys.

Systems and methods include a random number pool in communication with a random number device. One or more sets of key data elements are developed using the random number device with one or more variables input into the random number device from the random number pool.