| bio | website | paul-ebermann.tumblr.com |
|---|---|---|
| location | Berlin, Germany | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | yesterday | |
| 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:
- I created an github repository where I'll add interesting code created for responses here.
- I lastly created Javadoc for JSch - i.e. I read most of the code, thus I now also can answer some JSch-related questions.
- I now have a blog, too. This will feature interesting questions and answers from Stackoverflow (beside other topics).
- A link to my google profile for testing this "author" feature.
- I got a Job with StackOverflow Careers, and my company's technology department (where I work) has now its own website/blog.
|
May 17 |
revised |
When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible? formatting |
|
May 17 |
reviewed | Approve suggested edit on complexity tag wiki excerpt |
|
May 17 |
reviewed | Approve suggested edit on complexity tag wiki |
|
May 17 |
reviewed | Edit suggested edit on Polynomial multiplication and division in 2^128 |
|
May 17 |
revised |
Polynomial multiplication and division in 2^128 fixed formatting |
|
May 16 |
revised |
SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? math formatting |
|
May 16 |
revised |
Hill-cipher, disordered alphabet edited tags |
|
May 16 |
comment |
Generate fixed length cipher text from arbitrary length plaintext Welcome to Cryptography Stack Exchange. Do you want to be able to decrypt this again? Then it is impossible in general to have a shorter ciphertext than the plaintext. Otherwise this is not called encryption but a "hash" ... it is possible to build a hash function from AES, but not trivial to do so in a secure way. |
|
May 15 |
revised |
Generating IV in TLS 1.2 edited tags |
|
May 15 |
revised |
SHA-1: Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? edited tags |
|
May 15 |
revised |
SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? edited tags |
|
May 15 |
comment |
Encrypting a broadcast channel @RickyDemer I suppose you should have a MAC to the part encrypted with the session key (using the same session key or something derived from it). Then you either have a failed MAC (when using a wrong key) or the same ciphertext and key, and thus the same plaintext. Do you have a better scheme which allows more guarantees? |
|
May 15 |
comment |
Encrypting a broadcast channel I welcome alternative answers which elaborate on the notion of a broadcast encryption scheme. I didn't know the term until now, and just wrote the "solution" I knew about. (@Maeher and everyone else.) |
|
May 15 |
comment |
Is AES really used for Top Secret stuff? Welcome to cryptography Stack Exchange. I added some paragraph breaks to your answer to make it easier readable – feel free to edit again if this somehow destroyed the meaning. Do you have some ideas how a different implementation of the same algorithm, using the same key, could produce a more secure ciphertext? Or do you suppose there are more and less secure keys for AES? |
|
May 15 |
revised |
Is AES really used for Top Secret stuff? add some paragraph breaks |
|
May 15 |
revised |
Is AES really used for Top Secret stuff? typo, inline the links |
|
May 15 |
revised |
Generating IV in TLS 1.2 format the quotes as quote instead of code. |
|
May 15 |
comment |
How to decipher this morse-like code message? Welcome to cryptography Stack Exchange. The kind of question you have (i.e. "please decrypt this ciphertext") are not a good fit for our site, since there usually is no way to answer it. It certainly isn't a question where cryptographic knowledge helps to solve it. Therefore it was closed by several members of our community. |
|
May 15 |
comment |
Generating IV in TLS 1.2 If you need random numbers for cryptographic purposes, most likely a non-crypto Random class will not give good results. |
|
May 15 |
comment |
Generating IV in TLS 1.2 Welcome to Cryptography Stack Exchange. Did you measure that RandomNumberGenerator is too slow? Which mode of operation do you use? (They have different needs for an initialization vector.) |