Security protocol method, computer device and storage medium

Abstract

A security protocol method, a compute device and storage medium. The method of one embodiment includes: after determining the middle component of current participant based on the additive shared component of current participant of the prime number to be determined, sharing the power exponent approximate integer of the prime number to be determined with the opposite participant to obtain the powerexponent approximate integer shared component of current participant; Sharing the modular operation result with the opposite participant, obtaining the shared component of the current participant modular operation, sequentially performing polynomial multiplication sharing and modulo-digital operation with the opposite participant, and obtaining the shared secret component of the current participant; after the current participant exchangesshared secret component of the current participant, When the recovered first shared secret coincides with the recovered second shared secret of the opposite end participant, returning the operation result of the shared modulo finger until the number of cycles reaches the preset safe number of cycles, and when the first shared secret and the second shared secret coincide in each cycle of the preset safe number of cycles, judging the primes to be determined to be prime numbers.

Description

technical field [0001] The invention relates to the technical field of cryptography, in particular to a security protocol method, computer equipment and computer storage medium. Background technique [0002] The RSA distributed key, by storing the components of the RSA private key in each participant, requires each participant to cooperate to execute the RSA signature generation operation when performing RSA signature. Taking RSA distributed key escrow as an example, by storing the components of the RSA private key on the escrow platform and the client separately, the client and the escrow platform are required to perform the RSA signature generation operation in cooperation, thereby preventing the key escrow organization from abusing power. In order to ensure the security of the private key of the distributed key, at the stage of generating the private key, two or more participants are required to generate the private key component by executing the secure multi-party comput...

AI Technical Summary

Problems solved by technology

However, due to the final calculated RSA modulus N and the published intermediate result N 1 Between, the common factor (a+b) can be obtained by calculating the greatest common divisor, so it is not safe and has no practical value

Images