Efficient KEMs with partial message recovery

Tor Bjorstad, Alexander Dent, Nigel Smart

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

6 Citations (Scopus)

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 contributionEfficient KEMs with partial message recovery
Original languageEnglish
Title of host publicationCryptography and Coding - IMACC 2007
PublisherSpringer Berlin Heidelberg
Pages233-256
Volume4887
Publication statusPublished - 2007

Bibliographical note

Other page information: 233-256
Conference Proceedings/Title of Journal: Cryptography and Coding
Other identifier: 2000773

Fingerprint Dive into the research topics of 'Efficient KEMs with partial message recovery'. Together they form a unique fingerprint.

Cite this