Re: Discrete Log Problem

From: Phil Carmody (thefatphil_demunged_at_yahoo.co.uk)
Date: 09/08/04

  • Next message: Ilya O. Levin: "Re: What is the modulus of this public key?" 
    Date: 08 Sep 2004 02:06:08 +0300

    Francois Grieu <fgrieu@francenet.fr> writes:
    > > Rough idea:
    > >
    > > For i in |N
    > > Set r = ceil(n^(1/e)) + i
    > > Set c = r^e
    > > Solve for x in x^e == c (mod n) using "break RSA".
    >
    > Here, we ALLWAYS have r = x (mod n); this is implied by
    > GCD(e,p-1)=1, GCD(e,q-1)=1.

    Ah yes, that's the clincher.

    Phil 

    -- 
They no longer do my traditional winks tournament lunch - liver and bacon. 
It's just what you need during a winks tournament lunchtime to replace lost 
... liver.   -- Anthony Horton, 2004/08/27 at the Cambridge 'Long Vac.'
  • Next message: Ilya O. Levin: "Re: What is the modulus of this public key?"

    Relevant Pages