How to Find the Pattern Hidden in Random Data

Cryptographers often use unit directional math operations that will easily output a number, but cannot be reverse engineered to reveal the process. For example, a discreet logarithm depends on a particular operation that takes two numbers and returns results that bounce around unpredictably as a and x change. Classical computer can't crack the string of outputs to find x. Timmy and his team showed how, by using quantum kernels, you can learn to find the pattern hiding in the seemingly random output produced by the discreet log problem.