Re: RSA algorithm

From: Mark Wooding (mdw_at_nsict.org)
Date: 07/08/03


Date: 8 Jul 2003 13:13:47 GMT

vicky <vickynaf@hotmail.com> wrote:

> Suppose that the public key of RSA is (n,e) and C=M^e (mod n). An
> algorithm A can invert 1% of the inputs in form y=M^e (mod n). Prove
> that using algorithm A we can invert every input with high
> probability.

The RSA problem is randomly self-reducible.

-- [mdw]



Relevant Pages

  • Re: RSA algorithm
    ... > that using algorithm A we can invert every input with high ... can divide (Euclidean algorithm) to get M. ... If you can invert a decent percentage of random messages, ... you can invert all (with high probability - i.e. the x's ...
    (sci.crypt)
  • Re: Algorithm For Ensuring p & q Sufficiently Large For n in RSA
    ... probability of mathematical failure just means that you are getting your ... contract for an algorithm, then it should do that, ... adverse effect is less than chance of all of you spontaneously ...
    (sci.crypt)
  • Re: Primes algorithm
    ... > method which is generally used, as far as I know, is the Miller-Rabin ... > algorithm, ... > that a given number is composite, then it is definitely composite; ... A number is prime with a probability equal to either 0 or to 1. ...
    (sci.crypt)
  • Re: Deterministic Algorithm for Random Number Generation Using Coin Flips
    ... -the algorithm can guarantee that there is 0 probability that the ... algorithm will run forever. ... generator that is guaranteed to terminate after finite throws? ... the rng be random? ...
    (sci.math)
  • Re: Deterministic Algorithm for Random Number Generation Using Coin Flips
    ... -the algorithm can guarantee that there is 0 probability that the ... algorithm will run forever. ... (or assuming the coins were not labeled: toss #1, toss #2, or toss ... Take a red coin and a green coin and toss ...
    (sci.math)