Abstract
Constructing efficient and secure encryption schemes is an important
motivation for modern cryptographic research. We propose simple and
secure constructions of hybrid encryption schemes that aim to keep
message expansion to a minimum, in particular for RSA-based
protocols. We show that one can encrypt using RSA a message of
length $|m|$ bits, at a security level equivalent to a block cipher
of $\kappa$ bits in security, in $|m|+4 \kappa+2$ bits. This is
therefore independent of how large the RSA key length grows as a
function of $\kappa$. Our constructions are natural and highly
practical, but do not appear to have been given any previous formal
treatment.
| Translated title of the contribution | Efficient KEMs with partial message recovery |
|---|---|
| Original language | English |
| Title of host publication | Cryptography and Coding - IMACC 2007 |
| Publisher | Springer Berlin Heidelberg |
| Pages | 233-256 |
| Volume | 4887 |
| Publication status | Published - 2007 |
Bibliographical note
Other page information: 233-256Conference Proceedings/Title of Journal: Cryptography and Coding
Other identifier: 2000773