13,267 reputation
32867
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 3 years, 1 month
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
23
revised Webapp password storage: Salting a hash vs multiple hashes?
hash tag, text cleanup
Sep
23
revised Webapp password storage: Salting a hash vs multiple hashes?
edited tags
Sep
23
revised Necessity of Randomness of Salts?
edited tags
Sep
23
revised Is modern encryption needlessly complicated?
edited tags
Sep
23
revised What is the use of REAL random number generators in cryptography?
edited tags
Sep
23
comment New PRG from old
I suppose the formal proof depends on your definition of PRG, but your intuition looks right.
Sep
23
revised How long does it take to crack DES and AES?
remove FLOP mentions
Sep
23
revised How long does it take to crack DES and AES?
remove "floating point", formatting, boilerplate
Sep
23
reviewed Approve suggested edit on New PRG from old
Sep
22
revised What is the use of REAL random number generators in cryptography?
add some clarification/disclaimer
Sep
21
revised How to attack a classical cipher using known partial plaintext?
add ciphertext from comment
Sep
20
comment Designing a key expander out of ciphers
Hmm, a simple way would be to split the key in $n$ parts (e.g. the original key would have length $\sum k_n$), and use each part in one cipher. Not sure if this counts :-)
Sep
20
answered Changing algorithms during encryption
Sep
20
comment Accelerating SHA-1
Tree hashing is the way to go if you have large amounts of data and multiple cores available.
Sep
20
revised Why use an Initialization Vector (IV)?
edited tags
Sep
20
comment Accelerating SHA-1
Do you have a given protocol to implement, or can you change the protocol to make it faster (i.e. better parallelizable)?
Sep
20
answered What is the use of REAL random number generators in cryptography?
Sep
19
revised What is the best method to determine the language used in a monoalphabetic substitution cipher?
edited tags
Sep
19
comment Implementation of Tao Xie and Denguo Feng's MD5 attack
This might provide some base for answers: mathstat.dal.ca/~selinger/md5collision
Sep
18
revised Is it feasible to build a stream cipher from a cryptographic hash function?
shorter title (and cipher instead of cypher)