9,710 reputation
21743
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 1 year, 10 months
seen 11 hours ago
stats profile views 210

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:


Aug
15
revised How does the index of coincidence work in the Kasiki test?
better title, mention book (from comment), some grammar fixes
Aug
14
revised Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
better title
Aug
13
comment Why can't one implement bcrypt in Cuda?
So a special purpose hardware implementation with its own 4 KB of (fast) memory per core would be good for bcrypt, wouldn't it? (Not for scrypt, of course.)
Aug
13
revised Why can't one implement bcrypt in Cuda?
better title, spelling/grammar, formatting
Aug
12
revised What is the relation between RSA & Fermat's little theorem?
some minor additions/corrections
Aug
11
revised What is entropy?
typo (?)
Aug
11
awarded  Convention
Aug
11
awarded  Nice Answer
Aug
11
revised How should I calculate the entropy of a password?
spelling
Aug
11
comment Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
@Michael: The Skein standard makes the output length quite independent from the state size. There is even a configuration option for the output length. (This makes sure the output for 512 bit output is something else than truncated 1024-bit output.)
Aug
11
comment How should I store passwords that need to be available in plain text?
You still have to trust them (or more exactly: their JavaScript) that it does not transfer your password to them, too.
Aug
10
comment Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
@Michael: Sorry, it was more a comment which got too long. I added some theoretic considerations about collision resistance.
Aug
10
comment Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
Skein's tree hash mode tries to avoid this problem by using different tweaks for the individual blocks, so a block has a different hash depending on where it is located in the tree. Good point, I didn't note this before. (I just wish I could upvote this again.)
Aug
10
comment How can I improve a password generation scheme based on a shared secret and URL?
This is a nice clarification why you shouldn't do this, but the alternative protocol given here does not really fit the usecase of the original poster - he wanted to generate multiple hard passwords to login to several sites, and have to memorize only one password.
Aug
10
revised How can I improve a password generation scheme based on a shared secret and URL?
fix tags
Aug
10
comment How can I improve a password generation scheme based on a shared secret and URL?
The website speaks of 2.3 GSHA1/s (if that is a unit) for ATI HD 5970. Huh.
Aug
10
revised Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
again mixed bits and bytes.
Aug
10
comment Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
Just for reference: This originated at Stack Overflow, and was then cross-posted here.
Aug
10
revised Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
some theoretical thoughts
Aug
10
revised Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
add some more about "is this less secure?"