Hi,
FFT is only required for fast polynomial multiplication; I guess Florian
and I can give a try to implement the ringLWE-Sampler tomorrow.
The lindner_peikert() routine gives an error in find_root() everytime I
call it, independent of the parameters m and n:
/var/tmp/root/sage-5.0-linux-64bit-ubuntu_10.04.3_lts-x86_64-Linux/local/lib/python2.7/site-packages/sage/numerical/optimize.pyc
in find_root(f, a, b, xtol, rtol, maxiter, full_output)
70 """
71 try:
---> 72 return
f.find_root(a=a,b=b,xtol=xtol,rtol=rtol,maxiter=maxiter,full_output=full_output)
73 except AttributeError:
74 pass
/var/tmp/root/sage-5.0-linux-64bit-ubuntu_10.04.3_lts-x86_64-Linux/local/lib/python2.7/site-packages/sage/symbolic/expression.so
in sage.symbolic.expression.Expression.find_root
(sage/symbolic/expression.cpp:31805)()
/var/tmp/root/sage-5.0-linux-64bit-ubuntu_10.04.3_lts-x86_64-Linux/local/lib/python2.7/site-packages/sage/numerical/optimize.pyc
in find_root(f, a, b, xtol, rtol, maxiter, full_output)
88 else:
89 return s
---> 90 raise RuntimeError, "f appears to have no zero on
the interval"
91 # If we found such an s, then we just instead find
92 # a root between left and s or s and right.
RuntimeError: f appears to have no zero on the interval