Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Mathematics
General Math
How Does the Equation D x E mod Φ(N) = 1 Relate to RSA Encryption?
Reply to thread
Message
[QUOTE="brajesh, post: 6474624, member: 685521"] [B]TL;DR Summary:[/B] Understanding the RSA mathematics Please help me understand the RSA encryption. I understand part of it, then I don't understand. Definitions: M=plain text message C=encrypted message N=public key E=encoding key D=decoding key P,Q are prime factors on N I get that P x Q = N (where P and Q are primes). I get that Φ(N) = (P-1) x (Q-1) I get that M[SUP]E[/SUP]modN = C I get that C[SUP]D[/SUP]modN = M But after this I don't understand the relevance of this equation to solve D and E D x E mod Φ(N) = 1 Seems to be some step or something obvious I'm missing? [/QUOTE]
Insert quotes…
Post reply
Forums
Mathematics
General Math
How Does the Equation D x E mod Φ(N) = 1 Relate to RSA Encryption?
Back
Top