WorldCat Identities

Rabin, Michael Oser 1931-

Overview
Works: 29 works in 49 publications in 2 languages and 392 library holdings
Classifications: QA1, 629.892
Publication Timeline
Key
Publications about  Michael Oser Rabin Publications about Michael Oser Rabin
Publications by  Michael Oser Rabin Publications by Michael Oser Rabin
Most widely held works by Michael Oser Rabin
Automata on infinite objects and Church's problem by Michael Oser Rabin ( Book )
7 editions published in 1972 in English and held by 305 WorldCat member libraries worldwide
Digitalized signatures and public-key functions as intractable as factorization by Michael Oser Rabin ( Book )
5 editions published in 1979 in English and Undetermined and held by 14 WorldCat member libraries worldwide
We introduce a new class of public-key functions involving a number n = p.q having two large prime factors. As usual, the key n is public, while p and q are the private key used by the issuer for production of signatures and function inversion. These functions can be used for all the applications involving public-key functions, including digitalized signatures. We prove that for any given n, if we can invert the function y = E sub n(x) for even a small percentage of the values y then we can factor n. Thus as long as factorization of large numbers remains practically intractable, for appropriately chosen keys not even a small percentage of signatures are forgerable. Breaking the RSA function is at most as hard as factorization, but is not known to be equivalent to factorization even in the weak sense that ability to invert all function values entails ability to factor the key. Computation time for these functions, i.e., signature verification, is several hundred times faster than for the RSA scheme. Inversion time, using the private key, is comparable. The almost-everywhere intractability of signature-forgery for our functions (on the assumption that factoring is intractable) is of great practical significance and seems to be the first proved result of this kind
Probabilistic algorithms in finite fields by Michael Oser Rabin ( Book )
3 editions published in 1979 in English and Undetermined and held by 12 WorldCat member libraries worldwide
Super-exponential complexity of Presburger arithmetic by Michael J Fischer ( Book )
2 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
Lower bounds are established on the computational complexity of the decision problem and on the inherent lengths of proofs for two classical decidable theories of logic: the first order theory of the real numbers under addition, and Presburger arithmetic -- the first order theory of addition on the natural numbers. There is a fixed constant c> 0 such that for every (non-deterministic) decision procedure for determining the truth of sentences of real addition and for all sufficiently large n, there is a sentence of length n for which the decision procedure runs for more than (2 sup (cn)) steps. In the case of Presburger arithmetic, the corresponding bound is 2 sup (2 sup (cn)). These bounds apply also to the minimal lengths of proofs for any complete axiomatization in which the axioms are easily recognized. (Author)
Complexity of computations by Michael Oser Rabin ( Recording )
1 edition published in 1976 in English and held by 6 WorldCat member libraries worldwide
Efficient dispersal of information for security load balancing and fault tolerance by Michael Oser Rabin ( Book )
2 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide
ʻAl Profesor Avraham Halevi Frenkel zal; devarim she-amru li-zikhro B. Mazar, A.Y.Y. Poznanski ve-M. Rabin, be-yom 7 be-Kislev 726 (1.12.65) by Benjamin Mazar ( Book )
1 edition published in 1965 in Hebrew and held by 4 WorldCat member libraries worldwide
Automata on infinite objects and church's problem : Lectures from the CBMS Regional Conference held at Morehouse College, Atlanta, Georgia Sept.8-12, 1969 by Michael O Rabin ( Book )
1 edition published in 1972 in English and held by 4 WorldCat member libraries worldwide
Maximum matchings in general graphs through randomization by Michael Oser Rabin ( Book )
2 editions published in 1984 in English and held by 4 WorldCat member libraries worldwide
An integrated toolkit for operating system security by Michael Oser Rabin ( Book )
3 editions published between 1987 and 1988 in English and held by 4 WorldCat member libraries worldwide
ʻAl Avraham Halevi Frenḳel zal : devarim she-amru le-zikhro B. mazar, A. Y. Y. Poznansḳi, M. Rabin be-yom ... (1.2.65) by Benjamin Mazar ( Book )
2 editions published in 1965 in Hebrew and held by 3 WorldCat member libraries worldwide
ʻAl Profesor Avraham Halevi Frenkel by Benjamin Mazar ( Book )
2 editions published in 1965 in Hebrew and held by 3 WorldCat member libraries worldwide
Degree of difficulty of computing a function and a partial ordering of recursive sets by Michael Oser Rabin ( Book )
1 edition published in 1960 in English and held by 3 WorldCat member libraries worldwide
ʻAl Profesor Avraham Halevi Frenḳel zal by Benjamin Mazar ( Book )
1 edition published in 1965 in Hebrew and held by 3 WorldCat member libraries worldwide
Decidability of second-order theories and automata on infinite trees by Michael Oser Rabin ( Book )
1 edition published in 1968 in English and held by 2 WorldCat member libraries worldwide
ʻAl Avraham Halevi Frenḳel : devarim she-amru le-zikhro B. mazar, A. Y. Y. Poznansḳi, M. Rabin be-yom ... (1.2.65) by Benjamin Mazar ( Book )
1 edition published in 1965 in Hebrew and held by 2 WorldCat member libraries worldwide
ASC3: Algorithmic Strategies for Compiler Controlled Caches ( )
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
The ASC3 effort was a collaboration among research groups. The effort focused on strategies for improving the performance of data-intensive and memory-bound programs through the innovation of algorithmic approaches in the following areas: 1) The management of programmable memory hierarchies, 2) Data remapping and speculative execution for improved cache performance, and 3) Compiler optimizations that are tolerant to memory aliasing. The techniques developed by the ASC3 effort were applied to a number of data-intensive applications, including automatic target recognition, database management, image matching, neural network simulation and scientific computation. The strategies were validated using industry-strength simulation and emulation tools, based on the Trimaran EPIC Research Infrastructure. The optimizations developed in the program exploited trends in microprocessor design and are applicable to current platforms, emerging EPIC architectures, and future generations of COTS software. The ASC3 effort also extended the functionality of the Trimaran Compiler EPIC infrastructure
Recursive unsolvability of group theoretic problems by Michael Oser Rabin ( Book )
1 edition published in 1957 in English and held by 1 WorldCat member library worldwide
Efficient randomized pattern-matching algorithms by Richard M Karp ( Book )
1 edition published in 1981 in English and held by 1 WorldCat member library worldwide
Hyper-encryption and provably everlasting secrets by Michael O Rabin ( Visual )
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
Current encryptions are in principle breakable. How and why "hyper-encrypt" explained
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.78 (from 0.00 for ASC3: Algo ... to 1.00 for Recursive ...)
Alternative Names
Rabiyn Miykaʾel 1931-....
רבין מיכאל 1931-....
Languages
English (30)
Hebrew (7)