搜索资源列表
ModInverse
- 求余的逆的算法， 拥有许多其他功能，可以求指数求余，蒙格马利算法-for the inverse algorithm, has many other functions, I seek for index, the Montgomery algorithm, etc.
新建 Microsoft Word 文档
- RSA核心运算使用的乘模算法就是 M(A*B)。虽然M(A*B)并不是乘模所需要的真正结果，但只要在幂模算法中进行相应的修改，就可以调用这个乘模算法进行计算了。本软件起初未使用Montgomery 乘模算法时，加密速度比使用Montgomery乘模算法慢，但速度相差不到一个数量级。 将上述乘模算法结合前面叙述的幂模算法，构成标准Montgomery幂模算法，即本软件所使用的流程
Montgomery
- 编写的蒙哥马利算法实现，是初学者最好的学习代码。用C语言实现-Montgomery algorithm，the best code for beginners
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
OReilly[1].Natural.Language.Processing.with.Python
- Natural Language Processing with Python-Natural Language Processing with Python by Steven Bird, Ewan Klein, and Edward Loper Copyright © 2009 Steven Bird, Ewan Klein, and Edward Loper. All rights reserved. Printed in the United States of A
montgomery
- Just a simple dynamic programming project for a CS class. Finds longest palindromic subsequence of an input string-Just a simple dynamic programming project for a CS class. Finds longest palindromic subsequence of an input string
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.
monExpFUNCIONANDOv040208.mw
- Montgomery modular exponentiation in maple.
N_C
- Medium module for calcilating Modular Multiplication by Montgomery algorithm. q = (x0 + ai*b0)*m_sh. It calculate m_sh. For it it need the LSB byte of module. My E-mail: suhrob106@rambler.ru
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
Improved-Montgomery-algorithm-
- 改进的基2 Montgomery算法，解决了大素数的加解密运算问题-Improved base 2 Montgomery algorithm to solve the encryption and decryption of large prime numbers computing problems
Montgomery
- RSA加密解密算法中重要的模乘算法——montgomery算法的分析与研究。-montgomery modular multiplication in RSA
Montgomery
- montgomery加密算法在ARM处理器上实现，-Montgomery encryption algorithm is implemented on an ARM processor,
Montgomery-VLSI
- 基为16的高速Montgomery模乘法器VLSI设计-Montgomery VLSI
Montgomery
- Montgomery Invert Algo
Algorithm for Fast Montgomery multiplication
- general algorithm for fast montgomery multiplication