3,650 reputation
1520
bio website
location United States
age
visits member for 2 years, 10 months
seen 4 hours ago

Apr
28
comment Simplified Key Wrapping to Achieve Only Confidentiality?
Yes, although I noticed that I can cut down on the number of lines, so I removed two of them. $\hspace{.77 in}$
Apr
28
revised Simplified Key Wrapping to Achieve Only Confidentiality?
reduced number of line-breaks
Apr
28
comment Simplified Key Wrapping to Achieve Only Confidentiality?
I do not mean guessing W'. $\:$ See my updated answer. $\;\;\;\;$
Apr
28
revised Simplified Key Wrapping to Achieve Only Confidentiality?
addressed OP's comment
Apr
27
answered Simplified Key Wrapping to Achieve Only Confidentiality?
Apr
24
revised Why does knowing the number of points on a curve help solve ECCDLP?
improved grammar
Apr
24
comment difference between leveled FHE and normal FHE scheme
I think leveled FHE also avoids the assumption of circular-security. $\;$
Apr
24
answered Is HMAC necessary if the AES ciphertext of a message includes the CRC of the message?
Apr
23
revised Using beginning of TLS ecnrypted data to reveal secret
improved grammar and added tag
Apr
23
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. $\;\;\;\;$
Apr
23
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\;$. $\;\;\;\;\;\;$
Apr
23
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$. $\;$
Apr
23
comment ECC Complexity order of point addition, scalar point multiplication and selecting random point
I notice that there is no question in this post. $\;$
Apr
23
revised Frequency analysis of transposition ciphers
fixed grammar
Apr
23
comment How can I generate a brief (100) stream of random numbers, not using the computer or throwing dice?
a deck of cards $\;$
Apr
23
comment Encrypting a short phrase into two keys. both with length of 32letters
en.wikipedia.org/wiki/Secret_sharing#t_.3D_n $\;$
Apr
23
comment Encrypting a short phrase into two keys. both with length of 32letters
What do you mean by "encrypting ... into two keys"? $\;$
Apr
23
revised HMAC definition by using only one key
improved grammar
Apr
22
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}$
Apr
22
revised Why does computing g^a * g^{-a} with the PBC library result in zero?
fixed grammar and removed unnecessary tags