G09C1/00

Computing device processing expanded data
11528123 · 2022-12-13 · ·

The present invention relates to a computing device for executing a first cryptographic operation of a cryptographic process on useful input data, said computing device comprising a first processor, a second processor and a selection circuit wherein: —said selection circuit is configured: —for receiving, from an input bus, expanded input data obtained by interleaving dummy input data with said useful input data, —for determining positions of the dummy input data in said expanded input data, —and for extracting said dummy input data and said useful input data from the expanded input data based on said determined positions, —said first processor is configured for executing said first cryptographic operation of said cryptographic process on said extracted useful input data to obtain useful output data, —said second processor is configured for executing a second operation on said extracted dummy input data to obtain dummy output data, said computing device being configured for having said operations executed such that leakage generated by said first cryptographic operation is jammed by leakage generated by the second operation.

INFORMATION PROCESSING DEVICE, TERMINAL DEVICE, AND SEARCH METHOD
20220391351 · 2022-12-08 ·

An information processing device (100) has: an acquisition unit (131) which acquires, from a second terminal device (50) of a second user, an encryption search index, which is a search keyword encrypted by searchable encryption using a shared key and a verification key acquired from a first terminal device (10) of a first user who owns a document, and an identifier of the second user who searches for the document; a test unit (132) which checks a database, in which the encrypted-document index of an encrypted keyword of the document generated in the first terminal device (10), an encrypted document associated with the encrypted-document index, and a test key and a re-encryption key corresponding to the second user are registered, and tests the encryption search index by using the test key based on the identifier of the second user; and a generation unit (133, 134) which encrypts the encrypted document, which has been searched for by using the tested encryption search index, by the re-encryption key based on the identifier of the second user to generate a search result.

INFECTIVE COUNTERMEASURES

The invention proposes a novel type of infective countermeasure against fault injection attacks. Instead of determining the injected error before amplifying it, the novel countermeasure applies the same diffusion function to two intermediate ciphers obtained by executing a cryptographic operation on an input. The error is therefore amplified within the same intermediate ciphers, referred to as infective ciphers after diffusion. It is then possible to use diffusion functions which do not map the cipher 0 as an output equal to 0. A cipher recomposed from bits of undiffused ciphers is also generated. These infective and recomposed ciphers are XOR-combined to provide an output cipher. This approach makes it possible to adapt, by simple duplication of the pairs and associated specific diffusion functions, the protection offered by the countermeasure to a desired number of injected faults.

Apparatus and method for encryption and decryption based on tweak converter to which key table is applied

A method according to one embodiment includes generating one or more key tables based on a first seed value; generating one or more secret values from a tweak value based on the one or more key tables; and performing encryption or decryption using the one or more secret values. An apparatus according to one embodiment includes a key table generator configured to generate one or more key tables based on a first seed value, a secret value generator configured to generate one or more secret values from a tweak value based on the one or more key tables, and an encryptor/decryptor configured to perform encryption or decryption using the one or more secret values.

Apparatus and method for encryption and decryption based on tweak converter to which key table is applied

A method according to one embodiment includes generating one or more key tables based on a first seed value; generating one or more secret values from a tweak value based on the one or more key tables; and performing encryption or decryption using the one or more secret values. An apparatus according to one embodiment includes a key table generator configured to generate one or more key tables based on a first seed value, a secret value generator configured to generate one or more secret values from a tweak value based on the one or more key tables, and an encryptor/decryptor configured to perform encryption or decryption using the one or more secret values.

Acoustical physically unclonable function (puf) and system

The present invention is a diverse acoustical object containing a range of particles that have acoustical wave impedances that are substantially different from the binder. The particles create a substantially different reflection as an acoustic wave is scattered by the particles. A negative reflection is created when the scattered wave is from a particle that has a wave impedance that is substantially less than the binder impedance. Practically, it may be necessary to encase this material in a thin material that will withstand the fabrication process (e.g., air or silicone elastomer could be encased in glass). If the wavelength is large compared to the encasing material thickness, then the reflection will be more dependent on the interior material. A mixture of materials that generate positive as well as negative reflections within the binder would add to the complexity of the PUF.

HARDWARE ARCHITECTURE FOR MEMORY ORGANIZATION FOR FULLY HOMOMORPHIC ENCRYPTION
20220385447 · 2022-12-01 ·

Systems and memory devices are disclosed for fully homomorphic encryption (FHE). The system may include a processing unit including: a data memory for storing coefficients for a polynomial; a twiddle factor (TF) memory for storing TF values associated with the polynomial; a TF register connected to the TF memory; a plurality of first registers connected to the data memory; a plurality of first MUXs connected to the first registers; a plurality of second registers connected to the plurality of first MUXs; a plurality of Butterfly (BF) cores connected to the plurality of the second registers and the TF register; wherein each of the plurality of BF cores is configured to, responsive to a control signal, perform a Butterfly Transform (BFT) operation based on two coefficients from the data memory and a TF value from the TF memory.

Intelligent automated assistant for TV user interactions

Systems and processes are disclosed for controlling television user interactions using a virtual assistant. In an example process, a virtual assistant can interact with a television set-top box to control content shown on a television display. Speech input for the virtual assistant can be received from a device with a microphone. The speech input can comprise a query associated with content shown on the television display. A user intent of the query can be determined based on one or more of the content shown on the television display and a viewing history of media content. A result of the query can be caused to be displayed based on the determined user intent.

Intelligent automated assistant for TV user interactions

Systems and processes are disclosed for controlling television user interactions using a virtual assistant. In an example process, a virtual assistant can interact with a television set-top box to control content shown on a television display. Speech input for the virtual assistant can be received from a device with a microphone. The speech input can comprise a query associated with content shown on the television display. A user intent of the query can be determined based on one or more of the content shown on the television display and a viewing history of media content. A result of the query can be caused to be displayed based on the determined user intent.

System configuration control of a hardware system

The method includes creating and sending a change request for a change to the system configuration of the hardware system by means of a first hardware component of the plurality of hardware components, receiving the change request by means of the further hardware components of the plurality of hardware components, checking the change request by means of the further hardware components for compatibility of the change request with the configuration of the particular receiving hardware component by using configuration data of the receiving hardware component, in the case that the requested change to the system configuration is compatible with the configuration of the receiving hardware component, generating and sending an approval of the change to the system configuration by means of the receiving hardware component, and in the case that an approval quorum of the hardware components that is necessary for consent is achieved, entering the requested change to the system configuration of the hardware system into the block chain, implementing the requested change to the system configuration in the hardware system.