Reputation
2,248
Top tag
Next privilege 3,500 Rep.
Protect questions
Badges
9 24
Newest
 Custodian
Impact
~23k people reached

Apr
3
reviewed Close Decrypt files with original file CTB-Locker
Apr
3
comment Required key size for an ideal cipher with a 32 bit block size
I suspect this is a homework question aimed at establishing why we can't construct an ideal cipher for even modest block sizes. asdfhjk: For a cipher to be ideal, you need one key for each possible permutation. So how many strings are in the set {0, 1}^32? How many permutations are there on a set of this size?
Mar
31
awarded  Custodian
Mar
31
reviewed No Action Needed What happens when a RC4 stream gets corrupted?
Mar
31
reviewed No Action Needed What can cause similar MD5 hashes
Mar
31
reviewed No Action Needed What can cause similar MD5 hashes
Mar
31
reviewed No Action Needed Is it possible to match encrypted documents using user-defined search terms?
Mar
31
reviewed No Action Needed Searching over encrypted data
Mar
31
awarded  Citizen Patrol
Mar
24
reviewed Satisfactory Additional Data in AEAD (Chacha20-poly1305 libsodium)
Mar
24
reviewed Satisfactory Why are some $x$ coordinates unsuitable for an ECDSA generator point?
Mar
16
reviewed Reviewed decrypt a saml 2.0 response having aes 128 and rsa
Mar
14
revised What is the benefit of applying the tweak a second time using XTS?
added 206 characters in body
Mar
14
answered What is the benefit of applying the tweak a second time using XTS?
Mar
13
comment Block cipher mode with diffusion on ciphertext
You might want to look into OCB. It provides verification in a "strong" sense (i.e., AEAD) with performance not too far off from CTR mode. See web.cs.ucdavis.edu/~rogaway/ocb/news for a portable optimized implementation and web.cs.ucdavis.edu/~rogaway/ocb/license.htm for license info (free in almost all cases).
Mar
1
awarded  Informed
Feb
17
reviewed Close Crack RSA with additional information
Feb
17
reviewed Close How to store and use a Cryptographic Seed in a database
Feb
15
reviewed Close Requirement for the exponent generation during DH protocol
Feb
13
comment Is Pseudo-Random Generator (PRG) in OpenSSL uniformly distributed?
"Cryptographically Secure, which means it passes statistical tests". To be clear (and I don't mean to imply Security Aficionado is unaware of this issue), Cryptographic security requires much more than that. Standard statistical tests are quick and dirty, and look for very generic types of "non-randomness"; cryptographic security requires outputs to be indistinguishable from random even against computationally intensive tests that are targeted specifically at the algorithm in question.