13,586 reputation
33272
bio website paul-ebermann.tumblr.com
location Berlin, Germany
age
visits member for 3 years, 5 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:


Jun
9
revised Familiar key signing over video call
moved the ' to the right formula.
Jun
9
answered Familiar key signing over video call
Jun
9
comment Are those RSA keys flawed?
Just to emphasize: Don't use these specific keys for anything now. If the private key was published, anyone could try it and break your cipher/signature.
Jun
2
revised Security of a security protocol for key exchange, using symmetric-key cryptography
formatting
Jun
1
revised How can I make a message into a blocks for NTRU?
edited tags
Jun
1
comment How can I make a message into a blocks for NTRU?
I suppose the responses to How can I use asymmetric encryption, such as RSA, to encrypt an arbitrary length of plaintext? apply here just as well.
May
31
reviewed Leave Open Reductionist proofs of decisional problems to computational
May
31
reviewed Approve Security of the iterated Hill Cipher
May
28
answered Integers in ECC
May
23
answered How does this SSL-related flaw work?
May
18
reviewed Approve software-obfuscation tag wiki
May
18
reviewed Approve tea tag wiki
May
12
comment Does the secret key used in AES have to prime?
Please note that RSA doesn't use prime keys, but (usually) semi-prime ones (which are a product of two primes).
May
10
comment How to decrypt a text which is ciphered same length key?
Welcome to Cryptography Stack Exchange. Your question is missing some details – which encrytion algorithm is in use? If it is some misused one-time-pad, look other questions with that tag.
May
4
answered Block cipher encryption of decryption with the same key
May
2
comment From Factorisation of semiprimes to breaching confidentiality
Please add some details to your question: What cryptosystem are you using?
May
2
revised From Factorisation of semiprimes to breaching confidentiality
formatting.
May
2
comment Generating the keys for the RSA cryptosystem in probabilistic polynomial time
Basically, there are a lot of primes available to choose from.
May
1
comment Can XEX or XTS modes be used with only one tweak?
It would also be quite slower than original XEX, because you need two encryptions for each block, instead of one per block + one per sector.
Apr
29
awarded  Nice Answer