Reputation
5,490
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 8 21
Newest
 Pundit
Impact
~58k people reached

Dec
8
comment what is the fastest and efficient method to perform modular multiplication?
No. ​ (I don't know of any.) ​ ​ ​ ​
Dec
8
comment what is the fastest and efficient method to perform modular multiplication?
en.wikipedia.org/wiki/Montgomery_modular_multiplication ​ ​
Dec
8
comment RSA enc/decryption with multiple prime modulus using CRT
en.wikipedia.org/wiki/… ​ ​
Dec
6
comment Random Coin Flip
No; I'm saying we must assume a randomized not-necessarily-encryption scheme for that. ​ ​
Dec
6
comment Random Coin Flip
(I think I fixed my answer's ambiguity.) ​ Sender-non-committing encryption is what you get by removing each of $\sigma_G$ and $\sigma_G^b$ from the ordered quadruple it's an entry of in [Definition 2](www.cs.columbia.edu/~dglasner/MyPapers/nce.pdf#page=9). ​ ​ ​ ​
Dec
6
revised Random Coin Flip
fixed significant ambiguity
Dec
6
comment How do I prove that a bit by bit PKE scheme (that is IND-CPA secure) for an n-bit message is not IND-CCA-2 secure?
... You find a CCA attack against the scheme, and show that the attack works. ​ ​
Dec
6
answered Random Coin Flip
Dec
5
comment Unconditionally Secure Authentication
crossposted to security without mentioning that on either site ​ ​
Dec
5
comment Unconditionally Secure Authentication
Length has to do with this question due to the OTP hiding everything else from eavesdroppers. ​ Oh yes, so the conclusion in fact holds for an even easier reason than I was trying to use. ​ ​ ​ ​
Dec
5
comment Unconditionally Secure Authentication
In that case: ​ ​ ​ Yes. ​ length(H(plaintext)) only depends on length(plaintext) so length(plaintext || H(plaintext) also only depends on length(plaintext). ​ ​ ​ ​ ​ ​ ​ ​
Dec
5
comment Unconditionally Secure Authentication
Is your EDIT 2 question still restricting to passive attacks? ​ ​
Dec
5
comment Unconditionally Secure Authentication
Possible duplicate of Why is plain-hash-then-encrypt not a secure MAC?
Nov
30
comment paradox on fully homomorphic equality checking
I doubt it. ​ ​
Nov
30
comment Cryptographic hash with ability to ignore specific bits based on a hidden pattern?
@otus: ​ In addition to being deterministic, it would also need to be that E(x) homomorphic-and E(y) gives E(x&y), rather than something else that decrypts to x&y. ​ ​ ​ ​
Nov
30
comment Cryptographic hash with ability to ignore specific bits based on a hidden pattern?
@Dave: ​ ​ ​ Are you aware that that one can implement bitwise-and by multiplying the corresponding bits? ​ ​ ​ ​
Nov
30
comment paradox on fully homomorphic equality checking
"does not the result"? ​ (You seem to be missing a verb.) ​ There's certainly no obvious way of using FHE to let the ciphertext-holder non-interactively check equality. ​ ​ ​ ​
Nov
30
comment paradox on fully homomorphic equality checking
1. ​ The server will use the FHness of the encryption scheme. ​ ​ ​ 3. ​ No ​ ​ ​ ​ ​ ​ ​ ​
Nov
24
comment Miller Rabin - Error probability of .5 a possibility?
Huh, that does confuse me about the algorithm. ​ ​
Nov
24
comment Miller Rabin - Error probability of .5 a possibility?
If u=1 then your initial for loop will execute 0 times. ​ ​