A new public-key cryptosystem as secure as factoring
- Tatsuaki OkamotoAffiliated withNTT Laboratories
- , Shigenori UchiyamaAffiliated withNTT Laboratories
Its trapdoor technique is essentially different from any other previous schemes including RSA-Rabin and Diffie-Hellman.
It is a probabilistic encryption scheme.
It can be proven to be as secure as the intractability of factoring n = p2q (in the sense of the security of the whole plaintext) against passive adversaries.
It is semantically secure under the p-subgroup assumption, which is comparable to the quadratic residue and higher degree residue assumptions.
Under the most practical environment, the encryption and decryption speeds of our scheme are comparable to (around twice slower than) those of elliptic curve cryptosystems.
It has a homomorphic property: E(m0, r0)E(m1, r1) mod n = E(@#@ m0 + m1, r2), where E(m, r) means a ciphertext of plaintext m as randomized by r and m0+ m1 < p.
Anyone can change a ciphertext, C = E(m, r), into another ciphertext, C′ = Chr' mod n, while preserving plaintext of C (i.e., C′ = E(m,r″)), and the relationship between C and C′ can be concealed.
- A new public-key cryptosystem as secure as factoring
- Book Title
- Advances in Cryptology — EUROCRYPT'98
- Book Subtitle
- International Conference on the Theory and Application of Cryptographic Techniques Espoo, Finland, May 31 – June 4, 1998 Proceedings
- pp 308-318
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.