Rapid Montgomery modular multiplier optimization component suitable for national cryptographic sm2p256v1 algorithm

An algorithm and fast technology, applied in the field of information security, can solve problems such as high time complexity, high power consumption, and high hardware design complexity, and achieve the effects of improving computing efficiency, reducing manufacturing costs, and reducing multiplier resources

Inactive Publication Date: 2019-06-25
成都三零嘉微电子有限公司
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] When the information security chip performs national secret calculations, the Montgomery modular multiplier is the most frequently called and most time-consuming module. Although the general algorithm can adapt to any curve parameters, fo

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Rapid Montgomery modular multiplier optimization component suitable for national cryptographic sm2p256v1 algorithm
  • Rapid Montgomery modular multiplier optimization component suitable for national cryptographic sm2p256v1 algorithm
  • Rapid Montgomery modular multiplier optimization component suitable for national cryptographic sm2p256v1 algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] The present invention will be further described, but the protection scope of the present invention is not limited to the following.

[0023] Such as figure 1 As shown, the fast Montgomery modular multiplier optimization components suitable for the national secret sm2p256v1 algorithm include: large number multiplier, temporary variable generator, circular carry accumulator and large number subtractor, input bit width of 256bit large integer A and B obtains a large integer Z with a bit width of 512bit through the large number multiplier, generates temporary variables X1 and X2 through Z, and performs 8 carry-accumulation operations with Z. The result Z obtained by each carry-accumulation is then used as a carry accumulator and The input of the temporary variable generator, after the completion of 8 carry-accumulation operations, if Z is greater than or equal to the large integer constant M, then M is subtracted from Z with a large number, otherwise the result of the 8-fold c...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a rapid Montgomery modular multiplier optimization component suitable for a national cryptographic sm2p256v1 algorithm. The component includes a large number multiplier, a temporary variable producer, a cyclic carry accumulator and a large number subtracter. A large integer A and a large integer B with the bit width of 256 bit are input and processed by the large number multiplier to obtain a large integer Z with the bit width of 512 bit. Temporary variables X1 and X2 are generated through Z, and then the temporary variables X1 and X2 and Z are subjected to carry accumulation operation for eight times. A result Z obtained by carry accumulation of each time is used as an input of the carry accumulator and the temporary variable generator, if Z is greater than or equal to a large integer constant M after eight carry accumulation operations are completed, a large number subtraction operation is performed on M and Z once, otherwise, directly a result of eight timesof the cyclic carry accumulator is output.

Description

Technical field [0001] The present invention relates to the field of information security, in particular to a fast Montgomery modular multiplier optimization component suitable for the national secret sm2p256v1 algorithm. Background technique [0002] When the information security chip performs the national secret calculation, the Montgomery modular multiplier is the most time-consuming module with the highest calling frequency. Although the general algorithm can be adapted to any curve parameter, the national secret recommended curve sm2p256v1, which has an absolute advantage in frequency of use, is used. The loop calculation method has high time complexity, high hardware design complexity and high power consumption. Summary of the invention [0003] The purpose of the present invention is to greatly reduce the multiplier resources, reduce the design complexity of the Montgomery modular multiplier, reduce the hardware power consumption, and design a fast Montgomery modular multip...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F7/72G06F15/78G06F21/77
Inventor 吴汶泰秦放周健薛珊珊
Owner 成都三零嘉微电子有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap