搜索资源列表
Signed-large-integer-calculator
- 带符号的MFC大整数计算器，能进行简单运算，而且能进行带符号的大整数运算-MFC large unsigned integer calculator that can perform simple arithmetic, but also to carry out a large unsigned integer arithmetic
bigint
- 使用vs2010开发环境编写的建立大整形数类来完成大整数之间的四则运算。简单且注释清楚。在C++课程学习中常见。-Use vs2010 development environment written in establishing large number of classes to complete orthopedic four operations between large integers. Simple and clear comments
big_number
- 自己写好的大整数类，已经实现了加法和减法并重载了输入输出运算符-Large integer class itself written, addition and subtraction has been achieved and the input-output operator overloading
miracl
- Miracl库包含100余个例程，涉及多倍精度运算（multiprecision arithmetic）的各个方面。定义了两种新的数据类型——表示大整数的big类型和表示有理数的flash（short for floating-slash）类型。大整数例程基于Knuth算法（在他的著作“The Art of Computer Programming”第四章中提出）。floating-slash（不固定斜杠？）算法基于圆整小数，最初由D.Matula和P.Kornerup提出。所有例程都针对速度和
Divisible-by-15
- 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Problem Descr iption: Given a string containing only numbers [0..9], and requires the use of certain characters in a string, one ca
src
- 能被15整除的最大整数，dp思想，贪心原则-Be the largest integer divisible by 15, dp thought, greedy principle
RSA
- 分别实现RSA加密算法和RSA签名算法，对RSA的设计有较好的认识，体会RSA的安全性基于数论难题——大整数因子分解问题.-Respectively, to achieve RSA encryption algorithm and the RSA signature algorithm, RSA is designed for better understanding, experience-based RSA Security number theory problems- large int
TestLongIntToHex
- 这是一个将大整数装换为16进制数显示的程序，大整数和16进制数都是用字符串模拟的-This is a large integer program converts hexadecimal number displayed large integer and hexadecimal numbers are simulated with a string
POJ1001
- 大整数数组相乘 核心：整数数组相乘，得到乘积数组，最后再转化为字符数组输出。-Large integer multiplication array Core: an integer array multiplication, get the product array, and finally into a character array output.
ex0411
- 主要用于matlab的计时功能，调用了系统函数，tic toc，实现1+2+...+n<1000的最大整数-Mainly used matlab timing function, call the system function, tic toc, to achieve the greatest integer 1+ 2+ ...+ n <1000 s
MillerRabin
- 实验目的 许多密码算法和协议都需要“随机”的大素数，特别是在共享密钥的密码协议中。对于大素数的生成，一个最自然的方法是先生成一个大整数，然后对其进行素性检测。 实验内容与要求 随机选择一个12位的整数n，用Miller-Rabin素性检测算法，测试n是否为素数。 -Purpose of many cryptographic algorithms and protocols need to " random" large prime numbers, partic
Large-integer
- 大整数，蛮力破解，分治法，改进分治法。程序清晰易懂，有利于帮助理解-Large integer, brute-force, divide and conquer, divide and conquer improvements. Clear and understandable procedures, could help to understand
compute
- 能实现任意大整数运算,如加法，减法，乘法，除法，求余，有限域运算，RSA的公私钥生成等-impletement any big number operate
biginteger
- 大整数乘法 poj 数据结构与算法这门课的作业题目-Large integer multiplication poj data structures and algorithms in this course job title
plus
- 可以通过类实现c++的大整数乘法，方式为加法器。-C++ by class implements a large integer multiplication, adder way.
BigInt
- 大整数的加、减、乘、除和指数运算，以及大整数的输入和输出。-Large integer addition, subtraction, multiplication, division, and exponentiation, and large integer input and output.
main(5).cpp
- 大整数的运算，c＋＋的计算对整数的位数有要求，此代码实现对大整数的加减乘除的运算-Large integer arithmetic, c++ integer calculation of the number of bits required, this code for a large integer arithmetic operations
rsa
- RSA算法，基于大整数分解的难题而设计的非对称密码算法。-RSA algorithm, based on the integer factorization problem designed asymmetric cryptographic algorithm.
Large-integer-multiplication
- 大整数的计算方法实现，供c/c++初学者学习使用- Large integer calculation method of implementation for c/c++ beginners learning to use
HugeInteger
- 用C++大整数类实现大整数的加减法运算和各种关系判断-Realization of large integers subtraction judgment and relationships with C++ large integer type