Cryptography and Security

The Challenge of Learning Automata Finite automata are fundamental computational models with applications in many areas of computer science and engineering. A key question is whether unknown finite automata can be learned, or inferred, from examples of their input-output behavior. This problem of learning an unknown mechanism from examples of its behavior is a central…

Overview of Shor’s Quantum Factoring Algorithm Shor’s algorithm for quantum computing provides an exponential speedup for integer factorization compared to the best known classical algorithms. Developed by mathematician Peter Shor in 1994, this quantum algorithm leverages the unique capabilities of quantum physics to quickly find the prime factors of large integers. The integer factorization problem,…

Evidence for One-Way Functions A one-way function is a mathematical function that is easy to compute on every input, but hard to invert given the image of a random input. More precisely, a function f: X → Y is one-way if: There exists a polynomial-time algorithm to compute f(x) for any x in X For…