[Resource Topic] 2005/278: A New Rabin-type Trapdoor Permutation Equivalent to Factoring and Its Applications

Welcome to the resource topic for 2005/278

Title:
A New Rabin-type Trapdoor Permutation Equivalent to Factoring and Its Applications

Authors: 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.

ePrint: https://eprint.iacr.org/2005/278

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .