Decrypting RSA: Using d_K, d_p, d_q, M_p, M_q and x_p,x_q to Prove y^d=x mod n

  • Thread starter Thread starter hope2009
  • Start date Start date
hope2009
Messages
3
Reaction score
0
In RSA: d_K (y)=y^d mod n and n=pq. Define

d_p=d mod(p-1)

d_q=d mod(q-1)
Let

M_p=q^(-1) mod p
M_q=p^(-1) mod q
And

x_p=y^(d_p ) mod p
x_q=y^(d_q ) mod q
x=M_p qx_p+M_q px_q mod n

Show that y^d=x mod n
any help would be appraciated, thanks
 
Physics news on Phys.org
homework eh?

use fermat's thm to prove y^d = y^(d_p) mod p (same for q)
show x = x_p mod p (same for q)
then use CRT to solve for x
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

MHB Prove the polynomial f(x)=x^2-q is irreducible in F_p[x]?
Replies
1
Views
2K
I How Does the Equation D x E mod Φ(N) = 1 Relate to RSA Encryption?
Replies
1
Views
1K
Number of quadratic residues mod N>1
Replies
3
Views
3K
U(n) as an External Direct Product
Replies
11
Views
2K
MHB Prove Polynomial Congruence $(x+y)^n \equiv x^n + y^n$ (mod $p$)
Replies
2
Views
1K
I Generators of Galois group of ## X^n - \theta ##
Replies
3
Views
2K
MHB Field Theory - Basic Theory - D&F Section 13.1
Replies
2
Views
2K
Elliptic Curve y^2 = x^3 +17; show N_p = p
Replies
5
Views
6K
MATLAB How to write Matlab code for a multivariate Beta distribution
Replies
1
Views
6K
MHB Proving Convex Set Properties to Showing the Convexity of X-Y
Replies
3
Views
2K

Hot Threads

Recent Insights

Back
Top