-
udp聊天服务器代码
visualc++ 编写的 udp聊天服务器代码-visualc++ prepared udp chat server code
- 2022-03-13 13:58:25下载
- 积分：1
-
正常开放
开源的 SIP 电话代码 -Open-source SIP phone code
- 2022-02-24 20:56:51下载
- 积分：1
-
there is a defect in only know that the secret and public key
还有一个缺陷就是在只知道密文 x 及公钥（n,e）的情况下，只要将 (x^e) mod n 所得余数 s 再不断地循环操作 s = s^e mod n，此运算不断地循环 e 次之后，很多情况下都可以循环出原文，只是计算量过余多一些罢了。不过有不少情况下，根本都无须循环 e 次，不过对于1024位的 n 级别来说，e 也是一个相当大的数值，所以循环密文的余数以解得原文是有些不现实。 以上内容仅供参考，如有不实，请予更正-there is a defect in only know that the secret and public key-x (n, e) the circumstances, as long as (x ^ e) mod n from the remaining s to continuously cycle operation s = s ^ e mod n, this constant cycle of Operational e occasion, the very many circumstances can be recycled from the original, but I calculated the volume more than just. There are, however, many instances, simply do not need e cycle times, but for 1024 the level n, e is a very large figure, so secret circle the remainder of the text was obtained in the original is a bit unrealistic. The above is for reference only, if not true, I corrected
- 2022-03-22 01:18:28下载
- 积分：1
-
SSD5
ssd5-exam01的自己作业答案 ，欢迎你的下载，谢谢了-ssd5-exam01 operation of their own answers, you are welcome to download, I would like to thank the
- 2023-02-22 11:05:04下载
- 积分：1
-
MFC 24. Game, but with a voice, support SAPI4, need to install the Speech4 Chine...
MFC的24.游戏，但带语音，支持SAPI4，需要先安装Speech4的中文语音引擎-MFC 24. Game, but with a voice, support SAPI4, need to install the Speech4 Chinese Speech Engine
- 2022-01-22 03:09:11下载
- 积分：1
-
C++开发测试程序
C++开发测试程序-erwrddddddddddddddddddddddddddddddddddddddddddddddddddd
- 2022-07-27 20:39:39下载
- 积分：1
-
实现通讯录的录入、删除和添加系统。。模拟手机的通讯录管理程序...
实现通讯录的录入、删除和添加系统。。模拟手机的通讯录管理程序-The realization of the address book entry, delete, and add the system. . Analog mobile phone address book management procedures
- 2022-03-24 19:31:24下载
- 积分：1
-
演示实现圆形的窗口
演示实现圆形的窗口-demonstration achieve circular window
- 2022-10-23 20:30:03下载
- 积分：1
-
Set T [0: n
设T[0:n-1]是n个元素的一个数组。对任一元素x，设S(x)={i|T[i]=x}。当|S(x)|>n/2时，称x为T的主元素。设计一个线性时间算法，确定T[0:n]是否有一个主元素。-Set T [0: n-1] is the n elements of an array. Of any element x, set S (x) = (i | T [i] = x). When | S (x) |> n/2 when x for T said the main element. Design a linear time algorithm to determine the T [0: n] whether there is a main element.
- 2022-05-27 02:35:58下载
- 积分：1
-
一种基于分类算法的网页信息提取方法.pdf
一种基于分类算法的网页信息提取方法.pdf-A Method of Web Information Extraction Based on Classification Algorithm.
- 2023-03-22 11:25:04下载
- 积分：1
