搜索资源列表
Modular Exponentiation Algorithm Analysis
- Modular Exponentiation Algorithm Analysis
Exponentiation
- 这是pku1001的源码，黄英大家使用，多多交流。
Project1
- This project requires you to write a program that imitates a simple desk calculator. Your calculator must be able to accept an infix expression which at least includes (, ), +, -, *, /, ％, and ^ (exponentiation operator, a^b = ab ). If the expression
ACM,Exponentiation
- 北大ACM题集中的Exponentiation解法，效率较高，大整数乘法算法。
基于二叉树求算术表达式求值的课程设计
- 这是本人做的关于基于二叉树求算术表达式求值的课程设计，供大家一起学习。表达式求解问题 设计一个程序实现基于二叉树表示的算术表达式的操作。 1、 需求分析 1. 算术表达式的合法输入数据包括变量（A~Z,a~z）、常量（0－9）和二元运算符（＋，－，＊，／，^（乘幂））。程序对数据输入格式不作要求，用户需自己保证语法正确，详见用户手册说明。 2. 演示程序以人机对话的方式执行，即在计算机上显示提示信息后，由用户在键盘上输入对应的数据或命令，程序将执行相应的操作并显示下一步信息。 3. 程
momi
- 大数的模幂算法(GUI)，用密码学课本中的算法，快速、高效。计算(x的r次方) mod p 的值-Large numbers of modular exponentiation algorithm (GUI), used cryptography algorithm textbooks, fast and efficient. Calculation of (x of the r-th power) mod p value
1001Exponentiation
- POJ 1001 Exponentiation
RSA_spadpa_attcaks_and_defenses_design_based_on_80
- (繁体中文版)台湾出品不得多得的关于spa dpa 旁道攻击rsa算法的精彩论文。相对国内的一些翻译性质的、粗制滥造的论文，简直是一个天上一个地下。-As information technology has developed rapidly, it provides more convenient life for people. As the result, the security has become the main concern. Recently, user id and pa
MOD
- 模指数运算的求解 用VC++6.0编写的 包含所有代码-Solving the modular exponentiation using VC++6.0 prepared that contains all the code
CH15
- 15.3 复数乘幂opowr.c 15.4 复数的N次方根ontrt.c 15.5 复数指数ocexp.c 15.6 复数对数oclog.c 15.7 复数正弦ocsin.c 15.8 复数余弦occos.c 15.9 复数作图oplot.c-15.3 Complex exponentiation opowr.c 15.4 plural N-th power root ontrt.c 15.5 plural index ocexp.c 15.6 complex logar
bigInt
- 大整数的幂运算原代码（数组实现），在 dev c++中通过 -Large integer exponentiation of the original code (the array to achieve), the dev c++ through
plx
- 一个经过本人修改的扩展了许多功能的pl/x编译器，具有求余和求幂运算功能-After I modified an extension of a number of functions pl/x compiler, with the remainder, and exponentiation computing capabilities
(Addition_chains_and_Montgomery_algorithm_for_mixe
- 利用加法链与蒙哥马利算法的混合，加快求幂模运算时的速度·-Montgomery algorithm using additive mixed chain and speed up exponentiation modulo the speed
Exponentiation.tar
- 高精度幂计算，北京大学ACM OJ上的Exponetiation-Exponentiation
Exponentiation
- 规范化乘幂函数求模的最大值和最大向量，又叫规范化幂乘法-Seek mode power function normalized by the maximum and the maximum vector
suanfajihe
- ( Rightmost Digit )代码：数论模幂算法（从左向右）0ms 最小公倍数-辗转相除法 Prim最小生成树-Rightmost Digit, modular exponentiation algorithm (from left to right) 0ms Least common multiple- Euclidean algorithm Prim minimum spanning tree
RSA--exponentiation-
- 揭秘RSA求幂算法，代码简洁方便，非常实用，用于求解任何求模运算-the exponentiation of RSA
exponentiation-algorithm
- 快速取模指数算法，C++编写，下载即可编译运行，RSA算法里面需要用到的-Take the fast modular exponentiation algorithm, C++ to prepare, you can compile and run the download, the RSA algorithm which need
Exponentiation
- Exponentiation Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems. This problem requires t