文件名称:rsajiamiyunli
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:12.44kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
加密的步骤
1) 计算N的有效位数tn(以字节数计),将最高位的零忽略掉,令tn1=tn-1。比如N=0x012A05,其有效位数tn=5,tn1=4。
2) 将明文数据A分割成tn1位(以字节数计)的块,每块看成一个大数,块数记为bn。从而,保证了每块都小于N。
3) 对A的每一块Ai进行Bi=Ai^E MOD N运算。Bi就是密文数据的一块,将所有密文块合并起来,就得到了密文数据B。
-Encryption step 1) calculating the median N effective tn (in bytes) of the maximum zero-bit ignored, so that tn1 = tn-1. For example, N = 0x012A05, its effective median tn = 5, tn1 = 4. 2) to express the data A is separated into TN1 bit (in bytes) of the block, as a lump sum for each block, block number recorded as bn. Thus, to ensure that each block are less than N. 3) A 1 Ai for each Bi = Ai ^ E MOD N computing. Bi is a piece of ciphertext data of all ciphertext blocks combined together, we received ciphertext data B.
1) 计算N的有效位数tn(以字节数计),将最高位的零忽略掉,令tn1=tn-1。比如N=0x012A05,其有效位数tn=5,tn1=4。
2) 将明文数据A分割成tn1位(以字节数计)的块,每块看成一个大数,块数记为bn。从而,保证了每块都小于N。
3) 对A的每一块Ai进行Bi=Ai^E MOD N运算。Bi就是密文数据的一块,将所有密文块合并起来,就得到了密文数据B。
-Encryption step 1) calculating the median N effective tn (in bytes) of the maximum zero-bit ignored, so that tn1 = tn-1. For example, N = 0x012A05, its effective median tn = 5, tn1 = 4. 2) to express the data A is separated into TN1 bit (in bytes) of the block, as a lump sum for each block, block number recorded as bn. Thus, to ensure that each block are less than N. 3) A 1 Ai for each Bi = Ai ^ E MOD N computing. Bi is a piece of ciphertext data of all ciphertext blocks combined together, we received ciphertext data B.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
rsa加密原理及实现.DOC
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.