The Cryptographic Security of the Sum of Bits

Abstract

We show that if there exists a deterministic oracle that can determine the sum of the bits in the binary representation of x when presented with the RSA encryption of x, then there exists a probabilistic algorithm using this oracle to recover x when presented with the RSA encryption of x. We present a similar result for Rabin encryption.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1984
Accession Number
ADA611647

Entities

People

  • David Shmoys
  • Howard J. Karloff
  • Richard Berger

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Computer Science
  • Computers
  • Cryptography
  • Formal Languages
  • Generators
  • Information Operations
  • Language
  • Mathematics
  • Notation
  • Polynomials
  • Probability
  • Random Number Generators
  • Security

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Cybersecurity.
  • Mathematical Modeling and Probability Theory.