One-wayness equivalent to general factoring

Kaoru Kurosawa, Tsuyoshi Takagi

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to general factoring in the standard model [in the sense of indistinguishability against chosen-plaintext attack (IND-CPA)]. Next our proof technique is applied to the Rabin-Paillier encryption scheme and a variant of the RSA-Paillier encryption scheme to prove their one-wayness under the factoring assumption via tight security reductions.

Original languageEnglish
Pages (from-to)4249-4262
Number of pages14
JournalIEEE Transactions on Information Theory
Issue number9
Publication statusPublished - 2009
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'One-wayness equivalent to general factoring'. Together they form a unique fingerprint.

Cite this