13,436 reputation
33171
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 3 years, 3 months
seen yesterday

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:


Sep
27
reviewed Approve suggested edit on What are the benefits of the two permutation tables in DES?
Sep
27
reviewed Approve suggested edit on Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
Sep
27
revised Why isn't the IND-CCA property inherited when sending redundant ciphertext?
secret instead of private
Sep
27
comment Why isn't the IND-CCA property inherited when sending redundant ciphertext?
Are you actually using a public-key scheme (e.g. using a key-pair), or are you using a secret key scheme (where both parties have the same shared key)? "private key" is normally used to refer to the former, but sometimes also the latter, this is why "public key scheme" is preferred.
Sep
27
revised Why isn't the IND-CCA property inherited when sending redundant ciphertext?
better title, some formatting, rewording, link
Sep
27
asked What is the difference between a stream cipher and a one-time-pad?
Sep
27
revised How can I prevent a message replay with RSA?
edited tags
Sep
27
answered How can I prevent a message replay with RSA?
Sep
27
answered Is Diffie-Hellman mathematically the same as RSA?
Sep
27
revised Is Diffie-Hellman mathematically the same as RSA?
some formatting, spelling
Sep
27
comment A set of key pairs and one hash to secure them
Is your "variable that uniquely identifies the user" secret (i.e. only known to this user)? Only then it makes sense to use this to create an encryption key for this user.
Sep
27
comment Need an introduction to SPKI (or “SPKI for dummies”)
From the cryptographic point of view, any formal language that enables writing this could be used. S-expressions (especially the canonical form) just are really easy to parse, contrary to (for example) X.509 certificates (where you need ASN.1 for the binary encoding).
Sep
27
answered Need an introduction to SPKI (or “SPKI for dummies”)
Sep
26
comment Can a computationally unbounded adversary break any public-key encryption scheme?
@Bill Sorry, I did not intend to change the meaning of the question with my edit, I only intended to make it less "home-work-y" and more "question-y". Do you really feel the original question (or the question after huyichen's first edit) was in core other than it is now?
Sep
25
revised Is the last step of an iterated cryptographic hash still as resistant to preimage attacks as the original hash?
better title
Sep
25
comment Can a computationally unbounded adversary break any public-key encryption scheme?
I edited your question to look more like a question and less like a homework task. Feel free to edit it again to make it more clear.
Sep
25
revised Can a computationally unbounded adversary break any public-key encryption scheme?
better title, make the question more questiony and less look like a homework task.
Sep
25
revised Is the last step of an iterated cryptographic hash still as resistant to preimage attacks as the original hash?
formatting
Sep
24
revised Is there an effective way for public key generation in homomorphic encryption schemes?
fix the group elements and exponents' ranges
Sep
24
comment Webapp password storage: Salting a hash vs multiple hashes?
Salt is needed (and all of pbdkf2, bcrypt, scrypt use it), it is just not sufficient alone with a fast hash function. You might want to update the answer to reflect this.