Reputation
17,968
Next tag badge:
100/100 score
38/20 answers
Badges
2 27 77
Newest
 Announcer
Impact
~445k people reached

Oct
16
comment I need to know number of encryption/decryption operations?
How many keys??
Oct
14
answered Is it true the longer the key length is the more secure the encryption?
Oct
9
reviewed No Action Needed What is the sign bit for in Feige-Fiat-Shamir?
Oct
9
comment Is .NET DESCryptoServiceProvider secure in this case?
@Jk_xp I think so. Make sure you are using a good mode. In particular, if you choose CBC or another non-authenticated mode, make sure you understand the implications of doing that in the context of your application. The remaining obvious risk is that your server could be hacked and the key stolen. If that is an acceptable risk to you, then you should be fine.
Oct
9
comment Is .NET DESCryptoServiceProvider secure in this case?
@Jk_xp your code, as is, is completely insecure since it uses DES. Now, let's say you changed it to AES. That would be a step up. But, since the key and IV are hard coded into the code, someone could reverse engineer your executable, and recover those values. Then they have both and can create their own messages.
Oct
9
revised Is .NET DESCryptoServiceProvider secure in this case?
added 137 characters in body
Oct
9
reviewed Leave Open Question about the security of Substitution-Permutation Network
Oct
9
reviewed Leave Open What does “nonlinear mapping” mean?
Oct
9
reviewed Leave Open Homomorphic encryption based on XOR
Oct
9
reviewed No Action Needed how to find key matrix in hill cipher
Oct
9
reviewed Looks OK Does this guarantee a unique 32 bit Hash?
Oct
9
reviewed Leave Closed stream cipher computation cost
Oct
9
answered Is .NET DESCryptoServiceProvider secure in this case?
Oct
9
comment Security analysis of Spritz?
From the paper you linked to "The virtues of Spritz as a hash function are more its simplicity of implementation and conservative design than its speed." Maybe the same can be said about Spritz as a stream cipher?
Oct
9
comment Security analysis of Spritz?
Keccak and SHA-256 are not ciphers. SHA-256 is a hash function. Keccak is a family of sponge functions which can be used to build hash functions (SHA-3 competition) or stream ciphers.
Oct
8
comment Does this guarantee a unique 32 bit Hash?
@sashank, One thing I noticed with your code is that since the string generation is deterministic, it always finds the same collisions. I changed it so it appends a random integer to "Hello" instead. Then you get some variation. I did this and ran the code 1000 times. That resulted in an average of around 57k iterations. If I run it more, it should get closer to the expected 65k.
Oct
7
comment Does this guarantee a unique 32 bit Hash?
@sashank that seems strange. Are you willing to share your code? I'd like to see what I get.
Oct
7
comment Need help solving message encrypted on an Enigma machine?
What have you tried?
Oct
6
comment Homomorphic encryption based on XOR
@user153465 If I had to guess, I'd guess the - votes came for the original question since it had a lot of holes. I gave it a +1 after your clarifying comments were added in.
Oct
6
comment Does this guarantee a unique 32 bit Hash?
@squeamishossifrage do you have any references on the collision resistance of djb2? If it has not been properly vetted by the cryptographic community, then I wouldn't use it in a case where we don't want collisions (that said, a work factor of $2^{16}$ isn't much, so I wouldn't use that either).