Reputation
1,490
Top tag
Next privilege 1,500 Rep.
Approve tag wiki edits
Badges
6 21
Impact
~25k people reached

Aug
28
comment Is there any equivalent to the apache xml security library for JSON?
Not even close to on-topic for this site. Try IT security or Programmers stack exchange.
Aug
15
answered Validate per round rather than cycle-walking in FPE
Jul
14
comment how to implement order preserving encryption except cryptdb
crypto.stackexchange.com/questions/3813/…
Jul
9
comment SPI security of FE1 scheme
Yes, of course. You and I both know that, but I thought the more generic statement would confuse the OP.
Jul
8
answered SPI security of FE1 scheme
Jul
8
comment SPI security of FE1 scheme
Write in your question what all that notation means - you can't expect everybody to read the entire paper.
Jun
13
comment Join Datasets While Protecting Anonymity
What about differential privacy?
May
5
comment Defining format-preserving encryption for natural language
You could use format-preserving encryption along with a word dictionary to create a permutation over all possible words in your given natural language.
Apr
30
comment Integer encryption preserving equality
Stream ciphers don't expand the ciphertext, but you have to store the nonce so that you can decrypt, which means a stream cipher can't be format-preserving.
Mar
30
awarded  Popular Question
Mar
27
comment Can machine learning analyze random number generator?
You can transform a block cipher in CTR mode into a RNG using NIST's CTR_DRBG, I'm pretty sure.
Mar
9
comment Is there a format preserving cryptographically secure hash?
You could maybe derive the FPE key from a SHA256 of the plaintext... Just spitballing here, but that might work.
Mar
2
comment Is format preserving encryption suitable for use with words or names?
Interestingly, this technique can be extended to build permutations over regular languages and context-free grammars: link
Mar
2
comment Is format preserving encryption suitable for use with words or names?
Exactly. The formal name for this construction is rank-then-encipher, and was first treated in Bellare et al.'s paper on the subject: link
Feb
20
reviewed Reject Is AES-256 weaker than 192 and 128 bit versions?
Jan
28
answered Is this a valid “fix” for deterministic encryption in encrypted databases?
Jan
22
comment Diffie-Hellman on infinite groups
Just spitballing here, but part of the problem might be that sampling uniformly from an infinite set can't be done easily.
Jan
2
comment Are there cryptographic hash functions which do not have any collisions?
Not unless its range is larger than or equal to its domain. Collisions are inevitable in all other cases because of the pigeonhole principle.
Dec
8
comment Looking For Additively Homomorphic Encryption
Why can't you use hidden group order?
Dec
3
comment What cipher algorithm is this routine using?
This question appears to be off-topic because it is about a specific software implementation of cryptography.