|
C.6.2.2 The algorithm of PottierThe algorithm of Pottier (see [Pot94]) starts by computing a lattice basis 587#587 for the integer kernel of 191#191using the LLL-algorithm ( system). The ideal corresponding to the lattice basis vectors
766#766
is saturated – as in the algorithm of Conti and Traverso – by
inversion of all variables: One adds an auxiliary variable 503#503 and the
generator
767#767 to obtain an ideal 763#763
in
768#768 from which one computes 752#752 by elimination of
503#503.
|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |