Paŭlo Ebermann

9,710 reputation

21743

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.

	9,710 reputation	bio	website	paul-ebermann.tumblr.com	visits	member for	1 year, 10 months
21743 badges		location	Berlin, Germany		seen	yesterday

summary answers questions tags badges favorites bounties reputation activity

2,284 Actions

suggestions reviews revisions comments badges posts accepts all

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)
Sep 18	revised	Is it feasible to build a stream cipher from a cryptographic hash function? formatting the formulas using TeX
Sep 18	revised	Converting a stream cipher into a block cipher add description of these ciphers (from the linked answer)
Sep 18	revised	Is it feasible to build a stream cipher from a cryptographic hash function? formatting the formulas using TeX
Sep 18	answered	Converting a stream cipher into a block cipher
Sep 18	revised	How to forge Schnorr signatures if you can guess the challenge formatting
Sep 17	revised	What causes first block of AES decryption to be garbled, even with correct IV? formatting the quote as such, adding link, some minor formatting
Sep 16	comment	Understanding CRC A CRC-32 is a (linear) mapping from $\mathbb Z_2^*$ to $\mathbb Z_2^{32}$, not an operation in $\mathbb Z_2^{32}$, or am I understanding this wrong?
Sep 15	revised	Background for modular arithmetic function formatting, citing the source more exactly
Sep 15	revised	Background for modular arithmetic function TeX formatting
Sep 15	reviewed	Approve suggested edit on Background for modular arithmetic function
Sep 15	comment	Analysis of Repeatedly Enciphered Plaintext using Same Algorithm / Key A clearer way to write your third sentence would be the probability to reach the original plain text after at most* r repeated encryptions is r/2^128*.
Sep 14	comment	Could one construct a cipher that is secure for friendly parties to use but insecure for hostile parties? Your "modern day one time pad" is not an one-time pad, and the perfect security proof of an one time pad is not valid for such a cipher. (There is nothing wrong in using such a cipher, but don't call it one time pad.) But if you want to discuss this further, we should do it in chat (or open a separate question).
Sep 13	comment	Could one construct a cipher that is secure for friendly parties to use but insecure for hostile parties? But actually, the main point of my comment was not the notation misuse, but that your answer answers "how would one use cryptography in war time?" and not "how could a crypto system that is secure for me but not for the enemy look like?"
Sep 13	comment	Could one construct a cipher that is secure for friendly parties to use but insecure for hostile parties? A one time pad uses a random key of the same size as the message, and never reuses the same key. A stream cipher generates a key stream from a (relatively) small key (and maybe other data, like an initialization vector). Such a key can be reused (if the cipher is any good). Your high speed (Gbit·Hz) stream cipher most likely is not an one-time pad (you would have to distribute Gigabytes of random data otherwise).
Sep 13	revised	Encrypting small values with RSA private key inlining the links
Sep 12	revised	How is the MJH double-block-length hash function constructed? add more images