meta user
network profile
| bio | website | github.com/CodesInChaos |
|---|---|---|
| location | Munich, Germany | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 7 hours ago | |
| stats | profile views | 109 |
- Jabber/XMPP: CodeInChaos@jabber.ccc.de
- IRC: CodesInChaos on freenode
- Email: My nick on gmail
- Blog: codesinchaos.wordpress.com
- GitHub: github.com/CodesInChaos
- Google+
- Twitter @CodesInChaos
|
Oct 28 |
revised |
Why is an Encrypt-and-MAC scheme with deterministic MAC not IND-CPA secure? deleted 16 characters in body; edited title |
|
Oct 27 |
revised |
Why do we need in RSA the modulus to be product of 2 primes? added 2 characters in body |
|
Oct 27 |
revised |
Why do we need in RSA the modulus to be product of 2 primes? added 297 characters in body |
|
Oct 27 |
revised |
Why do we need in RSA the modulus to be product of 2 primes? added 297 characters in body |
|
Oct 27 |
revised |
Why do we need in RSA the modulus to be product of 2 primes? deleted 75 characters in body |
|
Oct 27 |
answered | Why do we need in RSA the modulus to be product of 2 primes? |
|
Oct 27 |
reviewed | Approve suggested edit on Subgroups generators with respect to group generators of composite order |
|
Oct 26 |
comment |
How weak/strong is this hand cipher? (updated) The attack does not require any key guessing. The key is simply the ciphertext of the previous block. Any data after 3*n chars where n is the length of each key can be trivially decrypted without knowing any of the keys. |
|
Oct 26 |
comment |
How weak/strong is this hand cipher? (updated) The attack from before still works, except you need to run it three times. |
|
Oct 26 |
revised |
How weak/strong is this hand cipher? (updated) added 211 characters in body |
|
Oct 24 |
comment |
Constructing secure key exchange protocol CurveCP is a protocol with properties similar to TLS, but that uses only DH-Keyexchange and authenticated symmetric encryption. |
|
Oct 24 |
reviewed | Reject suggested edit on A discrete-log-like problem, with matrices: given $A^k x$, find $k$ |
|
Oct 23 |
comment |
Ways to protect flash player against MITM diffie hellman It's also possible to use two DH exchanges. One for authentication including the server's long term key and one with ephemeral keys for confidentiality. That way you get authentication and forward secrecy. |
|
Oct 23 |
reviewed | Approve suggested edit on Because the algorithm is known, it is no longer a trade secret |
|
Oct 22 |
comment |
How weak/strong is this hand cipher? (updated) See 1. What is the most secure hand cipher? 2. Is there a secure cryptosystem that can be performed mentally? |
|
Oct 22 |
comment |
How weak/strong is this hand cipher? (updated) 1. An unknown block-size doesn't help much either. The attacker simply tries different block-sizes until one fits. 2. The standard assumption in cryptography is that the algorithm is public, and only the key is secret. It's hard to say how much security is gained by hiding the algorithm, so we simply assume that no security is gained. 3. Zig-zag and other obfuscations don't increase security. The attacker can simply undo the transformation, since its unkeyed. |
|
Oct 22 |
revised |
How weak/strong is this hand cipher? (updated) added 183 characters in body |
|
Oct 22 |
revised |
How weak/strong is this hand cipher? (updated) added 63 characters in body; edited title |
|
Oct 22 |
comment |
Why does Skein use an output transform, but other similar hashes don't? Your arguments are not convincing to me. The last paragraph only applies to output sizes larger than the natural output size. You don't explain why truncation requires an output transform. I'm pretty sure it doesn't. Skein's extra features and the use of an output transform for short outputs are orthogonal, as far as I can see. |
|
Oct 22 |
revised |
How weak/strong is this hand cipher? (updated) added 2 characters in body |
