15,282 reputation
22268
bio website pwnhome.wordpress.com
location
age
visits member for 3 years, 1 month
seen 4 hours ago

I like crypto. Need I say more?


6h
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.
7h
comment Small Prime Difference in RSA
@fgrieu very interesting.
18h
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.
1d
revised What does “learnable with oracle queries” mean?
added 182 characters in body
1d
comment What does “learnable with oracle queries” mean?
cleaned up some comments that were no longer needed
1d
revised What does “learnable with oracle queries” mean?
added 155 characters in body
1d
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.
1d
revised What does “learnable with oracle queries” mean?
added 530 characters in body
1d
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) :)
1d
answered Small Prime Difference in RSA
2d
answered Protection of Elliptic Curve Implementations against side-channel attacks
2d
revised Protection of Elliptic Curve Implementations against side-channel attacks
added 22 characters in body
2d
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.
2d
answered Implementation of garbled circuits using RSA
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
14
answered Is it true the longer the key length is the more secure the encryption?
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.