If factoring is in $P$ (with a blazing fast polynomial time in $P$), would it affect the [index calculus algorithm](http://en.wikipedia.org/wiki/Index_calculus_algorithm) used for Discrete Log calculation in any serious way?