3,700 reputation
1621
bio website
location United States
age
visits member for 3 years
seen 1 hour ago

Sep
28
comment Simpler proof of RSA's correctness
You can only "apply Euler's theorem to $x$ and $p$ and $x$ and $q$ separately" when $x$ is neither a multiple of $p$ nor a multiple of $q$. $\;$
Sep
28
comment Simpler proof of RSA's correctness
$x = 4 \;$ and $\; a = 0 \;$ and $\; n = 2 \;$ and $\; b = 1 \;$ and $\; m = 3 \:\:$ forms a counterexample $\hspace{1.45 in}$ to your "property regarding congruences". $\;\;\;\;\;$
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? $\;\;\;\;$
Sep
22
revised Key management for military GPS receivers
fixed title's grammar
Sep
22
comment Perform general computation using a crypto algorithm as a building block
How basic are those features? $\;$
Sep
20
revised exchanging private key between service and iPhone app - digital signing
one more change to grammar
Sep
20
revised exchanging private key between service and iPhone app - digital signing
capitalized "i" and fixed spacing
Sep
19
comment Is it possible (how difficult) to find MORE than one valid RSA signature?
@CodesInChaos : $\:$ Alternatively, one can choose large prime public exponents. $\hspace{1.59 in}$
Sep
18
revised SHA-1 collision resistance
inserted apostrophe and capitalized authors' names
Sep
17
comment The difference between being not strongly collision resistant, and not weakly collision resistant?
One doesn't need a random oracle to get "Strong collision resistance implies weak collision resistance". $\;\;\;\;\;$
Sep
17
revised fuzzy commitment implemenation to make secure biometric template
fixed capitalization, fixed spacing around periods, and added comma to make actual question