It's a Cryptography Research paper from earlier this year and involves both a series of lattice reductions and the inverse fourier transform, which smooths out a very sharply defined bound into a much broader bound to make a search faster --- the latter trick is due to Bleichenbacher and referred to in the CRI paper as an "underground" attack.
Alex Balducci in our office actually got this attack working from the paper and walked us through the code --- the lattice reduction steps take 8 hours to run, and are followed by an IFFT-aided search that I would have zero chance of getting right and so never would have bothered waiting 8 hours to try, but he did it anyways.
Maybe I can get him to write it up.
Moral of this story by the way: hire people smarter than you are, and give them semi-unreasonable problems to work on.
The first time I heard about attacks on crypto that monitored processor power consumption, I was pretty skeptical. It seems crazy to me that it could work. But of course it does.
Same thing with timing attacks, til I learned how to code one for myself.
Alex Balducci in our office actually got this attack working from the paper and walked us through the code --- the lattice reduction steps take 8 hours to run, and are followed by an IFFT-aided search that I would have zero chance of getting right and so never would have bothered waiting 8 hours to try, but he did it anyways.
Maybe I can get him to write it up.
Moral of this story by the way: hire people smarter than you are, and give them semi-unreasonable problems to work on.