meta user
network profile
| bio | website | pwnhome.wordpress.com |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 8 months |
| seen | 3 hours ago | |
| stats | profile views | 66 |
I like crypto. Need I say more?
|
6h |
comment |
calculating beta for elgamal elliptic curves I'm going to close this for now. Please update to address exactly what you don't understand from the question I linked to above. Then we can reopen (just flag the question). |
|
May 16 |
comment |
Understanding Feldman's VSS with a simple example I think wikipedia is referring to the fact that if $g$ is a generator of $\mathbb{Z}_p^*$, then $(g^s \mid p)$ leaks the least significant bit of $s$ (HAC 3.9.1). Wikipedia only suggests choosing $g$ with prime order $q$ where $q\mid p-1$ in a parenthetical statement as kind of an afterthought. I'm assuming that is why they say $g^s$ leaks information. |
|
May 16 |
comment |
Understanding Feldman's VSS with a simple example Choosing $p,q$ in this manner ensures that the Legendre symbol of the secret $s$ is not leaked by the commitment $g^s$, correct? Specifically, the article on Wikipedia says the description of Feldman's VSS as written there is not secure as $g^s$ leaks information about $s$ (which I'm assuming is the Legendre symbol). Does choosing $p,q$ as you specify fix this problem? |
|
May 15 |
comment |
calculating beta for elgamal elliptic curves The equations are in the answers I linked to. What exactly don't you understand. |
|
May 15 |
comment |
calculating beta for elgamal elliptic curves crypto.stackexchange.com/questions/3907/… might help too. |
|
May 15 |
comment |
calculating beta for elgamal elliptic curves $\alpha+\alpha+\alpha+\alpha+\alpha+\alpha+\alpha$ |
|
May 13 |
comment |
Why is the discrete log problem easy when the exponent comes from a binomial distribution? I'd add that lookup tables are especially useful here too. You must be willing to use more space, but for small plaintext spaces, it is very feasible. |
|
May 13 |
comment |
Why is the following RSA PRNG cryptographically secure? @Maeher, yes, let me reword to make it clear. Thanks for pointing that out. |
|
May 10 |
comment |
Finding hash almost-collisions @0xFE, if the problem is massively parallelizable, then hardware can make a huge difference. See cs.rit.edu/~ark/parallelcrypto/sha3test01 for more info (including some code). |
|
May 10 |
comment |
Finding hash almost-collisions @CodesInChaos, this is good. I need all the checking of my math I can get. You are right, it should be $2^{51}$ for a $.5$ probability. Threw in a little birthday problem math by mistake. |
|
May 10 |
comment |
Cryptography based upon neural networks @D.W., is right. The only reason I wrote an answer is because it wouldn't fit in a comment. |
|
May 10 |
comment |
Is the DES algorithm in OPENSSL random? @vikkyhacks,Depending on your application, hiding the salt (much like hiding an IV or nonce) is unnecessary. The salt ensures the key is different from execution to execution making it such that the ciphertext is different even for the same plaintext/password. See also. |
|
May 10 |
comment |
Finding hash almost-collisions One problem I ran into when doing this is that the output of the Skein library I was using Skeinfish wasn't the same as what XKCD reported. They were apparently using PySkein which had a newer tweak to the key schedule constants. It took me a while to figure this out. |
|
May 10 |
comment |
Is the DES algorithm in OPENSSL random? @vikkyhacks, I haven't looked at the code, but I imagine that the first few bytes immediately after SALTED_ in the ciphertext is the salt. |
|
May 10 |
comment |
Is the DES algorithm in OPENSSL random? Cleaned up some comments from a previous version of answer. Thanks @StephenTouset for pointing out my flaw. |
|
May 10 |
comment |
Cryptography based upon neural networks Have you done a background/lit. search? If so, would you mind sharing some of the results you've come across. For me in particular and probably others here, neural crypto is something I've never heard of. |
|
May 9 |
comment |
Decrypting TLS in Wireshark when using DHE_RSA ciphersuites I think your question is better suited for IT Security as it is more about how to do something in Wireshark and less about cryptography. I'll migrate there and hopefully you will be able to find a better answer than you would here. Our questions/answers tend to be more theoretical/mathematical in nature. |
|
May 7 |
comment |
How to hash a structure that needs to include that hash's outcome? @JohnDeters, I totally agree and should have put that in the answer. |
|
May 7 |
comment |
DES chosen-plaintext attack in Windows Are you looking for some software/script to run to do the attack or are you looking for the theory of how a DES chosen-plaintext attack is done? If the former, your question is off topic here. If the latter, your question is probably too broad and you'd do well to narrow it. There are lots of papers out there on CP attacks on DES. Read one and post specific questions about what you don't understand. |
|
May 7 |
comment |
2 ciphers to solve This type of question is generally considered to be off topic or too localized here. There are a number of questions already here on how to approach solving this type of problem. I'd suggest looking at those and see if they help. |
