Reputation
12,018
Next tag badge:
89/100 score
20/20 answers
Badges
1 29 60
Newest
 Revival
Impact
~199k people reached

15h
comment What is the difference between a PRF and a PRF+?
Looks identical to HKDF-Expand.
15h
revised Inner product with homomorphic encryption
added 105 characters in body
1d
comment Standards to be a good cipher
Only trust a cipher if enough cryptographers tell you it's good. Winning a NIST competition (AES/Rijdnael or SHA-3/Keccac) or at least being among the finalists is a good sign.
1d
reviewed Close In what cases will RSA not work?
1d
comment Can I reduce the MAC size in TLS?
If you want short MACs, use HMAC. GHash is quite fragile when used with short MACs, I certainly wouldn't go below 80 bits with GHash.
2d
comment How to choose McEliece's parameters?
The paper Daniel J. Bernstein, Tung Chou, and Peter Schwabe: McBits: fast constant-time code-based cryptography lists a bunch of parameterizations as well. Since the paper is from 2013, the security estimates should take the attacks you mentioned into account.
2d
comment space complexity of quantum collision search
Related paper Daniel J. Bernstein. "Cost analysis of hash collisions: Will quantum computers make SHARCS obsolete?" Workshop Record of SHARCS'09: Special-purpose Hardware for Attacking Cryptographic Systems.
2d
comment Increasing the diffusion of the AES-CBC encryption algorithm in pycrypto for python
SIV mode might be interesting for you.
2d
comment What informal indicators exist for estimating the computational infeasibility of cryptographic problems?
Interesting essay: Boaz Barak - Structure vs. Combinatorics in Computational Complexity
2d
comment What informal indicators exist for estimating the computational infeasibility of cryptographic problems?
Related question How can we reason about the cryptographic capabilities of code-breaking agencies like the NSA or GCHQ?
2d
revised What is SRP-Z from?
deleted 6 characters in body; edited tags
2d
comment What are the advantages of using OFB (Output Feedback Mode)?
Could you add a reference for CTR having better security bounds?
2d
reviewed Reviewed rngtest results interpretation
2d
reviewed Approve What are the advantages of using OFB (Output Feedback Mode)?
Jul
4
comment What are the advantages of using OFB (Output Feedback Mode)?
CBC and CFB decryption are parallelizable, so the speed advantage of CTR should only apply to encryption, not decryption.
Jul
4
comment Logjam-style attack on Factoring?
There is an technique called Batch NFS but I don't know about the details.
Jul
4
comment Parallel authentication of encrypted data. What AE type to choose?
If you have large files, why don't you split the file into chunks and encrypt these independently? That has the added advantage that you don't need to decrypt terabytes of data, only to throw them away at the end if the MAC doesn't validate.
Jul
3
comment Does XTS provide random write access?
@elisae__ The attacker learns which blocks (at the same position) changed between versions. If blocks consist a single bit (xor based streamciphers, including CTR mode), they learn which bits are identical, which is often enough to recover the message. If you use AES-XTS they learn which 16 byte blocks are identical. If you use some kind of wide block cipher construction to get 4096 byte blocks, they only learn if such a large block changed. But since you need to rewrite a whole block at once, larger blocks limit random access operations.
Jul
3
revised Does XTS provide random write access?
added 307 characters in body
Jul
3
comment Can passwords be stored securely so that a similarity comparison can be made?
But it doesn't prevent somebody from alternating between two dissimilar passwords.