network profile
| bio | website | coderscentral.blogspot.com |
|---|---|---|
| location | Colorado Springs, CO | |
| age | 48 | |
| visits | member for | 1 year, 9 months |
| seen | Feb 26 at 23:44 | |
| stats | profile views | 11 |
Started programming on a Control Data mainframe in FORTRAN IV, back when that was still a new thing. Was apparently quite masochistic, because I kept programming anyway. For that matter, I still do...
Gold C++ badge #20
Gold C badge #12
Legendary badge #35
|
Aug 12 |
awarded | Yearling |
|
Jun 11 |
comment |
What algorithm would give the shortest ciphertext for very short plaintexts? @JoelFan: A fixed IV defeats the purpose of having an IV at all. To be useful, each IV must be unique. |
|
Jun 11 |
revised |
What algorithm would give the shortest ciphertext for very short plaintexts? added 90 characters in body |
|
Jun 11 |
revised |
What algorithm would give the shortest ciphertext for very short plaintexts? added 97 characters in body |
|
Jun 11 |
answered | What algorithm would give the shortest ciphertext for very short plaintexts? |
|
Jan 11 |
answered | DES Crack simulation |
|
Nov 26 |
comment |
Verilog simulation of Data Encryption Standard You might want to use an existing DES core for comparison/regression testing. |
|
Nov 22 |
awarded | Enthusiast |
|
Nov 15 |
answered | Why is elliptic curve cryptography not widely used, compared to RSA? |
|
Nov 12 |
revised |
What is pre-image resistance, and how can the lack thereof be exploited? added 2 characters in body |
|
Nov 12 |
comment |
What is pre-image resistance, and how can the lack thereof be exploited? @PaŭloEbermann: Perhaps -- realistically, talking about which is more devastating is a little like arguing about whether it's worse to die by guillotine or firing squad. Either way you're dead (in a hurry). Just to be a bit more clear, I'll edit it anyway. |
|
Nov 12 |
answered | What is pre-image resistance, and how can the lack thereof be exploited? |
|
Nov 1 |
comment |
Why do we need special key-wrap algorithms? It's probably worth noting that one of the conclusions from the paper is that although they think the algorithms they analyzed are probably at least reasonably correct, they could not prove any of them, and most of them are sufficiently complex (and some contain unexplained bits and pieces) that such a proof may well be impossible. |
|
Oct 31 |
comment |
Is Blowfish strong enough for VPN encryption? Being fair, DES was at least as much a product of IBM as of any federal bureaucracy (if anything, much more so). |
|
Oct 28 |
answered | Why would you expect to find a collision in a hash function after approximately $\sqrt{n}$ hashes? |
|
Oct 21 |
awarded | Citizen Patrol |
|
Oct 17 |
answered | Is there a hash function with 2048bit output? |
|
Sep 23 |
answered | Changing algorithms during encryption |
|
Sep 7 |
answered | Is modern encryption needlessly complicated? |
|
Aug 17 |
comment |
Now that quantum computers have been out for a while, has RSA been cracked? @Rob:oops, quite right. Corrected, and thank you. |
