CryptoDB
A New Rabin-type Trapdoor Permutation Equivalent to Factoring and Its Applications
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2005-12612,
title={A New Rabin-type Trapdoor Permutation Equivalent to Factoring and Its Applications},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / trapdoor one-way permutations, hybrid encryption, Tag-KEM/DEM framework},
url={http://eprint.iacr.org/2005/278},
note={Proceedings of STM 05, ENTCS samoa at informatik.tu-darmstadt.de 13015 received 20 Aug 2005},
author={Katja Schmidt-Samoa},
year=2005
}