| bio | website | github.com/CodesInChaos |
|---|---|---|
| location | Munich, Germany | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 4 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
|
Apr 21 |
revised |
How is CipherCloud doing homomorphic encryption? added 213 characters in body |
|
Apr 21 |
revised |
How is CipherCloud doing homomorphic encryption? added 1788 characters in body |
|
Apr 21 |
revised |
How is CipherCloud doing homomorphic encryption? added 10 characters in body |
|
Apr 21 |
revised |
How is CipherCloud doing homomorphic encryption? added 378 characters in body |
|
Apr 21 |
revised |
How is CipherCloud doing homomorphic encryption? added 6409 characters in body |
|
Apr 21 |
awarded | Enlightened |
|
Apr 21 |
awarded | Nice Answer |
|
Apr 20 |
comment |
A lower bound on the insecurity of CipherCloud? They claim that their encryption is not deterministic and defeats frequency analysis. Which is a really weird claim and doesn't fit the encryption shown in Sid's screenshot. |
|
Apr 17 |
comment |
Why is $h(H, m) = E(m, H) \oplus m$ insecure? What exactly is the definition of $H$ and $E$? I guess $H$ is the IV or chaining value, and $E$ some form of encryption, but which? In particular which parameter is the key, and which the message? And is it AES, a PRP, or an ideal blockcipher? |
|
Apr 16 |
comment |
Is it safe to assume Salsa20 to be a PRP? Salsa20 takes 16 constant bytes for a reason. While it's build from a permutation, that permutation has some limitations and it has no key. |
|
Apr 16 |
comment |
Is it safe to assume Salsa20 to be a PRP? The random function is produced by xoring a permutation with with its input, similar to the way block ciphers are turned into hashes. |
|
Apr 14 |
comment |
How to use salt if I am sending hashed password? @IvanP 1. If you want to avoid username probing, you can return HMAC(FakeSaltKey, username). A random value isn't possible since for real users the salt will not change often. 3. There is only a single stored value Hash(SaltedHash(salt, password)). |
|
Apr 14 |
comment |
Comprehension question on a signature protocol based on the RSA assumption How about linking the paper? |
|
Apr 14 |
answered | How to use salt if I am sending hashed password? |
|
Apr 13 |
comment |
Is there an existing AEAD scheme with minimal IV requirements? You can in principle describe AES-CBC with encrypted IV + an IV-less MAC (CBC-MAC or HMAC) as an AEAD. I think it'd fulfill your requirements. |
|
Apr 12 |
comment |
Pseudo Random Generator (PRG) from Rabin function Looks like I'll need to look up the details of how to compute the order again. I thought $x^{\lambda(n)}=x \pmod n$ holds. |
|
Apr 12 |
revised |
Pseudo Random Generator (PRG) from Rabin function added 328 characters in body |
|
Apr 12 |
revised |
Pseudo Random Generator (PRG) from Rabin function added 328 characters in body |
|
Apr 12 |
comment |
Pseudo Random Generator (PRG) from Rabin function A better choice of modulus. The product of two large primes (say 512 bits each) should do the job. |
|
Apr 12 |
answered | Pseudo Random Generator (PRG) from Rabin function |