搜索资源列表
简易的矩陣加密編编码法
- 算法介绍 矩阵求逆在程序中很常见，主要应用于求Billboard矩阵。按照定义的计算方法乘法运算，严重影响了性能。在需要大量Billboard矩阵运算时，矩阵求逆的优化能极大提高性能。这里要介绍的矩阵求逆算法称为全选主元高斯-约旦法。 高斯-约旦法（全选主元）求逆的步骤如下： 首先，对于 k 从 0 到 n - 1 作如下几步： 从第 k 行、第 k 列开始的右下角子阵中选取绝对值最大的元素，并记住次元素所在的行号和列号，在通过行交换和列交换将它交换到主元素位
bigint_zxf
- 一个很好用的大整数的类, 最大可支持9999990位的十进制整数， 可进行大整数的加、减、乘、除和取模运算，并带有求大整数的 最大公因数、扩展Euclidean算法、中国剩余定理算法、 Miller-Rabin素性测试算法、随机生成任意位的大整数等函数库， 这个类的动态库曾用于商业软件之中，其可靠性和速度是得到 确认的。用于商业目的可能需要注册。-a good use of the integer type, the biggest 9999990 to support th
modmule_verilog
- 实现乘法后取模运算，已调试好的。可以应用在通信加解密算法中-after realizing multiplication of modular, a good debugger. Can be used in communications encryption algorithm
Desktop
- 在一些应用中，特别是现在的密码学中，常常需要用超过100位的整数来做乘法，以此来对数据加密。现在有两个小于等于100位的大整数a和b（位数相同），请写程序计算出这两个大整数乘积的结果。-In some applications, in particular, cryptography is now often need to do more than 100 integer multiplication as a way to encrypt the data. There are two le
giantnumber
- 无符号大数类 实现了大数四则运算 比较 求余数 其中大数乘法采用分治 除法采用模拟竖式-No sign of large numbers class implements the large numbers seeking four more than the number of operations in which the multiplication of large numbers using analog vertical divider partition
Multiplicative Cipher
- 这是我在学习《计算机安全》时写的一个乘法加密算法，跟大家交流一下！-This is my learning "computer security," wrote a multiplication encryption algorithm, with the exchange about!
BIGIL
- 128位大整数运算源代码 源代码包含128位大整数的加减乘除、取模、乘幂、2进制和10进制转换等运算，可用于大整数运算和加解密算法。 -128 large integer computing source code source code contains 128 large integer addition and subtraction, multiplication and division, modulus, by power, 2-band and 10 hexadecimal
Asymmetric-Key-Cryptosystem
- 非对称密码系统,包含RSA,ECC,大数乘法。-Asymmetric cryptosystems, including RSA, ECC, multiplication of large numbers.
multiplication
- 实现天文数字的乘法操作 以控制台方式运行 可以在加密解密算法中作为函数块运用-big number multiplication
RSA.ZIP
- 产生大素数，进行任何位的RSA加密解密，进行大整数的进制转换，进行大整数的加法和乘法运算。-Generate large prime numbers, any bit RSA encryption and decryption, binary large integer conversion, large integer addition and multiplication.
fastECC
- 椭圆曲线密码系统是最近十几年来获得迅速发展的一类密码系统.椭圆曲线的乘法的快速实现，是密码学中的重要内容，本程序实现椭圆曲线的快速乘法。-Elliptic Curve Cryptography is the last ten years to get the rapid development of a class of cryptosystems. Rapid multiplication of elliptic curves to achieve, is an important part
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.
rsalatest.tar
- rsa encryption using montegomery multiplication algorithm
MontCIOS
- MontMary模乘，用在大数的模幂运算中，在做模幂运算时，使得效率明显变快-MontMary modular multiplication, used in the modular exponentiation of large numbers, when doing modular exponentiation, making efficiency significantly faster
Montgomery
- RSA加密解密算法中重要的模乘算法——montgomery算法的分析与研究。-montgomery modular multiplication in RSA
jsq-
- 该程序是一个简易计算器 实现简单的加减乘除，并添加清楚和退出按钮-The program is a simple calculator simple addition and subtraction, multiplication and division, and add clear and exit button
made
- 实现RSA算法中的解密功能，完成平方乘算法-Implementation of RSA algorithm decryption functions, complete the square multiplication algorithm
encrypt
- 利用矩阵的乘法实现文字的加密和解密算法，该算法的实现基于C语言-Using matrix multiplication achieve a text encryption and decryption algorithm, which is based on the C language to achieve
K-233-(2)
- Scalar Multiplication for Elliptic Curve Cryptography in hardware definition language