Reputation
4,259
Next tag badge:
47/100 score
29/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~40k people reached

4m
comment Is HMAC-MD5 still secure for commitment or other common uses?
If $\: 1 < L \:$ and there are at most $2^L$ permitted keys (in particular, if the key [must have length less than L] or [must have length exactly L]), then the probability of a random setup string being non-binding is less then $1\hspace{-0.02 in}\big/\hspace{-0.05 in}\left(\hspace{-0.02 in}2^{\hspace{.02 in}385-(2\cdot L)}\hspace{-0.05 in}\right)$. $\;\;\;$ That guarantee becomes meaningless slightly above $\: L = 192 \;$. $\;\;\;\;\;\;\;\;\;$
1h
comment Is HMAC-MD5 still secure for commitment or other common uses?
I also see no attack on the use of HMACMD5 for Naor's commitment scheme, via G(k) = HMAC(k,100) || HMAC(k,010) || HMAC(k,001), as long as $k$ is significantly less than 192 bits long. $\;$
3h
comment RSA public key exponent generation confusion
@tylo : $\;\;\;$ It one starts by choosing $e$, then $\: e=3 \:$ will force the primes to have $\hspace{1.31 in}$ remainder 2 mod 3 rather than 1 mod 3. $\;\;\;\;\;\;\;\;$
5h
revised Would this be a plausible authenticated encryption scheme using nested encryption?
put in screenshot
6h
comment Finding public exponent e
"$<n$" should be replaced with "$<n-1$". $\;$
6h
answered Would this be a plausible authenticated encryption scheme using nested encryption?
17h
comment Is it practical to use a stream cipher in a block cipher mode?
No, since stream ciphers are very different from block ciphers. $\;$
19h
comment Product of Sophie Germain Primes and safe primes
Ah, I guess I was unclear. $\:$ Does it also not matter what tupling function is used to $\hspace{1.16 in}$ calculate the bit-length of a given Cunningham chain? $\;\;\;\;$
19h
comment Authenticated EC key exchange without a signing/signature scheme?
@MaartenBodewes : $\:$ PACE is a particular PAKE protocol. $\;\;\;\;$
1d
comment Using ECB as encryption mode, but encrypted messages are unique
@user3685322 : $\:$ It would be much better to use TLS, rather than SSL. $\;\;\;\;$
1d
comment RSA with probable primes
"crept happens" $\: \mapsto \:$ "crept in happens" $\;\;\;\;$
1d
comment RSA with probable primes
residuals $\mapsto$ residual $\;$
1d
comment Executing encrypted code?
boazbarak.org/Papers/obfuscate.pdf $\:$ eprint.iacr.org/2014/942 $\:$ security.stackexchange.com/q/24551/49075 $\;\;\;\;$
1d
comment RSA with probable primes
cr.yp.to/primetests/quartic-20060914-ams.pdf $\;$
2d
comment Product of Sophie Germain Primes and safe primes
What tupling function should be used to calculate the length of a given Cunningham chain? $\hspace{.91 in}$
2d
revised Does the One Time Pad rely on confusion or diffusion?
fixed title's spelling
2d
revised How to prove that someone encrypted a specific (large) chunk of data
fixed title's grammar
2d
comment Huffman encoding of hashes
How about a base-256 encoding? $\:$ (aka, not encoded at all) $\;\;\;\;$
2d
comment Huffman encoding of hashes
They can be encoded with just 20 characters. $\;$
2d
comment Huffman encoding of hashes
No, but getting farther away from that requires more output for a given security level. $\hspace{1.41 in}$