Subject: Discussion related to cado-nfs
List archive
Re: [cado-nfs] Can things for solving discrete logarithms be accelerated if a more perfomant alogrithm was found to factoring far larger modulus ?
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 things for solving discrete logarithms be accelerated if a more perfomant alogrithm was found to factoring far larger modulus ?
- Date: Fri, 30 May 2025 08:38:23 +0200
- Authentication-results: mail2-relais-roc.national.inria.fr; dkim=none (message not signed) header.i=none
There is no such systematic reduction from discrete log to integer
factorization.
Pierrick
On Thu, May 29, 2025 at 11:51:07PM +0200, Laël Cellier wrote:
> Bonjour,
>
> if there were an algorithm for factoring any nearly a thousand bits Integer
> in minutes, would it help solving discrete logarithms having 200/300 bits
> large prime factors inside it’s modulus. And what about finite fields of
> prime powers ?
>
> (c’est ce message qu’il faut poster et pas le précédent)
>
>
> Cordialement,
>
>
- [cado-nfs] Can things for solving discrete logarithms be accelerated if a more perfomant alogrithm was found to factoring far larger modulus ?, Laël Cellier, 05/29/2025
- Re: [cado-nfs] Can things for solving discrete logarithms be accelerated if a more perfomant alogrithm was found to factoring far larger modulus ?, Pierrick Gaudry, 05/30/2025
Archive powered by MHonArc 2.6.19+.