A parallel acceleration method for GPU-based multi-variable cryptographic algorithms

Abstract

The invention discloses a GPU-based multivariable cryptographic algorithm parallelization acceleration method, the method comprising the following steps: S1, performing the same-order operation on all items of the multivariable equation; S2, generating a multiplication table on the GF2 field; S3. Map the item number table and the multiplication table to the texture memory of the GPU; S4. Call the multivariable main kernel function for each piece of data to calculate and execute the Reduce operation; S5. Write the main function to schedule the multivariable main kernel function; S6. Execute the program, output the encryption and decryption results, and release resources. The present invention mainly optimizes the cryptographic algorithm of the multivariable cryptographic system by synchronizing all items of the multivariate and combining the idea of ​​Map-Reduce, and taking the SpongeMPH hash function algorithm as an example, the following CUDA platform is provided Implementation and performance comparison. Experiments show that the scheme improves the operation efficiency of the algorithm and can be used to accelerate the cryptographic algorithm based on the multivariate cryptosystem.

Description

technical field [0001] The present invention relates to the technical field of cryptographic algorithms, and more specifically, relates to a parallel acceleration method for multivariable cryptographic algorithms based on GPU. Background technique [0002] Graphics processing unit (GPU) was originally designed for image processing. In recent years, due to the limitation of CPU power consumption and the rapid growth of computing requirements, the computing power of GPU has developed rapidly at a speed far exceeding Moore's Law, which has prompted GPU to be widely used in field of scientific computing. [0003] Multivariate cryptographic algorithms are cryptographic schemes that use multivariate polynomials over finite fields. The problem of solving multivariable polynomial equations over finite fields is an NP-hard problem, which is one of the current design ideas for anti-quantum attacks. However, the multivariate cryptographic algorithm has a large amount of computation, ...

AI Technical Summary

Problems solved by technology

However, the multivariate cryptographic algorithm has a large amount of computation, resulting in low efficiency, which is a major aspect that limits its practicability.

Images