Fast cryptanalysis of RSA encrypted data using a combination of mathematical and brute force attack in distributed computing environment

Shende, Vikrant; Sudi, Giridhar; Kulkarni, Meghana

doi:10.1109/icpcsi.2017.8392156

Cited by 3 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Brute force attack [16] is the simplest method to explore d. The main process is to find an integer which is equal to d. In general, the first initial value which is selected as the exponent of modular exponentiation is begun as 3 and it is increased by two whenever the result from decryption equation is not equal to m until the target is found. In fact, the reason that the exponent must be increased by two is to skip all even numbers out of the computation, because d is always an odd number.…”

Section: Brute Force Attackmentioning

confidence: 99%

The new Weakness of RSA and The Algorithm to Solve this Problem

2020

KSII TIIS

View full text Add to dashboard Cite

RSA is one of the best well-known public key cryptosystems. This methodology is widely used at present because there is not any algorithm which can break this system that has all strong parameters within polynomial time. However, it may be easily broken when at least one parameter is weak. In fact, many weak parameters are already found and are solved by some algorithms. Some examples of weak parameters consist of a small private key, a large private key, a small prime factor and a small result of the difference between two prime factors. In this paper, the new weakness of RSA is proposed. Assuming Euler's totient value, Φ (n), can be rewritten as Φ (n) = ad + b, where d is the private key and , a b ∈  , if a divides both of Φ (n) and b and the new exponent for the decryption equation is a small integer, this condition is assigned as the new weakness for breaking RSA. Firstly, the specific algorithm which is created for this weakness directly is proposed. Secondly, two equations are presented to find a, b and d. In fact, one of two equations must be implemented to find a and b at first. After that, the other equation is chosen to find d. The experimental results show that if this weakness has happened and the new exponent is small, original plaintext, m, will be recovered very fast. Furthermore, number of steps to recover d are very small when a is large. However, if a is too large, d may not be recovered because m which must be always written as m = h a is higher than modulus.

show abstract

Section: Brute Force Attackmentioning

confidence: 99%