9,765 reputation
21743
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 1 year, 10 months
seen yesterday
stats profile views 210

Don't fear to edit my posts: even if I have more reputation than you, I do make mistakes.

I'm now also a Moderator Pro Tempore (= until the first elections) at Cryptography Stack Exchange: feel free to come around and ask some cryptography questions.


My personal name is spoken as /ˈpawlo/ (IPA), in English this would be written similar to Powlo, I think (i.e. the vowels are ow and o), with an accent on the before-last syllable (which is the first in this case). It's the Esperanto form of my given name.

The photo shows my shadow, taken at night. My camera sometimes seems to forget all the other frequencies and only stores the green ones.

My current main private programming project is the game of fencing, an online abstract turn based strategy game. Implemented as a Java applet, using git as a version control system.


Some more links:


1d
comment Why is SRP not widely used?
@SmitJohnth No, my comment was meant as a response to your comment. SRP is not just for the case where "I can't afford a SSL certificate", but offers additional advantages (but only works for the case of a limited user group).
2d
comment Why is SRP not widely used?
@SmitJohnth SRP has the additional advantage (over traditional RSA or DH key exchange with a server's certificate) that the client is automatically authenticated, too, and you don't need an additional step for client authentication.
May
21
revised How much data can I encrypt with AES before I need to change the key in CBC mode?
formatting
May
21
comment Is Wikipedia's table about SHA-2 collisions correct?
It looks like someone did remove the mention of the reduced-round attack altogether. For introducing another column, either simply do it or discuss it on the Wikipedia article's talk page – comments to this question are not the right location to discuss it. (Sorry, I kind of started it.)
May
21
comment Is Wikipedia's table about SHA-2 collisions correct?
@HenrickHellström So you are saying we should simply write "None" here, or that we should add the attacks for Keccak too? I wanted to do a minimal change which still is correct.
May
21
revised Is Wikipedia's table about SHA-2 collisions correct?
formatting
May
21
comment Is Wikipedia's table about SHA-2 collisions correct?
I corrected the table to say "None (For a 24-round variant: $2^{28.5}$)". Thanks for finding this.
May
20
answered What key length is required to keep simple keyed “hash” secure?
May
20
comment What key length is required to keep simple keyed “hash” secure?
@Thomas: How do you define "crap"? I would say most of those $10000^{10000}$ mappings are fine from a security view, though unfortunately also not really implementable without listing all key-value-pairs (which would look like a 50000-decimal-digit key).
May
20
comment Are there any hand ciphers not obsoleted by computer cryptanalysis?
@D.W. Do you know that there is a close-link where you can formally mark a question as a duplicate? (Just below the tag line.)
May
20
revised Perfect Secrecy, two Definitions
formatting quote as such, grammar fixes
May
20
answered Perfect Secrecy, two Definitions
May
19
reviewed Reject suggested edit on What is the post-quantum cryptography alternative to Diffie-Hellman?
May
17
revised Alternatives to HMAC + CBC?
edited tags
May
17
comment Is AES really used for Top Secret stuff?
@WilliamHird Sorry, I must have missed you. I normally only add a "Welcome" when I have something else to say, too, and maybe your start was perfect? Or back then I was not in the mood of welcoming people, since everyone was new (me included)? I don't know, it was almost two years ago. (I see I edited your first question, I should had added a comment, too. But I wasn't even a moderator then.)
May
17
revised How does OAEP improve the security of RSA?
format quote as quote, not as code.
May
17
revised How does OAEP improve the security of RSA?
better title, tags
May
17
comment How does OAEP improve the security of RSA?
@schrobe Welcome to Cryptography Stack Exchange. If you think poncho's answer answered your question fully, please accept it (klick the checkmark icon beside it), so others can see that this question is "solved".
May
17
comment Is this a sensible cryptographic protocol intending to reduce the impact of compromised security?
@RickyDemer They read over a long time, and the data might need to be analyzed in a short time frame.
May
17
revised When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible?
formatting