3,181 reputation
21228
bio website
location
age
visits member for 2 years, 9 months
seen 4 hours ago

May
12
revised history wiki excerpt
Bug report test
May
12
awarded  Tag Editor
May
12
revised history wiki excerpt
added 1440 characters in body
May
12
comment Is XOR in a CBC-like mode secure?
Hello, welcome to crypto; I edited your title to be a little more descriptive (I realise you probably didn't know what to put as the title :)) - if you want to improve it, or roll it back, there is an edit link directly underneath your question which you can use at any time :)
May
12
comment Academic papers on GPU password cracking?
@Ian I'm slightly confused, as it isn't you asking the question - however, c'mon, you have 22k rep on SO and you're telling me you can't see why we've closed this as list-inviting? "Are there any implementations of sha1 in C#?" is that a good question? No. Now, there is the potential for this to be a good question by asking about what you want to know reading those papers - but not asking for a yes/no, and not asking for some papers.
May
12
revised Is XOR in a CBC-like mode secure?
A slightly better title.
May
11
revised How were the AES key and block length subsets of Rijndael selected?
Better title
May
11
revised Why DSA cannot be used for encryption?
deleted 3 characters in body; edited tags; edited title
May
11
answered Why DSA cannot be used for encryption?
May
10
comment Academic papers on GPU password cracking?
Closed for the reasons @mikeazo states - "please list" questions are quite hard to maintain and we've generally found they don't work. Also, as stated, somebody could simply answer "yes"... - however, if there is a specific problem you're looking at understanding, that would make a valid question. Feel free to edit/flag for re-opening if there is a specific problem you're looking to understand.
May
9
comment Chinese Remainder Theorem and RSA
@MihaiTodor we support LaTeX notation using $ symbols to enter maths, if you need to edit your question. Works in both comments and questions, e.g. $m = m_2 + (h * q)$, where $h = q_{inv} * (m_1 - m_2) \mod p$ :)
May
8
revised How can disk encryption systems (like Truecrypt) resist frequency analysis when they allow random access?
Better title.
May
6
revised Is Wiener's attack on RSA extendable to larger keys with low hamming weight?
edited tags
May
6
revised Order of hashing concatenation
Title spelling mistake
May
4
revised Do public/private pairs work both ways?
Slight grammatical fix in the title :)
May
3
reviewed Reject suggested edit on Are there practical upper limits of RSA key lengths?
May
3
reviewed Approve suggested edit on Finding the LFSR and connection polynomial for binary sequence.
Apr
30
awarded  Taxonomist
Apr
26
comment Advantages of each encryption mode
I'm closing this for now as it remains way too broad - we can't just list some advantages based on requirements that might or might not suit your case, because that's just not answerable. Rather than "what are some advantages", explain the situation you are likely to encounter - for example this question asks about maximum key sizes for CBC. Again, David's comments are excellent - you need to be specific. When you're done, flag for re-opening and we'll get the answers coming in again.
Apr
25
revised How to sign a message using RSA?
Change the title to reflect the use of RSA.