trevitrace
Gold Member
- Joined
- Jul 21, 2013
- Messages
- 20,759
Love the splotchiness.
Love the splotchiness.
Damn, we may as well just go ahead and call this one now, Boru13 in post 13 is just too much karma to overcome.In
Lucky 13 maybe
I like the random number generator method. Gives more time for folks who are busy with work or something else to claim a spot
I find Bladeforum nearly unusable due to the lag. It really is challenging.
I can smell this photo... And my elbow literally aches thinking about those scales.
Me too, dibs on that pair puleeze!View attachment 1731301
This old paper-based Westinghouse product turned out pretty cool. I wish I could find more of this stuff.
"random stuff".... Many have tried and failed until today.
Cheers,
- Whoever succeeds will be very famous, able to decrypt the most secret communications, crack passwords, etc., easily.
Roland.
Is anyone else NP-hard right now?!The question came up this morning, if Jo’s random numbers could have been predicted.
I was bored, so I wrote up the following. Attention, Geek Alert. But I think it’s a fascinating story .... maybe somebody agrees
On predicting modern Random Number Generators:
Cheers,
- Évariste Galois was a famous mathematician who invented “Galois field theory”. Interesting character, after some incarceration in the Bastille, he died at 21 in a duel for dating the the wrong woman. Google him ....
- In mathematics, a “field” is a space in which you can move around like you are used to with “normal” numbers, i.e., do addition, subtraction, multiplication, division, there is a Zero, etc.
- Our “normal” day-to-day numbers are using a base of 10 (i.e., they have “digits”). Galois fields use as base prime numbers.
- The largest prime numbers known to us are “Mersenne prime numbers” (can be expressed as power(2,n) - 1, e.g., 127 for n=7)
- The largest Mersenne prime number known to date (“M77232917”) is about 23.2 million digits long.
- Both modern random number generators and encryption algorithms (used, e.g., when you send an iPhone SMS or log into BF to encrypt your password), use Galois fields with prime number bases as large as possible.
- To discover a pattern in a random number generator (i.e., to estimate the “entropy”), which is always periodical, you need at least more samples than the generator’s period. The larger the prime number bases of the generator are, the larger the period.
- There is a group of problems in computer science (“NP-complete”) for which the only algorithmic solution is to try out all possible solutions. Nobody knows a more efficient solution, but we do know that: if anybody ever solves one of these problems more efficiently, (s)he will solve all NP-complete problems more efficiently.
- (1) Finding the logarithm of a number in a Galois field is based on such a problem. And because it is required to (2) predict a random number generator’s output, or (3) decrypt any modern encrypted message, once anybody figures out how to do either of the 3 without trying all possible output combinations, (s)he will solve the 3 issues in one shot (and hundreds of other NP-complete problems). Many have tried and failed until today.
- Whoever succeeds will be very famous, able to decrypt the most secret communications, crack passwords, etc., easily.
Roland.