毕业论文外文翻译--基于RSA的数字签名系统的设计与实现(适用于毕业论文外文翻译+中英文对照.doc
《毕业论文外文翻译--基于RSA的数字签名系统的设计与实现(适用于毕业论文外文翻译+中英文对照.doc》由会员分享,可在线阅读,更多相关《毕业论文外文翻译--基于RSA的数字签名系统的设计与实现(适用于毕业论文外文翻译+中英文对照.doc(15页珍藏版)》请在沃文网上搜索。
1、外文翻译系 别信息工程系专 业网络工程班 级学 号17姓 名指导教师负责教师沈阳航空航天大学北方科技学院2012年6月沈阳航空航天大学北方科技学院毕业设计(外文翻译)The Design and Realization of Digital Signature Based on RSARSA algorithms is introducedRSA public key cryptography. So-called public key cryptography system is to use different encryption and decryption key keys, is
2、a known encryption key is deduced by declassified in calculations is key to be done password system.In a public-key cryptosystem, encryption key (i.e. public key) PK is the public information, and decryption key (namely, the private key) SK is needed to remain confidential. Encryption algorithm E an
3、d decryption algorithm D also are in the open. Although the secret key SK is by public key PK decision, but cannot PK calculated according to SK. It is based on this theory, appeared in 1978 the famous RSA algorithms, it is usually into a pair of Mr RSA keys, one of which is kept secret key, save by
4、 users; Another for public key, can be made public, and even can be registered in the network server. In order to improve the secrecy intensity, RSA keys at least 500 bits long, generally recommend using 1024 bits. This makes the calculation amount of encryption is very large. To reduce the computat
5、ional complexity, sending the information, often USES traditional encryption methods and public key encryption method unifies means, that information with the improved DES or IDEA dialogue key encryption, and use the RSA encryption keys and information the dialogue. Each other after receiving inform
6、ation, with different keys decryption and can check the information.RSA algorithms is the first not only can be used for encryption but also can be used for digital signature algorithm, and it is also easy to understand and operation. RSA is most widely studied public key algorithm, and put forward
7、to the now from more than 30 years, experienced the test of all kinds of attacks, for the people to accept gradually, generally, is now one of the most outstanding public key solutions.The safety of the RSARSA security depends on the larger decomposition, but whether or not equal to tarsus decomposi
8、tion theory has been failed to get the certificate, and for no proof that break RSA will need to be larger decomposition. Assuming there are a large without decomposition algorithm, it must be larger decomposition algorithm can be modified. At present, some variant of RSA algorithms have been proved
9、 equivalent to tarsus decomposition. Anyway, the decomposition n is the most obviously method of assault. Now, people already can break down more than 140 decimal big primes. Therefore, must choose a big modulus n some, for application is up.RSA speedBecause of the large is calculated, make the fast
10、est RSA than DES 100 times on slow, whether software or hardware implementation. Speed has been the defects of RSA. Generally speaking only for a few data encryption.RSAs chosen-ciphertext attackRSA in chosen-ciphertext before the attack is weak. Generally the attacker is will certain information is
11、 the camouflage (Blind), let the private key with the entity to sign. Then, after calculation can get what it wanted information. In fact, attack the same weaknesses are using, that is such a fact that have been retained the multiplication of the input structure: (XM) d = X d * M d mod n front have
12、already mentioned, the inherent problems from the public key cryptography is the most useful features-everyone can use public key. But from the algorithm cant solve the problem, the main measures are two: one is the good public key agreement, guarantee the process not produce any other entity entity
13、 of the information the decryption, you know nothing wrong information signature; The other One is never sent to strangers random document signature, the first to use One sign of a document for-Way HashFunction HASH processing, or use at the same time different signature algorithm.RSA encryption alg
14、orithm faults produce key is very troublesome, produced by a prime technical limitations, so hard to do it once a secret. security, the safety of RSA depends on the large factor decomposition, but did not prove theoretically decipher the difficulty of tarsus and RSA decomposition difficulty equivale
15、nt, and most people tend to academic password factor decomposition is not NPC problem. At present, people already can break down more than 140 decimal big primes, it is required to use more long key, speed, more slowly; Moreover, the people are actively looking for attack RSA methods, such as chosen
16、-ciphertext attack, general attackers will certain information is the camouflage (Blind), let the private key with the entity to sign. Then, after calculation can get what it wanted information. In fact, attack the same weaknesses are using, that is such a fact that have been retained the multiplica
17、tion of the input structure: (XM) d = Xd * Md mod n front have already mentioned, the inherent problems from the public key cryptography is the most useful features-everyone can use public key. But from the algorithm cant solve the problem, the main measures are two: one is the good public key agree
18、ment, guarantee the process not produce any other entity entity of the information the decryption, you know nothing wrong information signature; The other One is never sent to strangers random document signature, the first to use One sign-Way Hash Function of document for Hash processing, or use at
19、the same time different signature algorithm. In addition to using public modulus, people also try some use decryption index or (n) and so on attack. speed too slow, because the grouping of RSA too large length, to ensure safety, n at least 600 bitx above, make the operation cost is high, especially
20、at a slower speed, a symmetric cryptosystem several orders of magnitude slower; Along with the development of the larger decomposition technique, the length is increasing, go against the standardization of data format. At present, the SET (Secure Electronic Transaction) agreement with 2048 bits long
21、 requirements CA keys, other entity USES 1024 bit key. In order to speed, at present the widely use of single, the method of using a combination of public key password, complementary advantages and disadvantages: ChanYao password encryption speed, people use it to encrypt a long documents, and then
22、using the RSA encryption to give document, extremely good solve the problem of ChanYao password key distribution.Modern cryptography has become the core of information security technology, cryptography, is the communication security confidential subject research, that is, to study the type of secret
23、 information transmission of transformation in order to prevent the third party to steal information. Cryptography include two branches: password code to learn and password analytics. Password code to learn the main information exchange, to protect information in the channels relay in to steal, decr
24、yption and use method, and the password analysis learning is and password code learning instead, it mainly studies how to analyze and crack password. Both between both opposition to each other and promote each other. The classification of the password system has a lot of, one of them is based on enc
- 1.请仔细阅读文档,确保文档完整性,对于不预览、不比对内容而直接下载带来的问题本站不予受理。
- 2.下载的文档,不会出现我们的网址水印。
- 3、该文档所得收入(下载+内容+预览)归上传者、原创作者;如果您是本文档原作者,请点此认领!既往收益都归您。
下载文档到电脑,查找使用更方便
10 积分
下载 | 加入VIP,下载更划算! |
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 毕业论文 外文 翻译 基于 RSA 数字签名 系统 设计 实现 适用于 中英文 对照
