开发工具:
文件大小: 37kb
下载次数: 0
上传时间: 2011-08-14
详细说明： rsa加密攻击源程序 C语言 This tool is supposed to help crackers who are cracking targets protected by RSA and who aren't attackable by the classic method of factoring i.e who'se modulus is > 400 bits. .How to use *********** It's very easy to use it once you know the when the attacks apply.So here are the explanations: 1.Common Modulus Attack: not really an attack but more of a tool, its purpose is to find the factors of the modulus given the public AND secret key, i.e E and D So entering N,D,E you find P,Q so that N = P * Q. I included it in this 'toolkitt' as i got asked many times by other crackers if you can find the factors of N given D and E is possible. The answer is yes. The algo which i used can be found here: http://math.usask.ca/~wurtz/crypt/attacks_rsa/node1.html 2. Weger Attack: this attack applies when the factors of N are close one another i.e the diference |P - Q| is small in comparison to P and Q. So if let's say P and Q have the same bitsize s than for the RSA key to be susceptible to this attack then |P-Q| bitsize must be smaller then (s/2) E.g. P bitsize=256 bits Q bitsize=256 bits |P-Q| bitsize is 100bits then they key generated with this primes is attackble. When testing a RSA key for this attack if you don't get any result after at most 5mins then the attack don't work. BTW: you can try this attack on Amenesia Basis#1 Crackme that presents an RSA key with exactly this weakness. 3. Wiener Attack: this attack applies when the private key is D < (1/3)*N^(1/4) and if P < Q < 2P (which is true most of the times.). So if you have an s bit modulus and if the bitsize of the private key is < (s/4) bits than you can succesfully recover. The attack can be improved, but i'm lazy so i only did the easier version :). 4. Low Exponent Attack: If E=3 and the message is short enough and not padded then there's a possibility that M^E < N so the modular reductions don't take place so computing M having the ciphertext is just a matter of computing the E'th root from the cipher text. As input you must provide N and the ciphertext BTW: you can try this attack on Amenesia Basis#2 Crackme that presents an RSA key with exactly this weakness. .Bugs ****** Send them to bLaCk@reteam.org or correct them yourself, i gave you the source right? :) .Future plans ************* - add threads for Weger attack - add Cycling attack - i need to find more info about how to efficiently implemented (i know it's not an efficient attack from the start but people asked for it) - add ? (here you put what you think is missing) .History ********* - v.0.1f - added the low public exponent 'attack' :) - added automatic base convertion, so it's easier to work with - added automatic md5 hasher (a request) - added Encrypt/Decrypt functions to play with the RSA keys - v.0.1b - first version released .Greets ******* RET, TKM!, KANAL23, LZ0 Members as they all put up with my stupid questions :P ...展开收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
