Breaking RSA if you know m^k = 1 mod n

nudan · Feb 5, 2011

Hello I'm looking for some guidance:

robert Ihnot · Feb 6, 2011

You seem to assume that everyone knows what you are talking about--why?

You certainly have not defined terms, but when I look into this, it is my impression that you have no understanding of modular arithmetic. Why not check that out?

dhessler · Feb 11, 2011

Look, RSA is built on the fact in the private key (d,n) and the public key (e,n) d and e are exponential inverses of each other mod n. If x^d or x^e are congruent to 1 then d = phi(n) or e = phi(n) respectively... Take a look at Euler's Theorem which is a generalize form of Fermat's Little Theorem. This is why in RSA there is so much care taken in picking keys.

Breaking RSA if you know m^k = 1 mod n

Thread 'About the existence of Hamel basis for vector spaces'

Similar threads

Hot Threads

I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?

I Showing ##k[x_1,\ldots,x_n]/\mathfrak{a}## is finite dimensional

A Near-Rings with Noncommutative Addition and Two-Sided Distributivity

I How do we distinguish two different notations for cokernel and coimage?

I Localising a non integral domain at a prime

Recent Insights

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Insights What Exactly is Dirac’s Delta Function? - Insight

Insights Relativator (Circular Slide-Rule): Simulated with Desmos - Insight

Insights Fixing Things Which Can Go Wrong With Complex Numbers

Insights Fermat's Last Theorem