13,536 reputation
33272
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 3 years, 4 months
seen 5 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
26
answered Does the XML Encryption flaw affect SSL/TLS?
Oct
26
revised How can I encrypt more than 64 bit with the Data Encryption Standard?
inline the links
Oct
26
revised How can I encrypt more than 64 bit with the Data Encryption Standard?
better title, formatting
Oct
25
revised Protocol to generate Client Certificates at the start of a SSL session automatically?
edited tags; edited tags
Oct
25
revised How can rainbow tables be used for a dictionary attack?
better title, adding some paragraphs.
Oct
25
revised With sufficient randomness, is XOR an acceptable mechanism for encrypting?
formatting
Oct
25
revised Is SHA-512 bijective when hashing a single 512-bit block?
add some more links
Oct
25
revised Is SHA-512 bijective when hashing a single 512-bit block?
add some reasoning about collisions (from comments)
Oct
25
revised Is SHA-512 bijective when hashing a single 512-bit block?
add some clarification from the comments
Oct
24
revised What is the use of REAL random number generators in cryptography?
add some indication why these are not needed to be deterministic
Oct
24
revised What is the use of REAL random number generators in cryptography?
formatting, slight rewording
Oct
24
revised Is key size the only barrier to the adoption of the McEliece cryptosystem, or is it considered broken/potentially vulnerable?
add tag
Oct
24
revised How to require two keyholders to decrypt a document?
formatting, slight rewording
Oct
24
comment Is there a group of prime order which could fit the CT-Computational Diffie-Hellman assumption?
This assumption in the paper looks bogus. It does not say how the hash function is used, for example.
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