| bio | website | notyet;) |
|---|---|---|
| location | Peacedale, RI | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 1 hour 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.
|
Dec 3 |
asked | Bent Combining Functions |
|
Nov 11 |
comment |
Cryptanalysis of Linear Feedback Shift Registers Thank you, the answer was well worth the wait :-) |
|
Nov 9 |
comment |
Cryptanalysis of Linear Feedback Shift Registers @DW. You are right, I think my original question needs to be upgraded , I'll try to come up with a better question. Thanks. |
|
Nov 8 |
comment |
Cryptanalysis of Linear Feedback Shift Registers @DW: Lets just assume that an attacker can see the complete output of the generator and he knows everything about the generator; the register length, polynomial,ect. All the attacker doesn't know is the seed. |
|
Nov 8 |
comment |
Cryptanalysis of Linear Feedback Shift Registers @ DW : What do you mean by "noisy"observations of the LFSR sequence? In answer to your question as what problem I'm trying to solve: I'm trying to do what all cryptographers are trying to do: design a generator that no algorithm can crack, a one way function ;-) |
|
Nov 8 |
asked | Cryptanalysis of Linear Feedback Shift Registers |
|
Oct 26 |
comment |
Because the algorithm is known, it is no longer a trade secret @Henno: I will just quote from the Wikipedia article on this matter: "Although Enigma had some cryptographic weaknesses, in practice it was only in combination with proceedural flaws, operator mistakes, captured key tables and hardware, that Allied cryptanalysts were able to be so successful." I might also like to add that I don't believe the official Bletchley Park story about how they "broke the code". Its too "pat", too "Hollywood", of course we will never really know what happened. Finis. :-) |
|
Oct 22 |
comment |
Because the algorithm is known, it is no longer a trade secret @John Deters: To be fair and accurate, Enigma was not broken because it was a weak algorithm, it was broken because it was not implimented correctly(human error). |
|
Oct 10 |
comment |
Avalanche noise RNG for one-time pad use I just read your link, it looks a lot like the old Intel RNG ( the new generator uses gate metastability to generate chaos). Given all the post-processing of the raw bits, it looks like it would be hard for an attacker to break it. But remember there are no guarantees of perfect randomness. To prove that a RNG is unpredictable is still an open problem. |
|
Oct 10 |
comment |
Avalanche noise RNG for one-time pad use It would be hard to give a reliable answer to your question without seeing the actual electronic schematic for this device. What kind of noise generators are used, how is the noise stream sampled, ect? |
|
Sep 30 |
awarded | Supporter |
|
Sep 25 |
asked | Secure Pseudorandom Number Generators |
|
May 26 |
comment |
Linear Feedback Shift Register Taps Yes, you answered my question and I can use the math to find the taps I need. I would upvote you if I had enough reputation. |
|
May 25 |
comment |
Linear Feedback Shift Register Taps That looks good, thanks again! |
|
May 25 |
comment |
Linear Feedback Shift Register Taps Google LFSR Taps to 168 bits. You will see the chart. Sorry I don't know how to hyperlink :-( |
|
May 25 |
comment |
Linear Feedback Shift Register Taps Not the easy look-up chart I was looking for but interesting none-the-less. Thank you. |
|
May 25 |
revised |
Linear Feedback Shift Register Taps spelling |
|
May 25 |
asked | Linear Feedback Shift Register Taps |
|
May 23 |
awarded | Teacher |
|
May 20 |
revised |
Cryptography for kids motivational clarity |