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

Dec
2
awarded  Popular Question
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?
Dec
1
reviewed Reject SHA1 - SSL/TLS Cipher Suite
Nov
25
awarded  Tag Editor
Nov
25
revised searchable-encryption wiki excerpt
added 188 characters in body
Nov
25
revised Real life systems that use concepts of crypto computing
Added an example company
Nov
24
revised Is it possible to match encrypted documents using user-defined search terms?
edited tags
Nov
24
wiki created searchable-encryption excerpt
Nov
24
suggested approved edit on searchable-encryption tag wiki excerpt
Nov
18
revised Interactive assumptions not falsifiable?
edited tags
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.
Nov
9
reviewed Approve Need 32-bit mixing function that has perfect avalanche between octets
Nov
6
comment What is the most computationally efficient way of generating pseudo-random permutations?
In terms of the number of AES calls needed to encrypt a value, it would be more expensive. For your purposes the speed difference would probably not be significant, especially if you use AES-NI.
Nov
6
answered What is the most computationally efficient way of generating pseudo-random permutations?
Oct
31
comment RSA Decryption given n, e, and phi(n)
Well, do you understand how RSA encryption and decryption work?
Oct
31
revised RSA Decryption given n, e, and phi(n)
edited tags
Oct
30
awarded  Yearling