Is the new preprint "An Algorithm For Factoring Integers" by Yingpu Deng and Yanbin Pan worth reading? I just discovered on the eprint server of the IACR the paper mentioned in the title. Scanning quickly over the paper I didn't find anything spectacular, so I doubt that their new(?) approach will be any good. But as I'm not an expert in the field of factorization, and as the proof for Primality $\in$ P is also deceptively "low-level", I wonder if someone here with more knowledge about factorization could quickly judge if the paper is worth reading.



EDIT: The paper I'm wondering about seems to be connected to the polynomial time primality test by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. So please be sure to know (or better: understand) the AKS-test before answering here.
If you have to ask, you are probably not the intended audience. Quoting the introduction of the paper:


  We implemented our method on a PC using Shoup’s NTL library version 5.4.1 [7].
  Unfortunately, we have to say that the practical effect of our method is not good on a
  single PC, it is worse than many known algorithms on this problem. However, we believe
  that our method yields interesting phenomena, and it is worth for further study.