Hi All,

I Was Hoping To Get Some Help Understanding This Formula More

x = a ^ b MOD c

Whereas :-

a = Variable

b = Variable

c = Constant

x = Constant

All Integers (Of Course)

After Further Analysis I Found

a = Product Of 2 Primes

b = Product Of 2 Primes

c = NOT A Product Of 2 Primes

So

x = p1*p2 ^ p3*p4 MOD c

So I Gather From This, The Method Is Not RSA Encryption As c Cannot Be

Broken Into 2 Primes. I Have Searched Around The Net For Information

But Im At A Loss To Understand It More, I Was Hoping Someone Here

Maybe Knows The Method So I Could Search For Some Info / Source On

The Web Or Could Explain How To Calculate a & b Or Maybe If Possible

To Change Sides Of The Equation

With My Basic Algebra Skills I Can See

a ^ b Must Be x Plus A Multiple Of c

Any Help Would Be Great

On My Travels Looking For Information I Found An Interesting Site About

Number Theory And RSA with Examples For MathLab, Hope The Link Helps

Someone Else

h**p://w*w.ma.umist.ac.uk/rb/teaching/117/

## Bookmarks