Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / trapdoor one-way permutations, hybrid encryption, Tag-KEM/DEM framework

Publication Info: Proceedings of STM 05, ENTCS

Date: received 20 Aug 2005

Contact author: samoa at informatik tu-darmstadt de

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

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.

Version: 20050821:223301 (All versions of this report)

Discussion forum: Show discussion | Start new discussion