AWhat changed
Rabin gives a public-key function based on modular quadratic equations and a randomized reduction showing that inversion on a substantial fraction of its invertible unit-domain outputs enables factorization of the modulus.
Scientific scope
Rabin gives a public-key function based on modular quadratic equations and a randomized reduction showing that inversion on a substantial fraction of its invertible unit-domain outputs enables factorization of the modulus. The inversion/factorization equivalence belongs to the stated modular-square trapdoor construction. Extracting roots has ambiguities and protocol encodings need additional conditions. This is not unrestricted chosen-ciphertext security, authenticated encryption or a current deployment recommendation. Later padding/signature schemes and earlier factorization methods retain separate credit.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Michael O. Rabin · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Rabin 1979 MIT-LCS-TR 212: Digitalized signatures and public-key functions as intractable as factorization
- Bellare/Rogaway 1996: exact security of digital signatures, author abstract
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction