Reputation
2,433
Top tag
Next privilege 3,500 Rep.
Protect questions
Badges
10 25
Newest
 Yearling
Impact
~28k people reached

May
20
comment Would this method deliver a perfectly non-malleable encryption for at least two blocks?
@Anon2000, First, as Steven says, you probably should be looking for a MAC. But if you're really after non-malleable encryption, then what you want is a wide-block cipher, such as EME or the more recent AEZ with a zero-bit tag and zero-bit nonce (web.cs.ucdavis.edu/~rogaway/aez).
May
12
reviewed Close where should private and public keys be stored?
May
3
comment Format preserving encryption FFX
@MaartenBodewes Yes. I edited my answer to expand the acronym out.
May
3
revised Format preserving encryption FFX
expanded TPRP acronym
May
2
revised Format preserving encryption FFX
Typo fixes
May
2
answered Format preserving encryption FFX
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
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