1,416 reputation
618
bio website
location
age
visits member for 3 years
seen 6 hours ago

Working in industry as a cryptography engineer.

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


Nov
18
revised Interactive assumptions not falsifiable?
edited tags
Nov
18
comment Java RSA/ECB/PKCS1Padding encryption with .NET
This question appears to be off-topic because it is about a specific cryptography library.
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 suggested edit on 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
Oct
29
comment What are SNARKs?
eprint.iacr.org/2013/879 The citations from this should get you started.
Oct
23
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.
Oct
23
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.
Oct
23
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
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?