14,519 reputation
22066
bio website pwnhome.wordpress.com
location
age
visits member for 2 years, 11 months
seen 1 hour ago

I like crypto. Need I say more?


Nov
1
comment Question about the definition of a perfect cipher
P.S., you are correct in your probability. Try applying Bayes rule.
Nov
1
comment Question about the definition of a perfect cipher
Welcome to Crypto.SE. I hope you find the site useful. Is this homework? If so, we allow homework questions, but expect you to describe what you have tried that hasn't worked, etc. See here.
Nov
1
comment How to develop a public key cryptosystem based on a hard problem?
I think what we are seeing here is that there is no set process for taking a hard problem and turning it into a public key cryptosystem. I agree with DrLecter that you probably need to post more details here about your specific problem before we can help.
Oct
30
answered XOR secret sharing scheme
Oct
29
answered Why do authors say conflicting things regarding leak-free stages in their paper?
Oct
29
comment Why do authors say conflicting things regarding leak-free stages in their paper?
I think they are saying assuming leak free is necessary to prove security for their protocol, but it woul be really cool (thus an open problem) to design a protocol that can tolerate leaks in any stage.
Oct
29
comment What is the definition of “security beyond the birthday paradox”?
+1, short, sweet and to the point
Oct
29
comment XOR secret sharing scheme
if $a=a_1\oplus a_2\oplus\dots\oplus a_n$, if you have less than $n$ shares you cannot reconstruct $a$. Are you sure you aren't wanting shamir secret sharing?
Oct
29
comment XOR secret sharing scheme
with xor secret sharing $t=n$, no?
Oct
29
comment XOR secret sharing scheme
I don't think you can with xor sharing. You could with additive secret sharing or shamir secret sharing. You can certainly get the xor of a and b.
Oct
29
comment What is the definition of “security beyond the birthday paradox”?
@DrLecter you should write that up as an answer.
Oct
29
comment PAK Diffie-Hellman vs. sharing high-entropy key
Do either of you care to put your comments as answers?
Oct
28
asked Why is a simple hash into $G_2$ for (certain) pairing based crypto not possible?
Oct
28
awarded  Announcer
Oct
23
comment How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
$\varphi$ is euler's totient function
Oct
23
answered How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
Oct
23
comment How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
you can also omit odd values for $\varphi$ since $p,q$ are prime (hence odd), $p-1,q-1$ are both even, so $(p-1)(q-1)$ is even.
Oct
22
comment Genuine encryption from only one source?
Signatures can only be created with the private key. Publishing the public key will not allow them to sign anything.
Oct
22
reviewed Leave Open Logics for Cryptographic Information Games
Oct
22
comment MARS and RC6 in CUDA
@pg1989 actually the question is asking for references to existing cuda implementations of block ciphers, which is a pretty poor question. it could probably be made much better by focusing more on what you said.