Patent classifications
G09C1/00
Encryption processing device, encryption processing method, and computer program product
According to an embodiment, an encryption processing device includes a memory and one or more processors. The memory stores a plurality of divided masks to be applied to an input sentence on which mask processing is performed in unit of processing of a predetermined size corresponding to a size of data obtained by dividing target data of encryption processing into a plurality of pieces, the divided masks having a same size as that of data obtained by further dividing the data of the unit of processing. The one or more processors are configured to: read out the plurality of divided masks from the memory at different respective timings, and generate a plurality of first masks by using the read-out divided masks at different respective timings; and execute arithmetic processing on intermediate data of the encryption processing using the plurality of first masks at different respective timings.
Encryption processing device, encryption processing method, and computer program product
According to an embodiment, an encryption processing device includes a memory and one or more processors. The memory stores a plurality of divided masks to be applied to an input sentence on which mask processing is performed in unit of processing of a predetermined size corresponding to a size of data obtained by dividing target data of encryption processing into a plurality of pieces, the divided masks having a same size as that of data obtained by further dividing the data of the unit of processing. The one or more processors are configured to: read out the plurality of divided masks from the memory at different respective timings, and generate a plurality of first masks by using the read-out divided masks at different respective timings; and execute arithmetic processing on intermediate data of the encryption processing using the plurality of first masks at different respective timings.
Packaging techniques for backside mesh connectivity
The embodiments herein are directed to technologies for backside security meshes of semiconductor packages. One package includes a substrate having a first interconnect terminal of a first type and a second interconnect terminal of a second type. The package also includes a first security mesh structure disposed on a first side of an integrated circuit die and a conductive path coupled between the first interconnect terminal and the second interconnect terminal. The first security mesh structure is coupled to the first interconnect terminal and the second interconnect terminal being coupled to a terminal on a second side of the integrated circuit die.
Security system for using shared computational facilities
A method and system for performing computational jobs securely on a shared computing resource. Data files for the computational job are encrypted on a secure system and the encrypted data files are stored in a data store on the shared computing resource. A key distribution server is established using a secure enclave on a front end of the shared computing resource. Cryptographic keys and application binaries are transferred to the enclave of the shared computing resource using a session key. The computational job is run using an application launcher on compute nodes of an untrusted execution environment of the shared computing resource, the application launcher obtaining the application binaries and the cryptographic keys from the key distribution server.
Method and device for elliptic curve computations by low resource devices
The present disclosure relates to a method and device for performing an elliptic curve cryptography computation comprising: twisting, by a first device based on a first index of quadratic or higher order twist (d), a first point (P′KB) on a first elliptic curve over a further elliptic curve twisted with respect to the first elliptic curve to generate a twisted key (PKB); transmitting the twisted key (PKB) to a further device; receiving, from the further device, a return value (ShS) generated based on the twisted key (PKB); and twisting, by the first device based on the first index of quadratic or higher order twist (d), the return value (ShS) over the first elliptic curve to generate a result (ShS′) of the ECC computation.
Virtual models for communications between autonomous vehicles and external observers
Systems and methods for interactions between an autonomous vehicle and one or more external observers include virtual models of drivers the autonomous vehicle. The virtual models may be generated by the autonomous vehicle and displayed to one or more external observers, and in some cases using devices worn by the external observers. The virtual models may facilitate interactions between the external observers and the autonomous vehicle using gestures or other visual cues. The virtual models may be encrypted with characteristics of an external observer, such as the external observer's face image, iris, or other representative features. Multiple virtual models for multiple external observers may be simultaneously used for multiple communications while preventing interference due to possible overlap of the multiple virtual models.
Virtual models for communications between autonomous vehicles and external observers
Systems and methods for interactions between an autonomous vehicle and one or more external observers include virtual models of drivers the autonomous vehicle. The virtual models may be generated by the autonomous vehicle and displayed to one or more external observers, and in some cases using devices worn by the external observers. The virtual models may facilitate interactions between the external observers and the autonomous vehicle using gestures or other visual cues. The virtual models may be encrypted with characteristics of an external observer, such as the external observer's face image, iris, or other representative features. Multiple virtual models for multiple external observers may be simultaneously used for multiple communications while preventing interference due to possible overlap of the multiple virtual models.
METHOD OF MARKING A SOLID-STATE MATERIAL, MARKINGS FORMED FROM SUCH METHODS AND SOLID-STATE MATERIALS MARKED ACCORDING TO SUCH A METHOD
A process of forming a non-optically detectable authentication marking (210,320, 410,535) in a diamond (200,300). Authentication marking (210,320,410,535) is formed adjacent the outer surface of an article formed from a diamond material having intrinsic optical centers. Method includes the step of applying an image of predesigned authentication marking(210,320,410,535) to a region (201,310,530) of a diamond (200,300) at or adjacent the surface of the diamond (200,300) by way of a direct laser writing; wherein the fluorescence background of the diamond material from intrinsic optical center is suppressed by authentication marking(210,320, 410, 535) under fluorescent imaging, such that the non-optically detectable identifiable authentication marking (210,320,410,535) is viewable against the fluorescence background at the region (201,310,530) of the diamond (200,300) where the authentication marking (210,320,410,535) is applied.
SECRET SURVIVAL DATA PROCESSING SYSTEM, SECRET SURVIVAL DATA PROCESSING APPARATUS, SECRET SURVIVAL DATA PROCESSING METHOD, AND PROGRAM
The present invention provides techniques to calculate the number of surviving and the number of deaths while still concealing survival time data. The present invention includes: a group data position calculation means configured to calculate a share [[g.sup.A]] of a sequence g.sup.A and a share [[g.sup.B]] of a sequence g.sup.B represented by predetermined equations from a share [[g]] of a sequence g of values of group of survival time data included in a survival time data set D; a group data number calculation means configured to calculate a share [[s.sup.A]] and a share [[s.sup.B]] from a share [[t]] of a sequence t of values of time of survival time data included in the survival time data set D, the share [[g.sup.A]], and the share [[g.sup.B]], by [[s.sup.A]]=GroupSum ([[g.sup.A]], [[t]]), [[s.sup.B]]=GroupSum ([[g.sup.B]], [[t]]); and a survival number calculation means.
SYSTEM AND METHOD FOR DIGITAL CIRCUIT EMULATION WITH HOMOMORPHIC ENCRYPTION
Systems and methods for digital circuit emulation with homomorphic encryption include: receiving, by a hardware design tool chain, a customization file containing a predetermined set of one or more cells; converting, by the hardware design tool chain, a first digital circuit representation in a set of hardware design language (HDL) files into a second digital circuit representation based on the predetermined set of cells in the customization file; receiving, by an encrypted circuit emulator, a set of encrypted inputs; and executing, by the encrypted circuit emulator, the second digital circuit representation using the set of encrypted inputs to generate a set of encrypted outputs.