No since in matrix dimension is (200,200). And entries are of the order of 2^500. So using just LLL algorithm takes much time. Hence I want to use Damien Stehle’s fpLLL (currently the world’s best).
On Fri, Feb 27, 2009 at 6:49 PM, mabshoff < [email protected]> wrote: > > > > On Feb 27, 5:10 am, Santanu Sarkar <[email protected]> > wrote: > > Can you please tell me how I can use fplll( Damien Stehle’s fpLLL) in > SAGE. > > There are some codes like this: > > sage:from sage . libs . fplll . fplll import gen_ntrulike > > sage : A = gen_ntru like (200 ,130 ,35) > > sage : time B = A .LLL( ) > > But how can I reduce a matrix which is given by me? > > You do not need to import anything explicit. See the following code to > access the LLL docstring: > > sage: A=random_matrix(ZZ,10) > sage: A.LLL? > > The last command will show you all the various options there are, i.e. > which algorithm to use (it defaults to fpLLL) and some examples how to > use this code. > > Let us know if this is not what you wanted. > > Cheers, > > Michael > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
