Example:
Encrypt this message
Encryption Layer 1:
p=139,q=103
n=(p−1)(q−1)=(139−1)(103−1)=(138)(102)=14076
ϕ(14076)=4416
We now find a number e such that 1<e<ϕ(n), e=4415.
Now, we need to find d such that demodϕ(n)≡1 - in this case, d=44154417
4415∗4415=19492225=1+384∗50761
The encryption key is c=memodn - n=14076,e=4415 - c=m4415mod14076
The decryption key is m=cdmodn - n=14076,d=44154417 - m=c44154417mod14076
Now encrypt!
Now, re-encrypt the ciphertext.
Repeat until the nth layer of encryption.
Challenge:
I want somebody to find out how long it takes to decrypt (without the decryption key, range from min to max):
1 layer
2 layers
3 layers
... (as in, keep going!)
15 layers
#ComputerScience
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.