Reputation
Next tag badge:
46/100 score
28/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~43k people reached

1h
comment Is this a secure method of encrypting with authentication?
@user1193112 : $\;\;\;$ What do you mean by the initial step 1? $\:$ The ECDH parameters must already exist beforehand or be generated as part of EC PKE key generation. $\;\;\;\;\;\;\;\;$
1h
comment If RSA is only used to encrypt symmetric keys which are random, what's wrong with textbook RSA?
For small $e$, there's an even faster attack. $\:$ Even for large $e$, the amount of space used can be made trivial. $\:\:$
14h
answered RSA with $\lambda(n)$ or $\varphi(n)$
16h
comment Diffe-Helman Exchange result is always 1
That means you'll get the same results as if you raised $1$ to the exponents. I get 5 from J.D.'s comment and your comment.
17h
comment Why have round constants in hashes?
Encryption is not known to be sufficient for collision-resistance‌​. $\;$
17h
comment Diffe-Helman Exchange result is always 1
@Jake : $47 \equiv 1\not\equiv 5 \pmod{23}$
17h
comment Diffe-Helman Exchange result is always 1
$47 \equiv 1 \pmod{23}$
1d
comment Mutual verification of shared secret
This attempts to slow down such tries, but heuristically doesn't actually stop either party from just trying candidates for the other party's input. $\:$ Also, how does she know "he saw that their ek2s matched"? $\hspace{.36 in}$
1d
comment Mutual verification of shared secret
@codebeard : $\;\;\;$ Well, $=\hspace{.02 in},\hspace{-0.03 in}\neq$ indicate whether the parties' inputs are equal or unequal, $\perp$s indicate "that foul play has taken place", and $T$ is the time it takes honest parties to solve the time-lock puzzles. $\:$ The only thing which might be at all impractical is the initialization phase (corresponding to $\operatorname{Sharegen}_r$), but I have no clue how practical or not that would be. $\;\;\;\;\;\;\;\;$
1d
comment Can I reduce the MAC size in TLS?
csrc.nist.gov/groups/ST/toolkit/BCM/documents/comments/CWC-GCM/… $\;$
2d
revised Mutual verification of shared secret
improved generalized protocol
2d
revised Mutual verification of shared secret
added in protocol using time-lock puzzles
Jul
4
revised Mutual verification of shared secret
moved warning up and gave reasons why huge improvements aren't possible
Jul
4
revised Mutual verification of shared secret
fixed security flaw and strengthened claim
Jul
4
comment Does authenticated encryption add any protection to a signed digital envelope?
@Sergio : $\:$ If the PKE scheme is CCA-secure, then sign-then-encrypt done properly will be optimal, since it will also hide the sender's identity from everyone other than the receiver. $\;\;\;\;$
Jul
4
revised Mutual verification of shared secret
fixed error and simplified construction
Jul
3
revised Mutual verification of shared secret
fixed a typo and made minor improvements
Jul
3
revised Mutual verification of shared secret
gave construction; my instinct was wrong
Jul
3
revised Easy explanation of “IND-” security notions?
converted French? to English
Jul
3
comment Easy explanation of “IND-” security notions?
Another notion is IND-CCA1. $\;$