13 results about "Modular exponentiation" patented technology

The invention discloses an unmanned aerial vehicle cluster dynamic cross-domain key management method and system based on the Chinese remainder theorem (CRT), a key generation center generates system public and private keys and public parameters, and a ground station and an unmanned aerial vehicle perform hierarchical registration and verify respective keys; the unmanned aerial vehicles respectively generate signature messages and send the signature messages to a specified ground station for identity verification, and the ground station constructs a group key based on CRT and publishes the group key to the block chain; when a new unmanned aerial vehicle applies for joining, a signature message is sent to the ground station, and the ground station updates and publishes the group key; when the unmanned aerial vehicle applies for leaving, a leaving message is sent to the ground station, and the ground station updates and publishes the group key. According to the method, complex operations such as bilinear pairing operation and large integer modular exponentiation operation are avoided by optimizing the group key derivation process based on the CRT, and the calculation complexity is remarkably reduced. Meanwhile, efficient cross-domain authentication and batch verification are realized through Pedersen commitment and a zero-knowledge proof technology, and communication and calculation overhead is reduced.

A numerical conversion method for a public key cryptography system includes accumulating a first value by using a first modular addition loop according to the first value for generating a second value after a first predetermined loop count is reached, accumulating the second value by using a second modular addition loop according to the second value for generating a third value after a second predetermined loop count is reached, inputting the third value to a Montgomery modular exponentiation function for generating a Montgomery conversion parameter, and converting a first conversion value in an integer domain into a second conversion value in a Montgomery domain.

An improved Paillier cryptosystem generates a product of ciphertext data and plaintext data by inverting ciphertext data using a square of a public encryption key to generate a modular multiplicative inverse of the ciphertext data; subtracting plaintext data from the public encryption key to generate negative plaintext data; and generating a modular exponentiation of the modular multiplicative inverse of the ciphertext data, the negative plaintext data and the square of the public encryption key.

The invention provides an anti-side channel attack decryption method and a multi-core system, and the technical scheme of the invention is that a private key at a fixed position in a Paillier algorithm is split into two types of key pairs based on a random number, and the method comprises the steps: splitting an index in the private key into a first private index and a second private index according to the random number, and splitting a coefficient in the private key into a first private coefficient and a second private coefficient according to the random number. And decryption is carried out according to the two secret key pairs obtained dynamically before each time of decryption, so that each time of modular exponentiation and modular multiplication does not have a fixed item, an attacker is difficult to obtain a fixed feature through side channel attack to capture the private key, and the protection effect on the side channel attack can be improved.

This invention discloses a reconfigurable circuit for public-key cryptography algorithms. This circuit combines coarse / sub-coarse-grained reconfigurable circuits with microcontroller circuits. The sub-coarse-grained reconfigurable unit array employs a reconfigurable multiplier array from a multi-level reconfigurable NTT circuit to support NTT's underlying modular arithmetic. The coarse-grained reconfigurable units, through parameter configuration and data interconnection configuration, are used to implement large integer modular exponentiation and elliptic curve scalar multiplication. Based on the novel multi-level reconfigurable NTT circuit provided in this invention, quantum-resistant cryptographic algorithms can be implemented while also supporting traditional public-key cryptographic algorithms, thus offering advantages such as a small algorithm engine area and high flexibility.

The invention discloses a cryptographic algorithm coprocessor and a cryptographic operation device, and relates to the technical field of information security, and the cryptographic algorithm coprocessor comprises a memory which is used for storing to-be-operated information and an operation result of the to-be-operated information, and the to-be-operated information comprises a text, an image or a language; the controller is connected with the memory and is used for controlling the modular multiplication arithmetic unit to process the to-be-operated information if the to-be-operated information is subjected to modular multiplication operation; if modular exponentiation operation is carried out on the to-be-operated information, the modular exponentiation arithmetic unit is controlled to process the to-be-operated information; the modular multiplication arithmetic unit is connected with the memory and the controller and is used for carrying out modular multiplication operation on the to-be-operated information to obtain a modular multiplication operation result; and the modular exponentiation arithmetic unit is connected with the memory and the controller and is used for carrying out modular exponentiation operation on the to-be-operated information to obtain a modular exponentiation operation result. According to the method and the device, the separation of modular multiplication operation and modular exponentiation operation is realized, the modular multiplication operation and the modular exponentiation operation can be performed in parallel, the operation efficiency is improved, and the resource occupation amount of information encryption is reduced.

The invention relates to the technical field of cryptography hardware acceleration, in particular to a Paillier hardware accelerator based on a distributed multi-core pipeline. The Paillier hardware accelerator comprises a distributed hierarchical multi-core hardware architecture and a Paillier encryption and decryption algorithm executed in the Paillier hardware accelerator, and the distributed hierarchical multi-core hardware architecture splits an encryption and decryption data stream into an assembly line sequentially executed by a pre-processing unit, a distributed modular exponentiation core and a post-processing unit. The modular exponentiation operation of the encryption process of the Paillier encryption and decryption algorithm is converted into modular multiplication and modular addition operation through a simplification mode based on the binomial theorem, so that the encryption and decryption process is adapted to a parallel mechanism of high-digit modular multiplier hardware resource multiplexing and assembly lines in the distributed hierarchical multi-core hardware architecture. The problems of low hardware resource utilization rate, difficulty in time sequence convergence and the like in the prior art are solved, and the performance and the flexibility are remarkably improved.

The invention discloses a digital signature method and terminal equipment, and relates to the technical field of information security, the digital signature method comprises the following steps: executing system parameter determination and key generation operation through a digital signature system, and distributing system parameters and keys; the sending end obtains a to-be-signed message, carries out signature result generation operation, and sends a signature result and the to-be-signed message to the receiving end; and the receiving end executes signature verification judgment operation, outputs a verification result of the to-be-signed message, and sends a retransmission request to the sending end if judging that the to-be-signed message is wrong. According to the method, a random number, a hash function and a linear signature equation are used, confidentiality and randomness of a private key and signature parameters are ensured, the signature length of a signature result is shorter than that of a traditional scheme, the real-time performance of data transmission is improved, arithmetic operation and modular exponentiation operation are mainly adopted as core operation in the signature verification process, complex calculation is avoided, and the signature verification efficiency is improved. And the operation efficiency in a scene in which a large number of digital signature transactions need to be processed is improved.

A computer-implemented method enhances the efficiency and security of cryptographic tasks for modular exponentiation, digital signatures, key generation, and blockchain transaction verification. The method includes receiving a cryptographic task, retrieving a set of operands from memory, decomposing them into smaller parameters to construct multiple cryptographic sub- tasks, allocating non-overlapping memory regions for each sub-task and processes them in parallel. For each sub-task, a pair of variables is initiated in memory, followed by a bit-by-bit iteration through one of the parameters. During this iteration, the variables are updated based on each bit value. Once the iteration is complete, the value of the first variable is stored as an intermediate result in the corresponding memory region. Upon completing all parallel sub-tasks, the device aggregates the intermediate results to produce the final output of the cryptographic task, which is then used to generate verification data for secure communication.

The invention relates to the technical field of passwords, in particular to a decryption operation method, a readable storage medium, a program product and electronic equipment. The decryption operation method is applied to the electronic equipment, the electronic equipment can execute modular exponentiation or scalar multiplication operation, and in the operation, the address of data corresponding to each output variable is not fixed, so that different operation conditions occur in the loop operation of the electronic equipment in the decryption process, and the decryption efficiency of the electronic equipment is improved. However, the addresses of the data required for calculation are the same. If the addresses of the data required by the operation are the same, the power consumption of the electronic equipment for acquiring the data is the same, so that the electronic equipment can be prevented from being guessed to obtain a correct key by clustering attack due to different parameters such as power consumption during decryption operation, and the operation safety of the electronic equipment is improved.

The invention discloses a modular exponentiation optimization method, device and equipment and a storage medium, and relates to the technical field of cryptographic algorithms, and the modular exponentiation optimization method comprises the following steps: determining a target index according to a modular exponentiation task; based on a breadth-first search (BFS) algorithm, iterative node expansion is carried out, parallel modular exponentiation operation is carried out on sub-computing nodes obtained by each time of node expansion until the sub-computing nodes are expanded to target computing nodes, the optimal computing path and the final computing result of the modular exponentiation operation task are determined, and the target computing nodes are the target indexes. According to the scheme, the BFS algorithm and the modular exponentiation operation are deeply fused, and the parallel modular exponentiation operation is performed on the sub-computing nodes obtained by node expansion each time, so that the path search and the modular exponentiation operation are synchronously performed, the final computing result is obtained while the optimal computing path is found, and the execution efficiency of the modular exponentiation operation is effectively improved.

This invention presents an efficient Pearson coefficient calculation method based on a third party in a federated learning environment. The method utilizes the open-source FATE framework for overall computational communication of the Pearson coefficients. The two parties involved in calculating the feature correlation coefficients are party A and party B, with party C serving as the semi-honest third party. Existing schemes require numerous homomorphic encryption operations to securely generate Beaver Triplets. The new scheme, through a semi-honest third party, eliminates homomorphic encryption operations without sacrificing security, securely generating (a,b,c) Beaver Triplets while allowing each party to share the addition secret of (a,b,c). Since the numerous large integer modular exponentiation operations in the original Paillier homomorphic encryption are eliminated, and only tensor dot products and addition / subtraction operations are used, efficiency is significantly improved.

The invention provides a data encryption method and device, a storage medium and electronic equipment, and relates to the technical field of encryption, and the method comprises the steps: obtaining to-be-encrypted target data and an encryption key in a data encryption request under the condition that the data encryption request is received; determining a target modular multiplication operation length of a modular exponentiation operation task corresponding to the target data based on the length of the modulus of the encryption key; under the condition that the target modular multiplication operation length is larger than the maximum operation length of the encryption module, based on the Montgomery modular multiplication algorithm, a modular exponentiation operation task corresponding to the target data is decomposed, a sub-operation task sequence is obtained, and the sub-operation task sequence comprises a plurality of sub-operation tasks; each sub-operation task is one of a sub-modular multiplication operation task and a sub-modular addition operation task, and the operation length of each sub-operation task is matched with the maximum operation length of the encryption module; and executing the sub-operation task sequence through an encryption module to obtain encrypted data corresponding to the target data. And the data encryption requirement can be met.