Paper 2005/278
A New Rabin-type Trapdoor Permutation Equivalent to Factoring and Its Applications
Katja Schmidt-Samoa
Abstract
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of trapdoor one-way functions, only a very few candidates of this primitive have been observed yet. In this paper, we introduce a new trapdoor one-way permutation based on the hardness of factoring integers of $p^2q$-type. We also propose a variant of this function with a different domain that provides some advantages for practical applications. To confirm this statement, we develop a simple hybrid encryption scheme based on our proposed trapdoor permutation that is CCA-secure in the random oracle model.
Note: This is the full version of the STM 05 paper including the proof of the main theorem, which is omitted in the STM 05 proceedings due to length restrictions.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Proceedings of STM 05, ENTCS
- Keywords
- trapdoor one-way permutationshybrid encryptionTag-KEMDEM framework
- Contact author(s)
- samoa @ informatik tu-darmstadt de
- History
- 2005-08-21: received
- Short URL
- https://ia.cr/2005/278
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/278,
author = {Katja Schmidt-Samoa},
title = {A New Rabin-type Trapdoor Permutation Equivalent to Factoring and Its Applications},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/278},
year = {2005},
url = {https://eprint.iacr.org/2005/278}
}
