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

8h
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.
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
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
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
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.
Dec
2
comment Using the same symmetric key in both directions?
This is verifiably false. Per-direction symmetric keys prevent replay attacks.
Dec
1
comment Verifying DER encoded DSA/ECDSA signature with extra content?
Well, what does the RFC say?
Nov
14
comment As a cryptographer, what are the things I should care about in my implementation of pairing functions?
In my opinion the question is too open-ended. You should ask specific questions about specific aspects of pairing implementations. Also pairings are a new and complex primitive that are still pretty niche. Also, you could ask the author of PBC this in an email.
Nov
10
comment What is the most computationally efficient way of generating pseudo-random permutations?
FFX and the oblivious card shuffles have identical use cases. They are both used in the same way to efficiently generate PRPs for arbitrary sets.
Nov
9
comment As a cryptographer, what are the things I should care about in my implementation of pairing functions?
On number 2, can you give a citation? I know there has been work that broke the DL problem for finite fields of small characteristic, but that work doesn't apply to ECDLP.