Michael O. Rabin: Pioneer of Computational Complexity and Cryptography

Michael Oser Rabin, born in 1931 in Breslau, was a trailblazer in computer science, renowned for his contributions to computational complexity and cryptography. After emigrating to Mandatory Palestine in 1935, Rabin's early interest in mathematics was nurtured by his father, leading him to study under Elisha Netanyahu. His academic journey took him from the Hebrew University to the University of Pennsylvania and Princeton University, where he earned his Ph.D. under Alonzo Church.

In the late 1950s, Rabin collaborated with Dana Scott at IBM, producing the seminal paper 'Finite Automata and Their Decision Problems,' which introduced nondeterministic machines—a concept that became foundational in computational complexity theory. His work at Bell Labs further advanced the field with the introduction of probabilistic automata, demonstrating significant state reductions in regular languages.

Rabin's career was marked by numerous innovations. He introduced polynomial time independently alongside Cobham and Edmonds, and his work on infinite-tree automata proved the decidability of the monadic second-order theory of n successors. His tenure at MIT in the 1970s led to the development of the Miller–Rabin primality test, a breakthrough in fast primality testing crucial for public-key cryptography.

In 1978, Rabin invented the Rabin signature algorithm, the first asymmetric cryptosystem with security tied to the intractability of integer factorization. His contributions to cryptography continued with the reinvention of oblivious transfer, a method allowing secure message transmission with probabilistic receiver knowledge.

Rabin's later work with Richard Karp on the Rabin–Karp string search algorithm introduced efficient string searching using a rolling hash. Throughout his career, Rabin's research focused on computer security, and he shared his knowledge as a visiting professor at Columbia University.

Rabin's legacy is celebrated through numerous awards, including the Turing Award, Israel Prize, and Dan David Prize. His influence extends through his students and his daughter, Tal Rabin, a distinguished computer scientist. Rabin passed away in 2026, leaving behind a profound impact on the field of computer science.