prime number module 中文意思是什麼
prime number module
解釋
素數模數-
Finally, this thesis develops a stimulated system in vc + + 6. 0 to ensure that the 2400 - bitted long rsa key can be created and be used to encrypt / decrypt des key in comparatively short time, by developing the division, power module, power inverse and big prime algorithms using big number
最後,本文用vc + + 6 . 0設計出一個模擬系統,通過開發出大數除法,模冪,模逆,大素數生成的演算法來保證在較短時間內生成2400位長度(二進制)的rsa密鑰以及運用其對des密鑰進行加解密處理。 -
The author mainly realized the method of generating the large random numbers and judging the prime number using lehmann means, then three pairs of secure key with different lengths ( 256 bits, 512 bits, 1024 bits ) was generated to meet the demand of different security grade. in encryption module, modular multiplication arithmetic of large number was realized adopting addition chaining. in decryption module, extended euclid was used to get inverse, and the chinese remainder theorem was used to realize decryption, which increased the speed of decryption greatly
作者主要實現了大隨機數的生成、採用整除小素數和勒曼測試法判定素數,可以生成三種不同長度的密鑰對( 256位、 512位、 1024位)來滿足不同的加密安全等級的需求;加密模塊中,選用了二進制序列的乘法方法,實現了大數模冪乘運算;解密模塊中,引用了擴展的歐幾里德法求逆元,並採用中國剩餘定理實現解密過程,大大提高了解密速度。
分享友人