Skip to Content.
Sympa Menu

cado-nfs - Re: [cado-nfs] Can using multiple factor bases be used for computing discrete logarithm faster ?

Subject: Discussion related to cado-nfs

List archive

Re: [cado-nfs] Can using multiple factor bases be used for computing discrete logarithm faster ?


Chronological Thread 
    < Chronological >      < Thread >
  • From: Pierrick Gaudry <pierrick.gaudry@loria.fr>
  • To: Laël Cellier <lael.cellier@laposte.net>
  • Cc: cado-nfs@inria.fr
  • Subject: Re: [cado-nfs] Can using multiple factor bases be used for computing discrete logarithm faster ?
  • Date: Mon, 25 Nov 2024 09:45:37 +0100
  • Authentication-results: mail2-relais-roc.national.inria.fr; dkim=none (message not signed) header.i=none
> then can the underlying idea be applied to completely different scenarios ?
> I was thinking about some non effcient index calculus algorithm on elliptic
> curves ?

I really don't think so.
But feel free to investigate.

Pierrick

Archive powered by MHonArc 2.6.19+.

Top of Page