meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 2 days ago | |
| stats | profile views | 140 |
|
Mar 4 |
comment |
How to secure a mental poker protocol? @ThePiachu, the Wikipedia article you link to includes citations for [SCH98], [STA05], and [GOL05]. Have you read those articles? Do you understand their protocols? They would be a good place to start. No one here is likely to write a detailed tutorial that will spare you the need to read the original research papers. However, if you do the reading and get as far as you can on your own, if you find you get stuck somewhere specific, it's possible people might be able to help you if you can explain where you got stuck and what you tried. |
|
Mar 4 |
answered | How to secure a mental poker protocol? |
|
Mar 4 |
comment |
Security of Pohlig-Hellman exponentation cipher? @ThePiachu, I encourage you to ask you to ask a question about your particular application, instead of asking about Pohlig-Hellman. Don't assume Pohlig-Hellman is the best solution; let us advise you on the best solution. There may be better solutions to your problem. [The question you link to is an excellent example of that: for that problem, Pohlig-Hellman is the wrong solution (for some reason the OP has become focused on it, but it's not the best solution); the right solution is based upon private set-intersection protocols, which solve exactly the problem that OP had.] |
|
Mar 4 |
answered | Software implementation of a commutative cipher? |
|
Mar 3 |
comment |
Simple RC4 key generation scheme @cvoque, ahh, my mistake! Sorry for mis-interpreting the question. I've edited my answer just now to reflect what you were actually asking. Sorry about my confusion. |
|
Mar 3 |
revised |
Simple RC4 key generation scheme added 433 characters in body; added 125 characters in body |
|
Mar 3 |
answered | Simple RC4 key generation scheme |
|
Mar 3 |
answered | Is solving a modular linear equation a hard problem when the coefficient is not an invertible element? |
|
Mar 3 |
comment |
Is solving a modular linear equation a hard problem when the coefficient is not an invertible element? Please be more specific about what you mean by "solving". There may be multiple solutions (multiple values of $x$ that satisfy the equation). Do you want to find one solution, all solutions, or a specific solution? |
|
Mar 3 |
answered | Security of Pohlig-Hellman exponentation cipher? |
|
Mar 3 |
revised |
Why do we assume un-security of communication channel on every cryptography system clean up a little bit of the English. |
|
Mar 3 |
comment |
Are there any practical implementation of a homomorphic hashing or signature scheme? @PaŭloEbermann, I don't think you did anything wrong. The original question was poorly posed: it asked for an implementation, but it didn't specify what particular scheme it wanted an implementation of. There are many schemes in this space, and it's odd to ask for an implementation without knowing which scheme you want an implementation of. I think your edits improved the question. |
|
Mar 2 |
comment |
What is “Blinding” used for in cryptography? @HenrickHellström, the defense I have described (namely, blinding $x$) is a standard defense against timing attacks on RSA. To my knowledge, this method of blinding defends against all known timing attacks against RSA (i.e., against all attacks that are capable of recovering $d$). I do not know of any timing attack that works if $x$ is blinded in this way (i.e., any timing attack that can recover $d$ without knowledge of the value-to-be-raised). If you know of anything that contradicts this, I'd certainly be interested to hear. |
|
Mar 2 |
comment |
Finding roots in $\mathbb{Z}_p$ @fgrieu, good question. Actually, now that I take another look at those two papers, the running time seems to be linear in $n$, whereas we'd really want a running time that is poly($\log n$). I don't know whether there are efficient algorithms for large $n$. |
|
Mar 2 |
revised |
Finding roots in $\mathbb{Z}_p$ added 26 characters in body; added 155 characters in body |
|
Mar 2 |
answered | Can I combine two PRNGs to make use of more seed data? |
|
Mar 2 |
revised |
Finding roots in $\mathbb{Z}_p$ added 214 characters in body |
|
Mar 2 |
revised |
Finding roots in $\mathbb{Z}_p$ deleted 37 characters in body |
|
Mar 2 |
revised |
Finding roots in $\mathbb{Z}_p$ added 478 characters in body |
|
Mar 2 |
answered | Finding roots in $\mathbb{Z}_p$ |
