搜索资源列表
新建 Microsoft Word 文档
- RSA核心运算使用的乘模算法就是 M(A*B)。虽然M(A*B)并不是乘模所需要的真正结果，但只要在幂模算法中进行相应的修改，就可以调用这个乘模算法进行计算了。本软件起初未使用Montgomery 乘模算法时，加密速度比使用Montgomery乘模算法慢，但速度相差不到一个数量级。 将上述乘模算法结合前面叙述的幂模算法，构成标准Montgomery幂模算法，即本软件所使用的流程
RSA
- RSA算法的实验报告，有源码、流程图、时间复杂度分析等。-RSA algorithm experimental reports, source code, flowcharts, time complexity analysis.
refine_RSA
- 实现了蒙哥马利算法，能够对2048，1024.512位的RSA进行加解密运算，能够自动生成密钥-Montgomery algorithm is implemented, can 2048,1024.512 bit RSA encryption and decryption operations to automatically generate the keys
GFP_MONT_INV_Project
- this the MONTGOMERY INV routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the MONTGOMERY INV routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or a
RSA_Montgomery
- 基于蒙哥马利算法的RSA c++实现 经验证正确可用-Implement RSA based on Montgomery Modular Exponentation
montright29032004.tar
- Montgomery modular multiplication in C. Very important to perform modular exponentiation as needed in RSA cryptosystems.
montgomeryMot
- Montgomery modular multiplication in maple. Used for modular exponentiation in RSA cryptosystems.
Montgomery-apply
- Montgomery算法被认为是计算大数模乘的最快的算法。本文详细叙述了它的理论基础和算法原理,加以改进并应用在RSA 模幂运算中。-Montgomery algorithm is considered the model of large numbers by calculating the fastest algorithm. This paper describes its theoretical basis and algorithm theory, be improved and
Montgomery
- RSA加密解密算法中重要的模乘算法——montgomery算法的分析与研究。-montgomery modular multiplication in RSA
MRSA_Montgomeo
- 基于蒙哥马利算法的RSA c+++实现经验证正确可用可直接使用。 -Montgomery algorithm RSA c+++ proven correct can be used directly.
rsa-VCPP
- RSA算法的VC++实现，包括参数选取，蒙哥马利模指数算法-the implement of RSA algorithm useing VC++,Including the selection of parameters, Montgomery modular exponentiation algorithm
verilog-montgomery-RSA
- 基于Montgoery 算法的RSA,FPGA verilog 实现，有测试文件-Based on Montgoery algorithm for RSA,FPGA verilog implementation，bench file
RSA-(1)
- RSA生成大素数 加密解密 蒙哥马利算法 MFC界面-RSA encryption and decryption generate large prime numbers Montgomery algorithm MFC interface
RSA
- RSA加密解密，采用gmp大数库，包括普通解密，蒙哥马利解密，模重复平方+中国剩余定理解密-RSA encryption and decryption, using large numbers gmp library, including common decryption, Montgomery decryption, repeat mode decryption square+ Chinese Remainder Theorem
RSA_32Bit
- RSA 32bit 簡易實現，可看到MFC的使用者介面，使用蒙哥馬利模乘方法。-RSA 32 bit with MFC UI, with Montgomery muliplication