9,765 reputation
21743
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 1 year, 10 months
seen 20 hours ago
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:


May
11
comment Does SRP reduce to DH key echange when shared password is not secret?
Hmm, I imagine that out-of-band channel as a telephone call between two humans, and they usually don't want to read long series of numbers to each other. Therefore I imagine it would be easier to derive some hash from $K$ and read/compare this instead of the whole transcript.
May
11
revised Why is the basic (fixed-length) CBC MAC construction not a secure MAC when it is used on variable-sized messages?
edited tags
May
11
comment CBC-MAC , fixed length, all blocks returned
@curious Even the best authors make typos ... and when not native in English (as me and fgrieu), we tend to overlook them sometimes. Luckily Crypto SE reputation doesn't mirror mainly English language knowledge. Thanks for your correction, and feel free to suggest edits wherever you find typos or other kind of mistakes. (When it is not totally obvious that it is a mistake, a comment might be better, though.)
May
11
revised Does SRP reduce to DH key echange when shared password is not secret?
add some more disclaimers.
May
11
revised Does SRP reduce to DH key echange when shared password is not secret?
add number
May
11
answered Does SRP reduce to DH key echange when shared password is not secret?
May
11
reviewed Approve suggested edit on Combining LFSRs for Stream Ciphers: Why do we need high non-linearity?
May
10
comment Does SRP reduce to DH key echange when shared password is not secret?
What does "I've already done mutual authentication" mean in your protocol? Does this protect against a man-in-the-middle?
May
10
comment random number generator 10-side dice alternative
That is a quite slow way of generating random digits/letters/signs. Its quality depends on how good you can shuffle, and if really all keys have same form, weight and so on.
May
10
answered Finding hash almost-collisions
May
10
comment Finding hash almost-collisions
It looks like there was some cheating ... I suppose for the next such competition, one should have salted the input by the submitter's name (or institution domain name, here), so copying other people's result will not help at all :-)
May
10
comment Finding hash almost-collisions
Some background‌​.
May
10
comment Is the DES algorithm in OPENSSL random?
@StephenTouset I wouldn't say "absolutely 100% broken", just "can be bruteforced in a reasonable time by attackers with some recources". And this is mainly because of the small effective key size of 56 bits. It would be broken when there were much faster attacks than that. Or did I miss some new developments in cryptanalysis of DES? (But still, don't use DES nowadays.)
May
9
revised Given a certain entrophy per character, how long should a passphrase be to guarantee key strength?
add missing L in the formula.
May
9
reviewed Approve suggested edit on Custom crypto library in C
May
7
comment Why is the basic (fixed-length) CBC MAC construction not a secure MAC when it is used on variable-sized messages?
@imichaelmiers: You are welcome to discuss this on meta.
May
7
comment AES - plaintext is smaller 128 bit - how to expaned?
Wouldn't that be 16 bytes 0x10? 0x0f is 15. (This is known as PKCS#7-padding, also.)
May
6
comment What is a CBC Mac Scheme? How does knowing one block release other?
Welcome to cryptography Stack Exchange. Your question is a bit short and without much detail, so it looks like you want to know the same as the question linked by Poncho. If you don't think your question is the same, please edit it to make clear what your question actually is.
May
6
reviewed Approve suggested edit on CBC-MAC , fixed length, all blocks returned
May
6
comment Show that for all integers n>2, n does not divide n^2+2
This question has nothing to do with cryptography (or the connection is really good hidden).