Michael O. Rabin
Michael Oser Rabin (Hebrew מיכאל עוזר רבין; born September 1, 1931 in Breslau, then German Empire, today Poland) is an Israeli computer scientist. He has made an outstanding contribution in the field of cryptology in connection with prime numbers and in the range automata theory.
Life and work
Rabin's father was a rabbi. The family emigrated to Palestine in 1935. Rabin studied at the Hebrew University in Jerusalem (Master 1953) and a doctorate in 1956 in Princeton at Alonzo Church.
Throughout his career, he worked with Kurt Gödel at the Institute for Advanced Study, was a professor at Yale University, the Weizmann Institute, the Technion, the University of California, Berkeley, MIT, the University of Paris, the Courant Institute of Mathematical Sciences of New York University, Caltech, ETH Zurich, Columbia University and King's College London, 1982 to 1994 belonged to the IBM Science Advisory Committee and in 2009 was Visiting Researcher at Google, Inc. he is currently the Thomas J. Watson professor of computer science at Harvard University and a professor at the Hebrew University, whose rector he was from 1972 to 1975.
At Rabin's doctoral heard Saharon Shelah (including Erdős Prize and Wolf Prize ).
Based on a method Gary L. Miller developed Rabin 1975 Miller -Rabin algorithm for primality testing. He was awarded jointly with Dana Scott in 1976 with the Turing Award for computer science because of their introduction of nondeterminism in finite Automata and Their Decision Problem (IBM Journal Research and Development, Vol 3, 1959). From the Rabin Rabin cryptosystem, which he developed in 1979 came from. In 1987 he developed with Richard M. Karp Rabin - Karp algorithm for text search.
In 2001, he struck with his student Yan Zong Bing (in its basic principles ) proved to be secure and at the same time supposedly practical encryption method, see also. It is based on a one -time pad, the random number sequence is transmitted as part of a continuous unlimited sequence, for example, via satellite. Transmitter and receiver transmit in a conventionally encrypted transmission the initial time at which the random number sequence is employed. The data transmission rate of the sequence is so large that can not be saved, so you can not perform decryption in retrospect even if advised of the start time.
Rabin's daughter directs the valley Cryptography and Privacy Research Group at the Thomas J. Watson Research Center of IBM.