15,292 reputation
22268
bio website pwnhome.wordpress.com
location
age
visits member for 3 years, 1 month
seen 22 mins ago

I like crypto. Need I say more?


16h
comment How to compute 3P from elliptic curve where P is (28, 8)
Do you know how to add points? If so, $P+P+P=3P$
19h
comment What are the advantages of Certificate Authority and Key Distribution Center over each other?
Can you explain what each means to you?
1d
comment Small Prime Difference in RSA
@fgrieu, so the method I outlined is really no better than trial division, but fermat's method is. I hope you plan to write up an answer.
1d
comment Small Prime Difference in RSA
@fgrieu very interesting.
1d
comment How Secure is a Pronounceable Password? In means of entropy
Do you have some pseudocode or anything on the method of generation? Once you know that, you can compute the entropy of the resulting passwords.
2d
comment What does “learnable with oracle queries” mean?
cleaned up some comments that were no longer needed
2d
comment What does “learnable with oracle queries” mean?
@Laura, I updated your question to hopefully make it more clear. I'll reopen. If I destroyed the original meaning of the question, please feel free to edit.
2d
comment Small Prime Difference in RSA
The big benefit of this approach is that it works not just for a small $p-q$ difference, but also when $p-q$ might come from a small range of numbers (which could be fairly large themselves). For this specific question, starting at $\sqrt{n}$ is likely the better option, but I didn't want to steal your comment (which should be an answer) :)
Oct
20
comment Arranging Vigenere Cipher into columns
This question should be on StackOverflow as it is about programming and algorithms, not about cryptographic theory. I'll move it.
Oct
17
comment Implementation of garbled circuits using RSA
RSA typically isn't used for Yao's method. They define what they use for enc a little lower in the document
Oct
17
comment How do you test randomness?
Can you never prove pseudorandomness or do we just not know how? Existance of one-way functions would imply existence of pseudorandom generators right? It would also imply $P\neq NP$.
Oct
16
comment I need to know number of encryption/decryption operations?
How many keys??
Oct
10
comment Finding all primitive polynomials of a certain degree in $\mathbb{F}_q$
Migrated. Hope you continue to use our site, though, as your needs require it.
Oct
10
comment Finding all primitive polynomials of a certain degree in $\mathbb{F}_q$
Two suggestions, first is to format your equations using MathJax which is supported on our site. Second, while there are cryptographic applications to your question, your question is inherently more about math. Maybe we should migrate it to Math.SE? Let me know if you want it migrated, and I'll do that.
Oct
9
comment Is .NET DESCryptoServiceProvider secure in this case?
@Jk_xp I think so. Make sure you are using a good mode. In particular, if you choose CBC or another non-authenticated mode, make sure you understand the implications of doing that in the context of your application. The remaining obvious risk is that your server could be hacked and the key stolen. If that is an acceptable risk to you, then you should be fine.
Oct
9
comment Is .NET DESCryptoServiceProvider secure in this case?
@Jk_xp your code, as is, is completely insecure since it uses DES. Now, let's say you changed it to AES. That would be a step up. But, since the key and IV are hard coded into the code, someone could reverse engineer your executable, and recover those values. Then they have both and can create their own messages.
Oct
9
comment Security analysis of Spritz?
From the paper you linked to "The virtues of Spritz as a hash function are more its simplicity of implementation and conservative design than its speed." Maybe the same can be said about Spritz as a stream cipher?
Oct
9
comment Security analysis of Spritz?
Keccak and SHA-256 are not ciphers. SHA-256 is a hash function. Keccak is a family of sponge functions which can be used to build hash functions (SHA-3 competition) or stream ciphers.
Oct
8
comment Does this guarantee a unique 32 bit Hash?
@sashank, One thing I noticed with your code is that since the string generation is deterministic, it always finds the same collisions. I changed it so it appends a random integer to "Hello" instead. Then you get some variation. I did this and ran the code 1000 times. That resulted in an average of around 57k iterations. If I run it more, it should get closer to the expected 65k.
Oct
7
comment Does this guarantee a unique 32 bit Hash?
@sashank that seems strange. Are you willing to share your code? I'd like to see what I get.