Am Dienstag 13 Januar 2015, 07:54:16 schrieb Andrew Savchenko: > On Mon, 12 Jan 2015 18:48:41 +0000 Ciaran McCreesh wrote: > > On Mon, 12 Jan 2015 19:44:46 +0100 > > > > Kristian Fiskerstrand <k...@gentoo.org> wrote: > > > Shor's would be effective against discrete logs (including ECC) as > > > well, so wouldn't be applicable to this selection. For post-quantum > > > asymmetric crypto we'd likely need e.g a lattice based primitive. > > > > We're not post-quantum, > > Are you sure? The simplest Shor's factorisation machine was already > built and published in open press: > http://arxiv.org/abs/quant-ph/0112176 > This was done 14(!!) years ago. I don't doubt there was a > significant progress in this field thereafter. But it is likely > that results are classified.
Lieven's paper 2001 was a milestone but the technology in this case fundamentally didn't scale. So, while there certainly have been advances, they aren't directly based on it, but on completely different experimental approaches. http://web.physics.ucsb.edu/~martinisgroup/ If there's any place to look for technological advances, then ^ here. (No, not d-wave either. IMHO.) -- Dr. Andreas K. Huettel Institute for Experimental and Applied Physics University of Regensburg D-93040 Regensburg Germany tel. +49 151 241 67748 (mobile) e-mail andreas.huet...@ur.de http://www.akhuettel.de/ http://www.physik.uni-r.de/forschung/huettel/
