Mitigating DDoS attack using random integer factorization
Syed Taqi Ali, Ashraf Sultana, Ajay Jangra · 2016
Distributed Denial of Service (DDoS) attack is a serious threat to the Internet hosts. DDoS attack is an attempts to make service unavailable to its intended users, by draining the system resources. In client-server applications like Web sites, if client sends a request which needs server to consume some computational resource, such as accessing database, to respond then with few such requests sever may gets hang and leads to denial of service attack. We proposed a solution to such kind of DDoS attacks. When server reaches the threshold limit of their resource then our solution sends a random odd integer, which can be pick in a negligible amount of time, to the requesting client. Then the server will respond only if - the client sends a proper factors of that random number or sends the proof that the random number is a prime, otherwise server drops the connection and save its resources. As compare to previous similar work, the server load is reduced and thereby it can handle at least twice the number of clients under this solution.