1,688 reputation
1921
bio website
location Bangalore, India
age 32
visits member for 3 years, 5 months
seen 10 hours ago

Security and Crypto Technologist


Mar
26
comment Can machine learning analyze random number generator?
I have had this question myself from many months, eager to hear some one answering this !
Mar
6
comment Is there a format preserving cryptographically secure hash?
If hash preserves the length of the original string then it is just a permutation (like block cipher). Use a FPE algorithm to encrypt the input and throw the key, consider the ciphertext as your hash !
Feb
5
comment Generating cyclic group for Ciphertext-Policy Attribute-Based Encryption
we have used this charm-crypto.com/Main.html but it is written in python.
Jan
8
comment Encryption for a short packet size
Its based on fiestel networks which is very well studied in theory. the original paper was written some twenty years ago. ofcourse independent cryptanalysis is not yet done by anyone
Jan
6
comment Encryption for a short packet size
github.com/cisco/libfnr will this help ?
Jan
3
comment what is it called when encrypt('a') + encrypt('a') == encrypt('aa')?
They are applied in general too. It is called "Partially Homomorphic Encryption" to be precise !
Jan
2
comment Can we quantify strength of encryption scheme ?
@JohnMeacham that would be too subjective, who qualifies to be schneier ? how would you experimentally verify such units ?
Dec
4
comment Using machine-learning techniques for data-dependent operations in ciphers
there are plenty , just search for "cryptanalysis genetic algorithms" on scholar.google.com
Dec
4
comment Using machine-learning techniques for data-dependent operations in ciphers
Yes There are few papers using genetic algorithms but i would be very curious to know others
Dec
1
comment Implementing a pseudo random function in practice
AES-128 also considered good PRF
Nov
16
comment Secure symmetric encryption algorithm for any-size base62 data
are you looking for format preserving encryption ?
Nov
7
comment Can we give access to controlled functionality in Fully homomorphic encryption schemes?
the question was about controlled functionality for FHE but not FE
Nov
6
comment What is the most computationally efficient way of generating pseudo-random permutations?
If security is not a major concern , vanilla feistel network with AES-NI as PRF , with 6 rounds would be good enough thank FFX modes
Oct
30
comment Encrypting twice with same key gives back plain text
@owlstead looks like yes, thanks !
Oct
30
comment Encrypting twice with same key gives back plain text
the question is about block-cipher
Oct
30
comment Encrypting twice with same key gives back plain text
@squeamishossifrage the above question is about block ciphers , i thought it was explicit from the question i was pointing it , anyway edited it now to make it more clear
Oct
23
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
Oct
23
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
Oct
23
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.
Oct
23
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