meta user
network profile
| bio | website | samuelkerr.com |
|---|---|---|
| location | United States | |
| age | 24 | |
| visits | member for | 1 year, 10 months |
| seen | Oct 7 '12 at 18:08 | |
| stats | profile views | 12 |
I am a Computer Science student at Purdue University. My interests include information security, artificial intelligence, operating systems, and embedded systems.
|
Jun 19 |
comment |
Is it possible to use the RSA algorithm, or a variant, for software licensing? Just a thought, why not pay for or license a license manager? You want to focus on your application, not making sure the license manager is secure and functioning. |
|
Jul 15 |
comment |
Identifying encryption method from encrypted string Alternatively, if you determine with LESS than 1/2, you can also consider it broken. Simply pick the opposite of whatever your algorithm says. |
|
Jul 13 |
comment |
How can I generate large prime numbers for RSA? +1 for mentioning FIPS, which is different than what most implementations use. |
|
Jul 13 |
comment |
What are the practical difference between 256-bit, 192-bit, and 128-bit AES encryption? There are actual several attacks against AES, reducing time below 2^length. The attacks can be done in 2^119, 2^176, and 2^200 respectively. schneier.com/blog/archives/2009/07/another_new_aes.html |
|
Jul 12 |
comment |
How can a random salt for a hash function work in practice? You could also think of this as a first preimage attack. This attack is that given a hash h, find a message m where H(m) = h. If the salt was known, this would simply reduce to H(m | salt) = h. Assuming you have a secure hash algorithm, it should be able to resist this first preimage attack. |
|
Jul 12 |
comment |
How can a random salt for a hash function work in practice? That's not true. Without the salt, the attacker would be required to execute a brute force attack. With the salt, the attacker will still need a brute force attack. The difference is, with salt the attacker cannot pre-compute many easy hashes (of 'dog', 'password', etc.) but rather must re-compute the entire hash key space ('dog_kaskd2e','password_kaskd2e', etc). |
