13,426 reputation
33171
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 3 years, 3 months
seen 17 hours ago

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:


Oct
24
revised Is there a group of prime order which could fit the CT-Computational Diffie-Hellman assumption?
title as question, formatting to make the assumption more clear, page numbers
Oct
24
wiki created pgp description
Oct
24
wiki created pgp excerpt
Oct
24
revised Why did NIST remove The Lempel-Ziv Compression test from the Statistical Test Suite?
rng-tag, formatting
Oct
24
comment How to require two keyholders to decrypt a document?
You seem to have two third parties with no second party here. (Also, if they are really trusted, you don't need to split the key.)
Oct
24
revised How to require two keyholders to decrypt a document?
edited tags
Oct
24
revised How to require two keyholders to decrypt a document?
inline the Wikipedia link
Oct
24
revised How can I use asymmetric encryption, such as RSA, to encrypt an arbitrary length of plaintext?
formatting, add streaming mode comment
Oct
24
revised How can I use asymmetric encryption, such as RSA, to encrypt an arbitrary length of plaintext?
formatting, grammar
Oct
24
revised What are the details of the DES weakness of reusing the same IV in CBC mode with the same key?
add tag, add AES-comparison question (from comment).
Oct
24
revised RSA with small exponents?
formatting fixes
Oct
24
wiki created hotp description
Oct
24
wiki created hotp excerpt
Oct
24
revised Endless PRNG from PRNG with specific stretch?
add some more explanations about state size
Oct
24
comment Endless PRNG from PRNG with specific stretch?
@RickyDemer For the MAC construction (using a counter) you will have to include the seek size in the internal state size, which will mean that at some point you will run out of room and have some kind of overflow, and have it cycle after this. (Though I think the number of bits output until then is exponential in the state size, not polynomial.)
Oct
24
answered Endless PRNG from PRNG with specific stretch?
Oct
24
comment Endless PRNG from PRNG with specific stretch?
@RickyDemer $n^2$ is a polynomial in $n$. I'm not really sure what you are argumenting here.
Oct
24
revised Is the CBC weakness in XML Encryption a new discovery? Are other applications vulnerable?
add tags
Oct
23
comment Can one generalize the Diffie-Hellman key exchange to three or more parties?
@imichaelmiers: Actually, for this we work we only need an abelian group - we then obviously work in a cyclic subgroup (the one generated by $g$) of it. Still, as it was worded, arguably "cyclic" is better (since a noncyclic group has no generator). Thanks for the edit!
Oct
23
reviewed Approve suggested edit on Can one generalize the Diffie-Hellman key exchange to three or more parties?