RSA algorithm

From: vicky (vickynaf_at_hotmail.com)
Date: 07/06/03 

Date: 6 Jul 2003 03:15:16 -0700

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 :)

Relevant Pages

  • Re: What is exponent?
    ... For simple description of RSA algorithm ... I also have the receiver's certificate (public key only). ... Use RSA to encrypt the session key ...
    (microsoft.public.dotnet.security)
  • Re: What is exponent?
    ... private and one public that are usually called d and e and related to ... For simple description of RSA algorithm checkhttp://en.wikipedia.org/wiki/RSA ... I also have the receiver's certificate (public key only). ...
    (microsoft.public.dotnet.security)
  • Re: RSA Encryption
    ... We don't share our algorithm, ... we just need to share our own public key then we can ... >> Crypto API libraries) using RSA 1024 bit. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Inversion of an algorithm
    ... Has anyone worked on getting *automatically* an algorithm for the ... Has this problem something to do with automatic differentiation? ... invert it. ... matter as long as the function obeys the rules I have listed. ...
    (comp.programming)
  • Complexity optimisation for a block matrix inversion
    ... I found significant differences (factor approx. ... therefore want to find the optimal pivoting sequence by algorithm. ...
    (comp.theory)