Discussion related to cado-nfs

[Pierrick Gaudry <pierrick.gaudry@loria.fr>]

Dear Chen Yongyan,

I think that you have indeed hit a genuine bug. I'll have a look
tomorrow and see if I can fix it quickly. Otherwise, this might have to
wait a few weeks, when I plan to work again on GF(p^2).

Regards,
Pierrick

On Sun, May 19, 2019 at 08:37:18AM +0800, Xs. X. wrote:
> Hi Paul,
> 
> I have read the README and FAQ previously. But, according to the literature
> "Improving NFS for the Discrete Logarithm Problem in Non-prime Finite
> Fields", the action of condition p = 7 mod 8 is only to provide a speed-up
> by an automorphism and skip the sm step. On the other hand, I have
> successfully solved another problem in GF(p^2) which p = 3 mod 8. I don't
> know is it a single case.
> 
> Whatever, thank you for your reply.
> 
> Regards,
> Chen Yongyan
> 
> On Sun, May 19, 2019 at 12:19 AM paul zimmermann <Paul.Zimmermann@inria.fr>
> wrote:
> 
> >        Hi,
> >
> > > I'm solving a DLP problem in GF(p^2) with the polynomial built by
> > myself, and the program failed at reconstructlog-dl.
> >
> > please see the FAQ about DLP in GF(p^2):
> >
> >
> > https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2019-April/001028.html
> >
> > and README.dlp, especially the last paragraph, which says that DLP in
> > GF(p^2)
> > should work for ***p = 7 mod 8***. Your p is 3 mod 8.
> >
> > It is not a bug, just something not implemented (and documented as such).
> >
> > Best regards,
> > Paul Zimmermann
> >
> >

> _______________________________________________
> Cado-nfs-discuss mailing list
> Cado-nfs-discuss@lists.gforge.inria.fr
> https://lists.gforge.inria.fr/mailman/listinfo/cado-nfs-discuss