Patent classifications
H04L9/34
Semiconductor device and security system
A semiconductor device is provided. The semiconductor device includes a unique-information generation portion, a detection portion, a memory portion, and a readout portion. The unique-information generation portion operates in a plurality of operation environments to generate unique information. The unique information includes stable information and unstable information. The stable information is constant in the plurality of operation environments, and the unstable information is different in at least two of the plurality of operation environments. The detection portion detects the unstable information. The memory portion stores the unique information and identification information for identifying the unstable information. The readout portion reads out the unique information and the identification information and outputs the unique information and the identification information to an external portion.
Circuit concealing apparatus, calculation apparatus, and program
At least any one of input keys K.sub.A.sup.0, K.sub.A.sup.1, K.sub.B′.sup.0, and K.sub.B′.sup.1 is set so that the input keys K.sub.A.sup.0, K.sub.A.sup.1, K.sub.B′.sup.0, and K.sub.B′.sup.1 which satisfy K.sub.A.sup.1−K.sub.A.sup.0=K.sub.B′.sup.1−K.sub.B′.sup.0=d.sub.i are obtained, and an output key K.sub.i.sup.g(I(A), I(B)) corresponding to an output value g.sub.i(I(A), I(B)) is set by using the input keys K.sub.A.sup.0, K.sub.A.sup.1, K.sub.B′.sup.0, and K.sub.B′.sup.1, where input values of a gate that performs a logical operation are I(A), I(B)∈{0, 1}, an output value of the gate is g.sub.i(I(A), I(B))∈{0, 1}, an input key corresponding to the input value I(A) is K.sub.A.sup.I(A), and an input key corresponding to the input value I(B) is K.sub.B′.sup.I(B).
Circuit concealing apparatus, calculation apparatus, and program
At least any one of input keys K.sub.A.sup.0, K.sub.A.sup.1, K.sub.B′.sup.0, and K.sub.B′.sup.1 is set so that the input keys K.sub.A.sup.0, K.sub.A.sup.1, K.sub.B′.sup.0, and K.sub.B′.sup.1 which satisfy K.sub.A.sup.1−K.sub.A.sup.0=K.sub.B′.sup.1−K.sub.B′.sup.0=d.sub.i are obtained, and an output key K.sub.i.sup.g(I(A), I(B)) corresponding to an output value g.sub.i(I(A), I(B)) is set by using the input keys K.sub.A.sup.0, K.sub.A.sup.1, K.sub.B′.sup.0, and K.sub.B′.sup.1, where input values of a gate that performs a logical operation are I(A), I(B)∈{0, 1}, an output value of the gate is g.sub.i(I(A), I(B))∈{0, 1}, an input key corresponding to the input value I(A) is K.sub.A.sup.I(A), and an input key corresponding to the input value I(B) is K.sub.B′.sup.I(B).
Computer-readable recording medium storing generation program for generating aggregation hash value by aggregating hash values for blocks of content, and generation apparatus for generating aggregation hash value by aggregating hash values for blocks of content
A non-transitory computer-readable recording medium stores a generation program for causing a computer to execute a process including: dividing a target content into a plurality of blocks so that head information of the target content is distributed to the blocks different from each other, according to a predetermined rule; generating a hash value corresponding to each of the plurality of divided blocks; generating an aggregation hash value by aggregating the generated hash values; and outputting the generated aggregation hash value.
Computer-readable recording medium storing generation program for generating aggregation hash value by aggregating hash values for blocks of content, and generation apparatus for generating aggregation hash value by aggregating hash values for blocks of content
A non-transitory computer-readable recording medium stores a generation program for causing a computer to execute a process including: dividing a target content into a plurality of blocks so that head information of the target content is distributed to the blocks different from each other, according to a predetermined rule; generating a hash value corresponding to each of the plurality of divided blocks; generating an aggregation hash value by aggregating the generated hash values; and outputting the generated aggregation hash value.
Methods and systems for reducing propagation delays in hardware implementation of ZUC cryptographic algorithms
Embodiments of present disclosure relates to and systems to reduce propagation delays in hardware implementation of 3GPP confidentiality or standardized algorithm 128-EEA3 and 3GPP integrity algorithm 128-EIA3 using ZUC module. The reduction of the propagation delays is achieved by improving or optimizing secondary critical paths, which are subsequent to primary critical path, related to the 3GPP confidentiality or standardized algorithm 128-EEA3 and the 3GPP integrity algorithm 128-EIA3. Non-conventional modifications in the hardware implementation are proposed for the improvement or optimization.
Methods and systems for reducing propagation delays in hardware implementation of ZUC cryptographic algorithms
Embodiments of present disclosure relates to and systems to reduce propagation delays in hardware implementation of 3GPP confidentiality or standardized algorithm 128-EEA3 and 3GPP integrity algorithm 128-EIA3 using ZUC module. The reduction of the propagation delays is achieved by improving or optimizing secondary critical paths, which are subsequent to primary critical path, related to the 3GPP confidentiality or standardized algorithm 128-EEA3 and the 3GPP integrity algorithm 128-EIA3. Non-conventional modifications in the hardware implementation are proposed for the improvement or optimization.
SYSTEM AND METHOD FOR INTERACTION OBJECT MANAGEMENT IN A BLOCKCHAIN ENVIRONMENT
A system and method for block management of interactions comprising a network-connected block management computer connected to a plurality of connected devices and to one or more blockchains to enable an object compiler to receive a plurality of criteria from a requesting device. The compiler the receives a plurality of blocks from the blockchains based on the criteria. Each block corresponding to a preconfigured interaction object previously written by devices either during or after the completion of a transaction. The compiler analyzes the preconfigured interaction objects to determine if there is corresponding supplemental object. The compiler requests the supplemental blocks from the blockchains, and processes supplemental objects based on type, if no corresponding supplemental object it found, the associated interaction object is flagged.
SYSTEM AND METHOD FOR INTERACTION OBJECT MANAGEMENT IN A BLOCKCHAIN ENVIRONMENT
A system and method for block management of interactions comprising a network-connected block management computer connected to a plurality of connected devices and to one or more blockchains to enable an object compiler to receive a plurality of criteria from a requesting device. The compiler the receives a plurality of blocks from the blockchains based on the criteria. Each block corresponding to a preconfigured interaction object previously written by devices either during or after the completion of a transaction. The compiler analyzes the preconfigured interaction objects to determine if there is corresponding supplemental object. The compiler requests the supplemental blocks from the blockchains, and processes supplemental objects based on type, if no corresponding supplemental object it found, the associated interaction object is flagged.
Distributed data security
First data from a user device is received on an electronic computing device. The first data is encrypted to generate second data. The second data is fragmented and stored in a plurality of data stores.