1,437 reputation
620
bio website
location
age
visits member for 3 years, 3 months
seen 5 hours ago

Working in industry as a cryptography engineer.

To contact me, email paulgrub AT umail DOT iu DOT edu


17h
answered Is this a valid “fix” for deterministic encryption in encrypted databases?
2d
comment Books on cryptography mathematics
Ireland and Rosen is too high-level for a beginner. It talks about principal ideals of rings in the first chapter.
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
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.