13,566 reputation
33272
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 3 years, 5 months
seen 10 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:


18h
revised How can a cryptosystem be unconditional secure?
make the image a link
1d
comment Is it safe to AES-CBC and AES-CMAC both using the same key?
@binta I did think this too, but the effective IV here is not the predictable "last 16 bytes of previous ciphertext", but the AES-encryption of those, which should not be predictable by an attacker, assuming no time-rollback.
Nov
27
comment Diceware word list for six dice
@Ed: I'm not sure that there are that many "relative easy words" in any language.
Nov
18
comment Is it possible to determine a PGP public key from encrypted data?
@Ricky I have to concur to e-sushi's comment ... could you write at least some excerpt of that answer here, maybe with some emphasis on the crypto-related stuff?
Nov
17
awarded  Enlightened
Nov
17
awarded  Nice Answer
Nov
17
revised How does GPG verify succesful decryption?
fix typo
Nov
10
revised What does $\mathbb Z_p^*$ contain?
formatting, better tag
Nov
10
comment Opinion on my idea for storing credit cards securely
Welcome to Cryptography Stack Exchange. How would a user "provide his private key"? I guess usual users can memorize their credit card data easier than they can memorize a private key.
Nov
7
revised What is the value of Q such that Q|P-1 where P is a prime number?
edited tags
Nov
7
comment Crypto-Compression Algorithms?
@Habib: The size of the message space doesn't change by compression, assuming you are using lossless compression (i.e. compression which can be reverted). You just change the encoding of it to a form which is on average shorter.
Nov
4
revised Why to try get key out of white box crypto? How can one protect WBC itself?
formatting
Nov
2
comment How to figure out the size of the output of a cryptographic checksum function
Welcome to Cryptography Stack Exchange. It looks like your question is actually to be answered in exercise 20 – the text before it doesn't really explain it.
Nov
2
revised How to figure out the size of the output of a cryptographic checksum function
formatting
Nov
1
revised How can a good pseudo-random number generator be made?
typos, formatting
Oct
28
revised Is there any probabilistic version of RSA?
a bit more on key randomization
Oct
28
revised Is there any probabilistic version of RSA?
add a note on the key randomization
Oct
28
answered Is there any probabilistic version of RSA?
Oct
21
awarded  Enlightened
Oct
21
awarded  Nice Answer