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

Security and Crypto Technologist


2d
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.
2d
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"
2d
asked practically verifying block ciphers strength
2d
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?
Aug
14
revised Luby-Rackoff theorem confusion
corrected
Aug
13
answered Luby-Rackoff theorem confusion
Aug
11
accepted Can we give access to controlled functionality in Fully homomorphic encryption schemes?
Aug
9
reviewed Approve suggested edit on Hardware Implementation of Pairing over BN curves
Aug
8
reviewed Approve suggested edit on Implementation and Testing of SRP-6a
Aug
6
comment How feasible is word-level frequency analysis over English (or any language)?
As you are encrypting words from documents, The probabilities of which words would appear together also could be leveraged in breaking this. Modern Language Translation techniques, Spam filter engines etc are based on finding the probabilities of next possible word in a sentence and things like that. So it should be possible to find out
Jul
28
awarded  Nice Question
Jul
24
revised Protocol composition
added reference
Jul
24
reviewed Approve suggested edit on Adding an IV to an AES implementation
Jul
24
asked Universal hashing techniques based on matrix multiplication
Jul
24
accepted How is this affine function a pair wise independent permutation?
Jul
24
comment How is this affine function a pair wise independent permutation?
oh ok got it ! i miss calculated the $2^n - 1 $ part for $F(B)$
Jul
23
comment How is this affine function a pair wise independent permutation?
isn't it the probability 1 / (( 2^n ) * (2^(n-1))) ?
Jul
22
reviewed Approve suggested edit on How do we compute IV+1 in CTR mode?