Re: Is it hard? How to prove it?

bobic <fbloveu@xxxxxxxxxxx> wrote:
Recently, I met the following problem, and I need the problem is
proven-hard. Can you give me some hints to prove it? Thanks in
advance!
*********************************************
Given N, g, x', a, X,C, such that N=pq, p=2p'+1, q=2q'+1, p,q,p',q'
are primes, g^{p'q'}=1 mod N, x'=xa mod p'q', X=g^x mod N.
To compute m, such that m^a=C mod N.
***********************************************************

Reduce it to RSA.

--
Kristian Gjøsteen
.

Relevant Pages

  • Re: Is it hard? How to prove it?
    ... Can you give me some hints to prove it? ... But I cannot reduce it to RSA. ... that N is the product of two Sophie Germain primes)? ... just shown that solving your problem is at least as hard as solving RSA ...
    (sci.crypt)
  • Re: Is it hard? How to prove it?
    ... proven-hard. ... Can you give me some hints to prove it? ... But I cannot reduce it to RSA. ...
    (sci.crypt)
  • Re: Abstract
    ... >give me hints on. ... Order of G is pq where p and g are primes (not nexcessarily ... Reach a contradiction. ... If H is a normal subgroup of G and order of H is 2, ...
    (sci.math)
  • Abstract
    ... give me hints on. ... Order of G is pq where p and g are primes. ... If H is a normal subgroup of G and order of H is 2, ... Prev by Date: ...
    (sci.math)
  • Number theory question
    ... Suppose I have two primes, p at least 5 and q at least 7. ... the triangle inequality, but the fact that there's no factor of 3 in the ... but I need assistance in formalizing this. ... Any hints in the right ...
    (sci.math)
Quantcast