1,494 reputation
1720
bio website
location Bangalore, India
age 32
visits member for 2 years, 11 months
seen 38 mins ago

Security and Crypto Technologist


1d
asked Partial Homomorphic Schemes with padding
1d
comment breaking fully homomorphic encryption schemes
will the cipher text probabilistic in general ?
Sep
11
comment Feistel cipher vs Substitution-permutation network - number of rounds
for feistel networks check "patarin's proof" , 7 rounds is what he proved to be good enough. i dont know about SPN
Sep
10
accepted Is this correct way to generate stream cipher using AES CTR mode?
Sep
10
accepted How to prove Security of Onion Layers of encryption?
Sep
10
answered How to prove Security of Onion Layers of encryption?
Sep
9
accepted breaking fully homomorphic encryption schemes
Sep
9
comment breaking fully homomorphic encryption schemes
Oh yeah , i missed this key insight that the result is also cipher text.
Sep
9
asked breaking fully homomorphic encryption schemes
Sep
9
comment “Practical” operations supported by functional encryption?
It sounded as if , Homorphic supports only those two operations. But they are the building blocks to support any other complex operations.
Sep
7
revised How to prove Security of Onion Layers of encryption?
added 55 characters in body; edited tags
Sep
6
revised How to prove Security of Onion Layers of encryption?
added 3 characters in body
Sep
6
asked How to prove Security of Onion Layers of encryption?
Sep
4
asked Is this correct way to generate stream cipher using AES CTR mode?
Aug
30
comment practically verifying block ciphers strength
yes the tools could be lot generic. Am imagining, machine learning based say "supervised learning" based techniques to identify non-randomness after some number of rounds etc.
Aug
30
comment practically verifying block ciphers strength
it is a encryption scheme not mode, shall correct it thanks ! BTW , curious what those tools are for analyzing "modes"
Aug
29
asked practically verifying block ciphers strength
Aug
29
comment Homomorphic Encryption: how does the equality test on ciphertexts work?
@ChrisPeikert if encryption is randomized, i doubt if homomorphic properties are retained. For example RSA is multiplicative homomorphic only when padding is not used rite ? is there a catch some where am missing ?
Aug
25
comment Found a way to crack AES-128, what now?
u could have verified your solution by asking here :)
Aug
20
reviewed Approve suggested edit on Do I need to prepare plain text before encryption?