Algebraic geometric code based IP traceback

In this paper, we attempt to use algebraic-geometric codes to solve the polynomial reconstruction problem, which is the key step for the algebraic IP traceback over the Internet to defend against the DoS attacks. The detailed mathematical expression for the fullpath polynomial is given with analysis showing the deterministic characteristic, the backward compatibility, the low time and storage complexity and the incremental deployment of our scheme. Furthermore, how to reduce the overhead in the IP header is proposed and analyzed with details in this paper. The comparison of our scheme with other related work shows that our scheme can not only be implemented for today´s routers (IPv4), but also be extended for future router´s usage whenever the router IP address be enlarged (IPv6).