2,946 reputation
1518
bio website
location United States
age
visits member for 2 years, 6 months
seen 54 mins ago

3h
revised Why does knowing the number of points on a curve help solve ECCDLP?
improved grammar
6h
comment difference between leveled FHE and normal FHE scheme
I think leveled FHE also avoids the assumption of circular-security. $\;$
8h
answered Is HMAC necessary if the AES ciphertext of a message includes the CRC of the message?
1d
revised Using beginning of TLS ecnrypted data to reveal secret
improved grammar and added tag
1d
comment Security of RSA for paranoids with padding?
I would advise against using $H(N||r)$ as a shared key, since concatenation is not injective. $\:$ (However, using $H(prefixfree(r)||N)$ as the shared key should be fine.) $\:$ It's not "a security argument we can make thanks to that", it's that "the obvious" reduction will be more efficient, since there's no interaction between the keys. $\;\;\;\;$
1d
comment Security of RSA for paranoids with padding?
It is referencing what you guessed. $\:$ I also incorrectly wrote $r^e$ when I meant just $r$. $\;\;\;$ The pair whose elements are $r$ and $N$, which could be represented as $\:((N\cdot (N\hspace{-0.04 in}-\hspace{-0.05 in}1))/2)+r\;$. $\;\;\;\;\;\;$
1d
comment Security of RSA for paranoids with padding?
For the setting referenced in your last bullet, it would probably be better to use the random oracle's value at the pair that indicates $r^e$ and the modulus, rather than just at $r^e$. $\;$
1d
comment ECC Complexity order of point addition, scalar point multiplication and selecting random point
I notice that there is no question in this post. $\;$
1d
revised Frequency analysis of transposition ciphers
fixed grammar
1d
comment How can I generate a brief (100) stream of random numbers, not using the computer or throwing dice?
a deck of cards $\;$
1d
comment Encrypting a short phrase into two keys. both with length of 32letters
en.wikipedia.org/wiki/Secret_sharing#t_.3D_n $\;$
1d
comment Encrypting a short phrase into two keys. both with length of 32letters
What do you mean by "encrypting ... into two keys"? $\;$
1d
revised HMAC definition by using only one key
improved grammar
2d
comment Key construction in the Full Cramer-Shoup cryptosystem
Um, no, there's only one secret key in this scheme. $\:$ There are six secret exponents in this scheme. $\hspace{.41 in}$
2d
revised Why does computing g^a * g^{-a} with the PBC library result in zero?
fixed grammar and removed unnecessary tags
Apr
21
comment Definition of one-way functions: randomly-chosen point vs every point
No, since 2) uses a probability over the choice of $x$. $\:$ "Math books generally don't use the phrase $\hspace{.4 in}$ 'for x randomly chosen...'" because they generally don't mean "for $x$ randomly chosen". $\hspace{1.02 in}$
Apr
21
comment Definition of one-way functions: randomly-chosen point vs every point
(Furthermore, that's not the wiki definition either.) $\;$
Apr
21
comment Definition of one-way functions: randomly-chosen point vs every point
One-way functions are not generally defined like that, since that definition is provably impossible to achieve. $\:$ $M$ could try guessing $k$ based on the length of its input and then search for a preimage by brute force. $\;\;\;\;$
Apr
20
revised Diffusion in Shamir's secret sharing scheme
inserted questions I'm responding to
Apr
20
comment Diffusion in Shamir's secret sharing scheme
I think "additional security" should be changed to "additional secrecy". $\;$