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

9h
comment Is it practical to use a stream cipher in a block cipher mode?
No, since stream ciphers are very different from block ciphers. $\;$
11h
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? $\;\;\;\;$
11h
comment Authenticated EC key exchange without a signing/signature scheme?
@MaartenBodewes : $\:$ PACE is a particular PAKE protocol. $\;\;\;\;$
19h
comment Using ECB as encryption mode, but encrypted messages are unique
@user3685322 : $\:$ It would be much better to use TLS, rather than SSL. $\;\;\;\;$
23h
comment RSA with probable primes
"crept happens" $\: \mapsto \:$ "crept in happens" $\;\;\;\;$
1d
comment RSA with probable primes
residuals $\mapsto$ residual $\;$
1d
comment RSA with probable primes
"which a" $\: \mapsto \:$ "which is a" $\;\;\;\;$
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 $\;$
1d
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}$
1d
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}$
2d
revised Factorization of a number obtained by a modular multiplication operation can reveal factors of the used operands?
fixed spelling and grammar
2d
comment Authenticated EC key exchange without a signing/signature scheme?
@StevePeltz : $\:$ Yes. $\;\;\;\;$
2d
revised Authenticated EC key exchange without a signing/signature scheme?
changed PAKE link
May
22
comment Hard-core predicates: should the adversary be given $1^n$?
$B$ can just run $A$ with $n$ ranging from $0$ to $\:2\hspace{-0.03 in}\cdot \hspace{-0.03 in}\operatorname{length}(\hspace{.03 in}y)\:$,$\:$ since injective functions have negligible probability of shrinking random inputs by large amounts. $\;\;\;\;$
May
22
comment Hash length extension attack - SHA256 to 512 - impossible, correct?
Of course, it would probably be better is the user can see a commitment to the secret instead of the SHA256 hash of the secret, and if the user-key is then HMACed with the secret instead of them being hashed with SHA512. $\;$