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...