3,775 reputation
1621
bio website
location United States
age
visits member for 3 years, 1 month
seen yesterday

Oct
2
revised Alternative to NSA encryption algorithm
copy-edited and fixed a tag
Oct
1
comment Witness and Commitment in Commitment schemes
Not necessarily. $\:$ A bit or string is committed to. $\:$ That bit or string might $\hspace{1.8 in}$ happen to be a witness to something else. $\;\;\;\;$
Oct
1
answered Witness and Commitment in Commitment schemes
Oct
1
revised What is h in this RSA variant?
improved title's grammar
Oct
1
comment Why are we not using multiple ciphers per message?
... what it sounds like? They're the potential outputs that one doesn't become sure are not the actual output.
Oct
1
comment Why are we not using multiple ciphers per message?
@mikeazo : You can; it just takes a number of processors proportional to the number of potential outputs that don't get ruled out.
Sep
30
awarded  Explainer
Sep
30
comment Why should CAST5 and 3DES not be used for encrypting files over 4GB?
loose $\mapsto$ lose $\;$
Sep
30
comment Possible Digital Signature Hack?
Someone can't "generate another private key that will match your public key" because known ways to do that with currently existing technology would take too long to have a non-negligible probability of success.
Sep
28
comment Question about second preimage resistance of hash function combiner
A (1st) pre-image "attack on two combined hash functions" can be made to be "at least as difficult as an attack on the stronger of the two hash functions", but it is far from clear that the OP's combiner does so. $\;$
Sep
27
revised Keccak and compression functions
fixed typo and removed spaces from before question marks
Sep
26
comment Is deniable error-correction possible?
@gmr : $\:$ I doubt that poncho's parenthetical remark will help you, since your other question "would need the ECC to be indistinguishable (with high probability -- there can be some bit strings that are obviously not ECC codes) even to someone in possession of the key". $\;\;\;\;$
Sep
26
comment Is deniable error-correction possible?
@poncho : $\:$ Oh yeah, that could be non-simplifiable if there's no known way to efficient encode strings. $\;\;\;\;$
Sep
26
comment Is deniable error-correction possible?
"cannot feasibly be distinguished from a random string cannot feasibly be distinguished from a random string"?
Sep
25
revised Don't Understand these Parameters
fixed grammar
Sep
25
comment what is the difference between IBE and ABE schemes
key $\mapsto$ keys $\:$ and $\:$ corresponds $\mapsto$ correspond $\:$ and $\:$ decrypts $\mapsto$ decrypt $\;\;\;\;$
Sep
23
comment Fully Homomorphic Encryption over the Integers - perform an operation on an encrypted data
$XOR(x,y)$ and $OR(x,y)$ can be simplified to $\:x+y+((-2)*x*y)$ $\hspace{2.15 in}$ and $\:x+y+((-1)*x*y)\:$ respectively. $\;\;\;$
Sep
23
comment Fully Homomorphic Encryption over the Integers - perform an operation on an encrypted data
The fact that addition and multiplication can't turn 0s into a 1 shows that they are not complete operations. (However, addition and multiplication and $-1$ suffice to be complete operations.)
Sep
23
comment Is it possible to find out whether a number is greater than another number without knowing the numbers?
@BT : $\:$ In that case, you need a statistically binding commitment to the key. $\;\;\;\;$
Sep
23
comment Is it possible to find out whether a number is greater than another number without knowing the numbers?
Is the encryption public-key? $\:$ If yes, does the prover know the private key $\hspace{1.96 in}$ or the randomness used for encryption? $\;\;\;\;$