G06F7/556

FINAL EXPONENTIATION CALCULATION DEVICE, PAIRING OPERATION DEVICE, CRYPTOGRAPHIC PROCESSING DEVICE, FINAL EXPONENTIATION CALCULATION METHOD, AND COMPUTER READABLE MEDIUM

In a final exponentiation calculation device, a decomposition unit (221) decomposes an exponent part into an easy part and a hard part, using a cyclotomic polynomial, in a final exponentiation calculation part of a pairing operation on an elliptic curve represented by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k, and a parameter u. A transformation unit (222) transforms the hard part obtained by decomposition by the decomposition unit (221) into a linear sum of the polynomial q(u). An exponentiation calculation unit (23) calculates the final exponentiation calculation part, using the easy part and the hard part transformed into the linear sum of the polynomial q(u).

Blockchain verification using non-consecutive blocks

An example operation may include one or more of receiving a request to store a data block on a hash-linked chain of data blocks, dynamically selecting a subset of non-consecutive data blocks which have been previously stored within the hash-linked chain of data blocks, generating a linking hash based on a hash value of the data block to be stored and an accumulation of hash values from the subset of non-consecutive data blocks, and adding the data block to the hash-linked chain of data blocks, wherein the added data block includes the linking hash stored therein.

Blockchain verification using non-consecutive blocks

An example operation may include one or more of receiving a request to store a data block on a hash-linked chain of data blocks, dynamically selecting a subset of non-consecutive data blocks which have been previously stored within the hash-linked chain of data blocks, generating a linking hash based on a hash value of the data block to be stored and an accumulation of hash values from the subset of non-consecutive data blocks, and adding the data block to the hash-linked chain of data blocks, wherein the added data block includes the linking hash stored therein.

SYSTEM AND METHOD FOR ONE-TIME CHINESE-REMAINDER-THEOREM EXPONENTIATION FOR CRYPTOGRAPHIC ALGORYTHMS
20170257211 · 2017-09-07 · ·

A system, method and computer-readable storage medium with instructions for protecting an electronic device against fault attack. The technology includes operating the electronic device to determine two half-size exponents, dp and dq, from the exponent d; to split the base m into two sub-bases mp and mq determined from the base m; and to iteratively compute a decryption result S by repeatedly multiplying an accumulator A by m, mp, mq or 1 depending on the values of the i-th bit of dp and dq for each iteration I′. Other systems and methods are disclosed.

SYSTEM AND METHOD FOR ONE-TIME CHINESE-REMAINDER-THEOREM EXPONENTIATION FOR CRYPTOGRAPHIC ALGORYTHMS
20170257211 · 2017-09-07 · ·

A system, method and computer-readable storage medium with instructions for protecting an electronic device against fault attack. The technology includes operating the electronic device to determine two half-size exponents, dp and dq, from the exponent d; to split the base m into two sub-bases mp and mq determined from the base m; and to iteratively compute a decryption result S by repeatedly multiplying an accumulator A by m, mp, mq or 1 depending on the values of the i-th bit of dp and dq for each iteration I′. Other systems and methods are disclosed.

Method for Low Resource and Low Power Consuming Implementation of Nonlinear Activation Functions of Artificial Neural Networks

A method does not use high resource and high power consuming memory elements (LUT, Block RAM, etc.) or a distributed RAM in an implementation of nonlinear activation functions of artificial neural networks (ANN), eliminating a need for multiplication elements completely by using shift operations. Since each neuron includes an activation function, eliminating a multiplication element saves significant amount of resource and power in an implementation of the ANN.

METHOD OF CONTROLLING A VOLUME WHICH CAN BE CONVEYED WITH A METERING PUMP
20210396219 · 2021-12-23 ·

The present invention concerns a method of controlling a liquid volume which can be conveyed with a metering pump in a given time, comprising the steps: a. providing an input signal for controlling the liquid volume which can be conveyed with the metering pump in the given time, and b.lLinking the input signal to an actuating signal which influences the liquid volume which can be conveyed with the metering pump in the given time so that a change in the input signal leads to a change in the actuating signal and thus a change in the liquid volume which can be conveyed. To react to individual process demands it is proposed according to the invention that linking in step b. is effected in such a way that a change in the input signal leads to a change in the liquid volume which can be conveyed with the metering pump in the given time, which change in the liquid volume is non-proportional to the change in the input signal.

METHOD OF CONTROLLING A VOLUME WHICH CAN BE CONVEYED WITH A METERING PUMP
20210396219 · 2021-12-23 ·

The present invention concerns a method of controlling a liquid volume which can be conveyed with a metering pump in a given time, comprising the steps: a. providing an input signal for controlling the liquid volume which can be conveyed with the metering pump in the given time, and b.lLinking the input signal to an actuating signal which influences the liquid volume which can be conveyed with the metering pump in the given time so that a change in the input signal leads to a change in the actuating signal and thus a change in the liquid volume which can be conveyed. To react to individual process demands it is proposed according to the invention that linking in step b. is effected in such a way that a change in the input signal leads to a change in the liquid volume which can be conveyed with the metering pump in the given time, which change in the liquid volume is non-proportional to the change in the input signal.

Dynamic aggregation of data from separate sources

Generally described, one or more aspects of the present application correspond to techniques for dynamically aggregating data records from separate sources. The data merging process can be implemented by an aggregation computing resource that uses a lockstep paging system to query multiple database platforms for the same range of records, merges the records returned by the database platforms, and continues identifying a next range of records for which the database platforms should be queried until all records have been merged into a single listing. These techniques can be used to unify records during a database migration process.

METHOD FOR GENERATING RANDOM SEQUENCE USING EXPONENTIAL FUNCTION AS RANDOM NUMBER SOURCE
20210382695 · 2021-12-09 · ·

A method for generating a random sequence using an exponential function as a random number source, including: providing an exponential function a.sup.b, wherein, the base a is an integer, and the exponent b is an integer; expanding a value of the exponential function into a first preliminary sequence in decimal; and using the first preliminary sequence as a random number source to generate a random sequence.