1,608 reputation
1921
bio website
location Bangalore, India
age 32
visits member for 3 years
seen 4 hours ago

Security and Crypto Technologist


2d
comment Recover plaintext from truncated ciphertext using AES for FPE
Why are you decrypting using AES ? AES_decrypt is never needed ! may be that is the reason you are not able to recover, share the code on pastebin.com or so , its easier that way for us to tell
2d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
Feistel networks with AES as PRF is the popular and well studied approach for Format Preserving
2d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
am curious which PRF should be used ? What would be the impact on security and performance. doing the above.
2d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
@pg1989 Voltage claims patents on BPS mode too , check this link voltage.com/technology/patents-research
2d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
@Tim, To best of our knowledge there aren't any standards apart from NIST's FFX modes which are patented. Yes we did analyze FastPRP, these techniques work on very tiny spaces less than 16 bits , they tend to be expensive for 32 bits and above although we dont have bench marked results
Oct
9
comment Is .NET DESCryptoServiceProvider secure in this case?
Would suggest, you spend some more time on various modes. and find out which suits your application
Oct
8
comment Does this guarantee a unique 32 bit Hash?
@otus 20934 is the minimum i could get for MD5 , for SHA-256 it was more than 70k, just pull the code in any IDE eclipse or intellij and run it even on CLI .
Oct
8
comment Does this guarantee a unique 32 bit Hash?
@otus hardly few nano seconds may be . the program quickly exits. Even if i remove the "Hello" part. you can try it yourself its easy
Oct
8
comment Does this guarantee a unique 32 bit Hash?
@mikeazo not sure if you have noticed, it is not for entire MD5 but the tweaked version mentioned above, code is here pastebin.com/fZ1LR9as
Oct
7
comment Does this guarantee a unique 32 bit Hash?
i have written a bruteforce approach for MD5 in java for the above and i get collisions much sooner than 65536 limit which is 2^16. with SHA-256 am not getting the same
Oct
1
comment Why are we not using multiple ciphers per message?
@RickyDemer what does this mean ? "don't get ruled out"
Sep
25
comment What is Attribute Based Encryption?
@DrLecter , the paper , "Building Encrypted and Searchable log" has two schemes, the first one, i would say is symmetric ABE
Sep
23
comment reducing false positives in searchable encryption
what is his id ?
Sep
23
comment Is it possible to find out whether a number is greater than another number without knowing the numbers?
use orderpreserving encryption ?
Sep
22
comment Forward pseudorandom permutation
it is not clear what you want to achieve. what is the actual problem ?
Sep
22
comment Checking the share membership in secret sharing schemes
@GuutBoy, yes am considering the setting you described
Sep
22
comment Checking the share membership in secret sharing schemes
$P_i$ knows the secret and t,n parameters also.
Sep
22
comment Checking the share membership in secret sharing schemes
@pg1989 the distinguishing ability may break some security if other parameters like $t,n$ are not made available etc. here we are only speeding up the process of identifying the membership
Sep
22
comment Understanding Pseudo Random Generators
Check this video , good introduction with visualization usenix.org/conference/woot14/technical-sessions/presentation/…
Sep
20
comment What is Attribute Based Encryption?
@DrLecter can u point me to the "recursive secret sharing" schemes you were saying above ?