9,834 reputation
12450
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 3 months
seen 10 hours ago

Nov
28
reviewed Approve suggested edit on hybrid tag wiki
Nov
28
reviewed Approve suggested edit on
Nov
28
reviewed Approve suggested edit on access-control tag wiki
Nov
28
reviewed Approve suggested edit on constants tag wiki excerpt
Nov
28
reviewed Approve suggested edit on access-control tag wiki excerpt
Nov
28
reviewed Approve suggested edit on md2 tag wiki
Nov
28
reviewed Approve suggested edit on constants tag wiki
Nov
28
reviewed Approve suggested edit on
Nov
28
comment Design requirements for a keyed hash function?
The hash function needs to collision resistant. The encryption is trickier. Authenticated encryption always works (but that's a bit of cheating). An unauthenticated stream cipher does not work. A raw blockcipher with same block size as the hash does work.
Nov
28
comment Design requirements for a keyed hash function?
Related question: Is the encryption of a hash a good MAC?
Nov
28
comment Convert a number to sha-1
Searching a fixed 44 bit space might actually be one of the rare situations where a rainbow table is useful.
Nov
28
comment TCR hash functions from MD5
MD5 being broken only means that an attacker can find collisions when its used without a key.
Nov
27
reviewed Approve suggested edit on The exact definition of a symmetric encryption
Nov
27
comment scrypt and bcrypt for benefits of both?
For bcrypt and PBKDF2 combining them with each having have the work factor wouldn't really matter. For scrypt it's different: If you're CPU and not memory bound (typical for server side hashing), doubling the time budget doubles the used memory as well, making it four times as hard to break. => scrypt benefits from being the only function you use
Nov
27
comment Reusing PGP key when generating SSL Certificate Authority?
The problem with that is that you need to analyze all protocols using a key checking them for interactions. So I recommend against reusing a key like that.
Nov
26
comment How can Shamir's method for secret sharing work in the GF(256)?
Yes, there is no GF(6) since you can't write it as p^n.
Nov
26
answered How can Shamir's method for secret sharing work in the GF(256)?
Nov
26
comment How can Shamir's method for secret sharing work in the GF(256)?
You can use any field. Prime order fields are nice because you can use standard modular arithmetic, whereas other fields are a bit tricky to understand. But fields exist for all prime powers p^n. The most common choices p=2 (binary fields like the 2^8 you're talking about) or n=1 (prime fields).
Nov
26
comment Is this new server API authentication protocol secure?
The shared key to allow account creation is fine. The big problem with your approach is that you rely on the secrecy of the shared key for everything. A good design only uses that shared key to ensure that only authorized clients can create an account and nothing more. Distributing the server's public key (or its finger print) isn't harder than distributing the application code or the shared key. But it has the huge advantage that it doesn't need to be confidential.
Nov
26
reviewed Approve suggested edit on Upper bound Linear Feedback Shift Register