Re: RSA algorithm

From: Michael Amling (nospam_at_nospam.com)
Date: 07/06/03 

Date: Sun, 06 Jul 2003 14:36:19 GMT

vicky wrote:
> Any idea?
>
> 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.
> Thank you :)

   Are you doing lakis's homework?

--Mike Amling

Relevant Pages

  • Re: Advanced Monty Hall Problem with N door and M cars
    ... I promise you that this is not a homework. ... >> Assuming that we have N door with M of these door have cars behind ... >> What is the probability of winning if she stay with her choice? ...
    (sci.stat.math)
  • Probability problem
    ... I wonder if someone can help me with this (it's not work or homework): ... You have 2 different sized samples of metal. ... the probability of sample A being type I = 0.6; ... Later you discover that both samples are the same type of metal (but ...
    (sci.stat.math)
  • Re: permutation mappings
    ... > I agree the expectation value of the number of matches must be 1. ... > probability of the the first card she exchanges staying in place is ... Just keep thinking homework is fun, ...
    (sci.crypt)
  • Re: RSA algorithm
    ... > that using algorithm A we can invert every input with high ... > probability. ... The RSA problem is randomly self-reducible. ...
    (sci.crypt)
  • 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)