Wow great crypro primer! Simpler than I had during the crypto Mathclass at College! But I don't get e * d = 1(mod(p-1)*(q-1))
10mod9 is 1 but 1modx is always 1 no?
Wow great crypro primer! Simpler than I had during the crypto Mathclass at College! But I don't get e * d = 1(mod(p-1)*(q-1))
10mod9 is 1 but 1modx is always 1 no?
Hey thanks @nutela. I believe your question relates to the modular multiplicative inverse. There are a few sites that cover this notation better that I could at the moment including here & here. Hope that helps!
Thanks I thought it looked like you divided it by
mod
or something :)