" ... random elements that are carefully chosen ... " Which quite irrelevantly recalls the definition of Monte-Carlo integration as "choosing a number completely at random, then with the greatest care performing a sequence of complicated mathematical operations on it". " ... turns short, simple programs into giant, unwieldy albatrosses ... " Some of my programming students could that several decades ago! The article is not explicit about time and space penalties incurred. Which --- again tangentially --- reminds me that in the 1960's, a certain hush-hush application was rumoured to randomly inflate the resources actually required, for fear that accurate run statistics might reveal information about the data being processed. WFL On 2/4/14, Henry Baker <hbaker1@pipeline.com> wrote:
FYI --
http://www.wired.com/wiredscience/2014/02/cryptography-breakthrough/all/
Cryptography Breakthrough Could Make Software Unhackable By Erica Klarreich, Quanta Magazine02.03.149:30 AM ...