Skip to comments.
High-quality random numbers can now be computed with much less effort
fudzilla.com ^
| 26 May 2016
| Jon Worrel
Posted on 05/26/2016 10:08:32 AM PDT by Ernest_at_the_Beach
A big win for encryption, more efficient complex simulations
Last week, computer scientist researchers at the University of Texas at Austin published a draft paper describing a new, more efficient way of generating truly random numbers that can be used everyday encryption situations like mobile banking, statistics, electronic voting and complex simulations, among other applications.
At the university, computer science professor David Zuckerman and graduate student Eshan Chattopadhyay developed a method of taking two weakly random numbers and combining them into a single sequence of truly random numbers. In the past, the task of generating truly random numbers for encryption and simulation purposes required very large amounts of computational power to produce higher-quality randomness results. Previous randomness extractors also had difficult requirements at least one of the two source random sequences had to be truly random, or both sequences had to be close to truly random.
The new method effectively removes both of these requirements and allows for two source sequences that are only weakly random.
Random number generation using explicit two-source extractors and resilient functions (via University of Texas at Austin)
Over the past several decades, the computer science field of study has generally been accustomed to gradual improvements in the quality-per-watt performance needed for high-quality random number generation. Zuckerman and Chattopadhyays breakthrough method is now described by some as light years ahead of previous methods, as it produces higher randomization with lower computational effort.
Quantis True Random Number Generator (TRNG) PCI-Express card (specifications here)
"When I heard about it, I couldn't sleep," says Yael Kalai, a senior researcher working in cryptography at Microsoft Research New England who has also worked on randomness extraction. "I was so excited. I couldn't believe it. I ran to the (online) archive to look at the paper. It's really a masterpiece."
The researchers claim that any truly random numbers required by everyday usage situations like online mobile banking, two-factor authentication and statistically significant poll results can now be computed with fractions of the compute power that was previously demanded. High-quality randomness needed for secure credit card purchases, medical data and military communications can now be produced with significantly higher quality-per-watt performance.
"This is a problem I've come back to over and over again for more than 20 years," says Zuckerman. "I'm thrilled to have solved it."
A draft paper of the new method was released in July 2015 describing the new method, titled Explicit Two-Source Extractors and Resilient Functions. It has been revised twice, with the most recent version dated March 20th.
The University of Texas at Austin researchers present their discovery next month at the Symposium on Theory of Computing (STOC) hosted by the Association of Computing Machinery (ACM). The paper is also expected to receive one of three STOC Best Paper Awards.
TOPICS: Computers/Internet; Science
KEYWORDS: decryption; encryption; hitech; privatekey; publickey
Navigation: use the links below to view more comments.
first 1-20, 21-27 next last
To: ShadowAce; SunkenCiv
To: Ernest_at_the_Beach
Cool math made simple. Now if we can dump Common Core
3
posted on
05/26/2016 10:18:22 AM PDT
by
stocksthatgoup
(GOPe/MSM - "When we want your opinion, we will give it to youGo to trumps websites look a)
To: Ernest_at_the_Beach
4
posted on
05/26/2016 10:19:12 AM PDT
by
Drango
(A liberal's compassion is limited only by the size of someone else's wallet.)
To: Ernest_at_the_Beach
Fascinating!
Thanks for info!!!!
5
posted on
05/26/2016 10:20:48 AM PDT
by
Zathras
To: Ernest_at_the_Beach
So I should toss my book on random numbers?
6
posted on
05/26/2016 10:43:58 AM PDT
by
SkyDancer
To: Zathras
To: Ernest_at_the_Beach
a method of taking two weakly random numbers and combining them into a single sequence of truly random numbersThis is great! Back when I dabbled in this (assembly language coding my own RAN generator), I came up with this sort of issue. I actually had something in mind like what they have done here, using two "weakly" random numbers. Whats amazing is that if you looked at "weakly" random numbers, to the human eye/experience, they look completely random, but if you map them into space you can start to see definite patterns emerging. So I started to think of combining two or more such randoms to create a more randomer number :)
At this point I was way in over my head, and dropped it. Thats a direction I could look at, but never go to....
8
posted on
05/26/2016 10:52:04 AM PDT
by
Paradox
(My positions can evolve, but Principles should be immutable.)
To: Ernest_at_the_Beach
If you need random number just copy the number on the unemployment reports.
9
posted on
05/26/2016 10:57:01 AM PDT
by
ThomasThomas
(Fools find no pleasure in understanding but delight in airing their own opinions.)
To: Ernest_at_the_Beach
I might have to pick one of these up and try it out.
10
posted on
05/26/2016 11:02:46 AM PDT
by
Zathras
To: Ernest_at_the_Beach
The NSA or CIA probably made sure a back door was built into that chip.
11
posted on
05/26/2016 11:06:11 AM PDT
by
r_barton
(GO TRUMP!!!)
To: Ernest_at_the_Beach
12
posted on
05/26/2016 11:08:18 AM PDT
by
JoeProBono
(SOME IMAGES MAY BE DISTURBING ’VIEWER DISCRETION IS ADVISED;-{)
To: Ernest_at_the_Beach
But it can be hacked by a 12 year old in Tacoma, WA using a lap top computer. He will sell his hacking program for $25.00 and some Oreo cookies.
13
posted on
05/26/2016 11:08:43 AM PDT
by
dirtymac
(Now is the time for all good men (people) to come to the aid of their country!)
To: dirtymac
LOL... It’s a new woeld isn’t it!
To: Ernest_at_the_Beach
This should expedite the budgeting process in Congress.
To: Ernest_at_the_Beach
If you can compute it, it’s not random.
If the results are reproducible, the numbers are not random.
A computer is the most deterministic thing there is. Someone please explain to me how a computer can compute true random numbers?
Using a TIME function doesn’t count. That is computed too, but the actual moment when you use the TIME function is unpredictable, giving the illusion of randomness.
16
posted on
05/26/2016 11:24:34 AM PDT
by
I want the USA back
(The further a society drifts from the truth, the more it will hate those who speak it. Orwell.)
To: Ernest_at_the_Beach
LOL... Its a new woeld isnt it! Index finger, not middle finger! Your touch-typing teacher is in despair!
17
posted on
05/26/2016 11:25:14 AM PDT
by
SES1066
(Quality, Speed or Economical - Any 2 of 3 except in government - 1 at best but never #3!)
To: Ernest_at_the_Beach
This ‘random’ problem demonstrates how much of our physical world is essentially sequential or constant. Try using seeds of measurable factors like air pressure, DJI and ambient dB at the local ER and they will still render roughly sequential random numbers.
18
posted on
05/26/2016 11:31:19 AM PDT
by
SES1066
(Quality, Speed or Economical - Any 2 of 3 except in government - 1 at best but never #3!)
To: Ernest_at_the_Beach
I wrote a random number generator in C class. It always returned 3.
To: I want the USA back
I agree. You need to add a source of nondeterminstic data, such as a Geiger counter.
20
posted on
05/26/2016 12:34:03 PM PDT
by
maro
(what did the President know and when did he know it?)
Navigation: use the links below to view more comments.
first 1-20, 21-27 next last
Disclaimer:
Opinions posted on Free Republic are those of the individual
posters and do not necessarily represent the opinion of Free Republic or its
management. All materials posted herein are protected by copyright law and the
exemption for fair use of copyrighted works.
FreeRepublic.com is powered by software copyright 2000-2008 John Robinson