A processing system includes a memory and a cryptographic accelerator operatively coupled to the memory. The cryptographic accelerator performs a split substitute byte operation within two paths of a cryptographic round by determining a first output from a first path by applying a mapped affine transformation to an input bit sequence represented by an element of a composite field of a finite-prime field, wherein the first output is represented by a first element of the composite field of the finite-prime field, and a second output from a second path by applying a scaled mapped affine transformation to the input bit sequence, wherein the second output is represented by a second element of the composite field and is equal to a multiple of the first output in the composite field.

A system for anonymizing and aggregating protected information (PI) from a plurality of data sources includes a master index server coupled to a data repository. The master index server receives an anonymized records associated with an individual from a plurality of data hashing appliances. The system includes a cluster matching engine that applies a plurality of rules to hashed data elements of the received record for comparing hashed data elements of the record with hashed data elements of a plurality of clusters of anonymized records associated with different individuals stored in the data repository to determine whether the individual associated with the received record corresponds to an individual associated with one of the clusters of anonymized records. When a match is found, the cluster matching engine adds the received record to the cluster of anonymized records associated with that individual.

A user device and one or more server computers securely evaluate a k-nearest neighbor model, with reasonable computation speed and bandwidth utilization, using a combination of techniques. The user device encrypts input vectors using a client's public key to keep client information private. The server computer homomorphically computes a distance between the encrypted input vector and vectors stored in the k-nearest neighbor model. The server computer then engages in a minimization process which results in the user device receiving classification vectors corresponding to the k-nearest neighbors.

Systems and methods are provided for creating and using a sharable file-level key to secure data files. The file-level key is generated based on a workgroup key associated with the data file and unique information associated with the data file. The file-level key may be used to encrypt and split data. Systems and methods are also provided for sharing data without replicating the data on an end user machine. Data is encrypted and split across an external/consumer network and an enterprise/producer network. Access to the data is provided using a computing image generated by a server in the enterprise/producer network and then distributed to end users of the external/consumer network. This computing image may include preloaded files that provide pointers to the data. No access or replication of the data on the enterprise/producer network is needed in order for a user of the external/consumer network to access the data.

Provided are a tag generation device, method and program which are capable of parallel execution, need no precomputation, and are capable of reducing block-cipher calls to the minimum necessary using one block cipher key when a tag to be attached to a message is generated. A tag generation device is provided with: an input means (100) which divides a message into a plurality of blocks; an intermediate chunk hash means (101) to which the blocks included in the message are inputted as an object to be processed, and which, in units of a predetermined number of blocks, using one key, executes encipherment processing and post-processing of encipherment on the blocks in parallel to generate an intermediate output, and designates, as a next object to be processed, a message created by coupling the intermediate output and unprocessed blocks; and a final chunk hash means (102) which, when the number of block in the message or the number of blocks in the message created by coupling the intermediate output and the unprocessed block is a predetermined value or less, generates a tag corresponding to the message.

There is described a challenge-response method for a client device. The method comprises steps of: (a) receiving challenge data, wherein the challenge data is content encrypted using an encryption key, the content including a nonce; (b) using a secured module of the client device to access the content by decrypting the challenge data using a decryption key of the secured module, the decryption key corresponding to the encryption key; (c) processing a version of the content output by the secured module so as to obtain the nonce; and (d) providing the nonce as a response. There is also described a client device for implementing the above challenge-response method. There is also described a computer program which, when executed by a processor, causes the processor to carry out the above challenge-response method. Finally, there is described a computer readable medium storing the above-mentioned computer program.

A JSALE encoder includes a first encryption layer to apply a first encryption key to a plaintext input data. The JSALE encoder includes a row encoding module to: generate parity bits of a current layer of an H-matrix by applying a LDPC encoding process to the encrypted input data, and generate a cryptcoded data appending the parity bits to the encrypted input data. The JSALE encoder includes a second encryption layer to initiate each subsequent round of the JSALE process through round Nr and to output a ciphertext after the Nr round.

A method of a security system to provide access by a requester to an encrypted data object stored in an object store, the requester being authenticated by the object store, the method comprising: receiving, from the object store: the encrypted object having associated an object identifier; and an identifier of the requester; deriving a first cryptographic key to decrypt the object; deriving a second cryptographic key; re-encrypting the object based on the second key and communicating the re-encrypted object to the requester; wherein each of the first and second keys are based on the object identifier, the requester identifier and a secret key portion generated by the security system, the secret key portion being different for each of the first and second keys, the method further comprising: in response to a second authentication of the requester by the security system, communicating the secret key portion for the second key to the requester.

In some examples, applying a first encryption process to input data blocks for encrypted data blocks, applying a deduplication process to the encrypted data blocks for chunks and first hashes, applying a deduplication process to the hashes for a first set of deduplicated hashes and sending it to destination computer. If there are missing data blocks at the computer based on the first set of deduplicated hashes: receiving a second set of deduplicated hashes of the missing data blocks, selecting chunks from the input data blocks of the missing data blocks from the second set of deduplicated hashes, applying a second encryption process to selected chunks for encrypted data chunks, and applying a third encryption process to the first hashes for first encrypted hashes.

A projection device comprises a light source, a first attenuator and a second attenuator, a first driver, a second driver, a light receiving element, and a controller. The light source emits light. The first attenuator and the second attenuator attenuate intensity of the light from the light source. The first driver drives the first attenuator. The second driver drives the second attenuator. The light receiving element receives the light distributed by the second attenuator. The controller controls the second driver to control the distribution ratio of the light distributed to the light receiving element by the second attenuator according to control of transmissivity of light at the first attenuator by the first driver.