| bio | website | notyet;) |
|---|---|---|
| location | Peacedale, RI | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 3 hours ago | |
| stats | profile views | 21 |
Electronics Engineer, Amateur Cryptographer with interests in designing real random and psuedorandom bit generators.
"Randomness is like a box of chocolates; you never know what you are going to get"
Forrest Gump Jr.
"You can't use mathematical means to create true randomness but you can use mathematical means to stretch a short truly random bitstream into a binary string of virtually infinite length that is indistinguishable from the uniform distribution, the distinguisher being a Universal Turing Machine". John Von Neumann Jr.
"It's trivial to make a Turing machine that fools all other Turing machines into "thinking" that they are looking at an unpredictable uniform distribution. Here is the schematic."
Alan Turing Jr.
|
Mar 2 |
answered | Why do we assume un-security of communication channel on every cryptography system |
|
Dec 3 |
asked | Bent Combining Functions |
|
Nov 8 |
asked | Cryptanalysis of Linear Feedback Shift Registers |
|
Sep 25 |
asked | Secure Pseudorandom Number Generators |
|
May 25 |
asked | Linear Feedback Shift Register Taps |
|
May 19 |
answered | Cryptography for kids |
|
Apr 24 |
answered | Are asymptotic lower bounds relevant to cryptography? |
|
Nov 14 |
asked | Are there practical upper limits of RSA key lengths? |
|
Sep 12 |
answered | Could one construct a cipher that is secure for friendly parties to use but insecure for hostile parties? |
|
Aug 7 |
asked | Why isn't the alternating step generator used more often? |