Indeed, this article is a really really nice read! Without knowing much about this topic, the first 10-15 pages give a really nice hand-holding whiteboard-style exposition of some of the ideas. Unfortunately, the conclusion:
This is a very good article on the o(n log n) multiplication algorithm claim: web.maths.unsw.edu.au/~davidharvey...