1,366 reputation
518
bio website
location
age
visits member for 2 years, 11 months
seen 18 hours ago

Working in industry as a cryptography engineer.

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


1d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
I seriously doubt Voltage's patent covers as much as they say it does. Anyway, for small blocks you could use any of the FPE schemes based on oblivious card shuffles, e.g. the Thorp shuffle.
2d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
Also, to the OP: There are plenty of other schemes which achieve FPE that are not patented. Look (for example) at the BPS mode of operation, the spec of which is on the NIST modes development page.
2d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
Please, for the love of god do not make custom modifications to AES when there are other solutions that could work perfectly fine.
Oct
17
comment Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312
Well, I'd start by reviewing the definition of perfect secrecy.
Oct
14
answered Is it true the longer the key length is the more secure the encryption?
Oct
14
comment how does the order-preserving encryption scheme distribute the buckets?
Are you sure we're talking about the same paper? You might be thinking of the earlier paper by Agrawal et al.
Oct
13
comment how does the order-preserving encryption scheme distribute the buckets?
Which density function?
Oct
10
comment how does the order-preserving encryption scheme distribute the buckets?
Which order-preserving encryption scheme in particular are you interested in?
Oct
8
reviewed Approve suggested edit on How exactly does AES-NI work?
Oct
8
answered How exactly does AES-NI work?
Oct
8
comment How costly is to find millions of large prime numbers for RSA?
OP: Are you implementing a Honey Encryption scheme for RSA secret keys?
Oct
1
reviewed Approve suggested edit on Is deniable error-correction possible?
Sep
30
comment Bridging the gap between security proofs and “real-world” security
Hmm... you might be right. I wouldn't be offended if people voted to close; this was just on my mind and I wanted to solicit input from the community.
Sep
30
comment Bridging the gap between security proofs and “real-world” security
I guess a salient example of this is encryption that preserves some functionality of the plaintext in the ciphertexts. Most good schemes in this area provide a proof of security based on a constructed model of the ideal functionality. How do we reason about the relevance of that model to a real deployed implementation of the scheme?
Sep
29
asked Bridging the gap between security proofs and “real-world” security
Sep
24
awarded  Autobiographer
Sep
24
comment what is the difference between IBE and ABE schemes
This sounds like a homework question. Is it?
Sep
24
comment reducing false positives in searchable encryption
Actually I'm not sure, come to think of it.
Sep
23
comment reducing false positives in searchable encryption
D.W. is (i think) his handle here.
Sep
22
comment Checking the share membership in secret sharing schemes
I suspect this kind of distinguishing ability would break the information-theoretic security of the Shamir scheme, but I'm not sure.