Reputation
14,368
Next tag badge:
104/100 score
19/20 answers
Badges
3 38 77
Newest
 Enlightened
Impact
~367k people reached

May
1
revised PGP digital signature vs SHA256 HMAC Comparison
adding some paragraph breaks
Apr
25
revised SHACAL-2 vs. AES as underlying block cipher for Secure Hash (aka SHA-256)
edited tags
Apr
25
revised SHACAL in SHA-256
edited tags
Apr
25
comment SHACAL-2 vs. AES as underlying block cipher for Secure Hash (aka SHA-256)
Also, you would need to do the key-schedule for each block again, which also adds to the execution time.
Apr
21
awarded  Nice Answer
Apr
19
comment Why does applying 56-bit DES twice only give 57 bits of security?
@fgrieu I guess we could build the table with only one block of plaintext-ciphertext, and for each of the $2^{48}$ found matches check the second block. This would have work of $2^{57} + 2^{49}$, which I would still consider as 57-bit security.
Apr
15
comment Why is Diffie-Hellman considered in the context of public key cryptography?
@i486 Diffie-Hellman does not directly allow encryption, it is just a key-exchange algorithm (and usually the resulting key should be hashed before being used for anything). You could use that key as a "stream cipher" key stream (i.e. XOR it with a plaintext) and send the result as ciphertext, but then you are actually doing more than just DH.
Apr
12
comment Encryption in which ciphertext is bigger than plaintext?
In cipher designs one usually tries to avoid a (more than constant) increase of the ciphertext.
Apr
10
revised How to encrypt a vector $e\in Z^{m}$ using LWE
fix wikipedia link
Apr
4
comment Different implementations of SHA1, which one is correct?
@MaheshPujari This is not a crypto question – maybe ask it on Unix Stack Exchange. (For me, echo -n doesn't seem to remove any newline, it just doesn't append a new one.)
Apr
4
comment Asymmetric sign in public enviroment
@user2029276 Make sure to implement signing, not some kind of encryption. (And I would propose to use an existing crypto library instead of doing it yourself.)
Apr
3
comment Are there any valid, and person readable, checksums possible?
For the flame: You should not use MD5 at all, it is broken. Use a newer Hash function like SHA-2 or SHA-3 instead (maybe suitably truncated before encoding in a readable way).
Mar
31
comment Is it safe to encrypt random data using ECB mode?
@SAIPeregrinus could please you elaborate on your comment in form of a proper answer?
Mar
31
comment Is it safe to encrypt random data using ECB mode?
@ChaitanyaGupta could you put your additional information into the question (there is an "edit" link)?
Mar
19
comment Deciphering text encrypted with a changing cipher
It is not exactly CFB (for $k > 1$), as it doesn't really use blocks. But I guess the proof might be transferable (and might need a large enough $k$).
Mar
18
comment Composition of non-perfect encryption keys
Please note that composing encryption functions is usually not the same as doing some operation on their keys. Also, your meaning of key seems to be as a random variable (which has a distribution), where I would usually think of an individual key.
Mar
18
revised Composition of non-perfect encryption keys
formatting
Mar
18
comment MAC in SSH packet encryption, benefits to not including it?
It allows an attacker to modify your data. If you are an attacker, this would be an advantage ;-) (The MAC is not there for authentication of the other end, but to make sure that an attacker doesn't modify your data.)
Mar
17
comment What practical uses can random hash collisions be put to?
Could you detail how one would use this machine (as described in the question, it is actually a random-first-preimage-machine) to sign different jar files or similar non-random data? Or do you simply want to use the machine as a RNG?
Mar
15
comment Why does consecutive permutations or consecutive substitutions not enhance security?
@fgrieu I guess this could be meant to apply to unkeyed permutations/substitutions only?