a^(b^x) mod n?

Given positive integers a,b,x,n is it possible to efficiently compute:

a^(b^x) mod n?

phi(n) is unknown and b^x is so large it can't be used directly.

Or is it known this to be a hard problem?

Thanks.

--
Fred

.

Relevant Pages

  • Re: a^(b^x) mod n?
    ... >Given positive integers a,b,x,n is it possible to efficiently compute: ... >phiis unknown and b^x is so large it can't be used directly. ... >Or is it known this to be a hard problem? ... "I can't seem to find any efficient algorithm for this problem"). ...
    (sci.crypt)
  • RE: how do I test for Integer?
    ... > I wish to test if the results of a calculation is an integer. ... An unknown ... > function perhaps in the stats package? ... Prev by Date: ...
    (microsoft.public.excel.worksheet.functions)
  • Re: a^(b^x) mod n?
    ... > Given positive integers a,b,x,n is it possible to efficiently compute: ... > phiis unknown and b^x is so large it can't be used directly. ... Only need roughly O) multiplications. ...
    (sci.math)
  • Re: .NET features in D2005 Win32
    ... is the neighbor in the next apartment" -- unknown ... Prev by Date: ...
    (borland.public.delphi.non-technical)
  • FS Kings of Steel
    ... garbage playfield, complete, unknown if working or ... not, need room, pickup in Southern New Hampshire ... Prev by Date: ...
    (rec.games.pinball)