Reputation
279
Next privilege 300 Rep.
Create new tags
Badges
1 5
Newest
 Yearling
Impact
~671 people reached

  • 0 posts edited
  • 0 helpful flags
  • 9 votes cast
Dec
16
answered RSA and difference between factors
Dec
15
comment Lightweight Asymmetric encryption algorithm
Ed25519 has exceptionally fast key generation, with random number generation the primary bottleneck. It also has other strong performance characteristics, is widely reviewed, and widely implemented as well.
Dec
14
awarded  Yearling
Dec
14
answered How to tell if a hardware RNG is rigged?
Dec
14
comment Public key exponent coprime with totient proof
The question could have been written clearer, but it does state: does there exist a proof that $\gcd(e,\phi)=1$ implies that $(a^e)^d \equiv a \pmod{n}$, where "decrypt cipher text" I interpret as $(a^e)^d$ with $d=e^{-1}$ and "a unique answer" as "(a^e)^d \equiv (b^e)^d \pmod{n}$ implies $a \equiv b \pmod{n}$. Sorry, I do not see anywhere in the question that asks why $\gcd(e,\phi)=1$ is required, or where it is asking why d is/is not unique. Those seem unrelated to the original question.
Dec
14
comment Public key exponent coprime with totient proof
I think there is some confusion, because I added proof that the multiplicative inverse of e is unique. I added that for completeness only. The original question is completely answered in my first paragraph.
Dec
14
revised Public key exponent coprime with totient proof
added 288 characters in body
Dec
14
revised Public key exponent coprime with totient proof
added 288 characters in body
Dec
14
comment Public key exponent coprime with totient proof
The chinese remainder theorem guarantees that such alternative d exist that can serve as private key exponent, even though they are not multiplicative inverses mod $\phi$. That does not conflict with anything I have said...you can always choose $d$ to be the multiplicative inverse and euler's thm gives us that whp we can recover the message. What does not work there?
Dec
14
answered Public key exponent coprime with totient proof
Nov
13
answered Is Shoup's Practical Threshold Signatures considered secure?
Nov
13
awarded  Editor
Nov
13
revised Easy hash function collision
added 200 characters in body
Nov
13
answered Easy hash function collision
Sep
24
awarded  Autobiographer
Apr
11
awarded  Supporter
Apr
11
awarded  Teacher
Apr
11
answered Why does this square root algorithm work?
Apr
11
awarded  Student
Apr
11
asked Threshold signatures vs. certificate authority+voting verification