An optimized implementation method for inverse expansion of SM9 identification cryptographic algorithm
By reducing the dimensionality of the domain expansion data in the SM9 identification cryptography algorithm and converting the inverse operation into the base domain operation, the problem of inefficient calculation of the domain expansion inverse operation in the SM9 algorithm is solved, and more efficient calculations and smaller memory usage are achieved.
Patent Information
- Application Number
- CN202011591633.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-12-29
- Publication Date
- 2025-03-25
- Estimated Expiration
- 2040-12-29
AI Technical Summary
During the bilinear pair calculation process of SM9 identification cryptography algorithm, the inverse operation and base domain calculation in the 12 domain expansions occupy a large amount of computing resources, resulting in inefficient computing.
The domain expansion data is reduced by the properties of domain expansion conjugation, and the 12 domain expansion inversion is converted into 3 domain expansion inversion, and the mathematical method of the to be determined coefficients is used to convert the 3 domain expansion inversion into the base domain inversion and base domain operation.
It significantly reduces the calculation amount of domain expansion inversion operation, improves computing efficiency, and reduces memory usage, and is suitable for resource-constrained devices.