9,791 reputation
12449
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 2 months
seen 1 hour ago

Nov
14
reviewed Approve suggested edit on Proof of the standard pseudorandom generator + XOR encryption scheme in Goldreich
Nov
13
comment Has threefish successfully been attacked (practically or theoretically)?
Only reduced round versions. See SHA-3 Zoo - Skein for an overview.
Nov
13
comment Why routers don't just use Diffie-Hellman protocol?
Only way to fix MitM is to know the public key of your communication partner. Encryption to the router is pretty useless as well, since there is no reason to believe that the router is trustworthy. We need end-to-end encryption. No way around that.
Nov
13
reviewed Approve suggested edit on SHA-1 Keyed Hash Function
Nov
13
reviewed Approve suggested edit on Is there a proof for showing any cryptogram is crackable?
Nov
13
reviewed Approve suggested edit on modfied man in the middle attack diffie hellman
Nov
13
comment Is there a proof for showing any cryptogram is crackable?
With the one-time-pad there is no difference between "apply all possible possible keys to the ciphertext" and "guess all possible messages without looking at the ciphertext". There are just as many keys as there are possible messages.
Nov
13
comment Is there a proof for showing any cryptogram is crackable?
@evening That's no better than simply generating a random message and checking if it's English without even looking at the ciphertext. There is no relation between the possible decryptions and the original message.
Nov
13
comment Is there a proof for showing any cryptogram is crackable?
@evening When you try all possible keys you get back all possible messages. Nothing gained. The point of a one-time-pad is that for any message with the same length as the ciphertext there is exactly one key that decrypts the ciphertext to that message. So an attacker doesn't learn anything about the real message, no matter how much computing power they have.
Nov
13
comment How can we get CA's public key?
CA public keys are shipped with OS or applications like browsers.
Nov
13
revised Is there a proof for showing any cryptogram is crackable?
deleted 18 characters in body
Nov
13
revised Is there a proof for showing any cryptogram is crackable?
deleted 18 characters in body
Nov
13
revised Is there a proof for showing any cryptogram is crackable?
added 1 characters in body
Nov
13
answered Is there a proof for showing any cryptogram is crackable?
Nov
12
reviewed Approve suggested edit on What is wrong with AES-CTR-HMAC-SHA256 - or why is it not in TLS?
Nov
12
reviewed Edit suggested edit on Explicit Key SHA-1
Nov
12
revised Explicit Key SHA-1
some minor spelling/formatting. Second question isn't clear english, but didn't understand well enough to correct
Nov
12
reviewed Approve suggested edit on Ideal system for an encryption scheme
Nov
12
reviewed Approve suggested edit on Can you explain partial private key extract algorithm in certificateless Public key cryptography?
Nov
12
comment MD5 theoretical question
There is a difference between collisions existing and actually being able to find them.