The RSA Group is adaptive pseudo-free under the RSA assumption

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    The notion of pseudo-free groups was first introduced and formalized by Hohenberger and Rivest in order to unify cryptographic assumptions. Catalano, Fiore and Warinschi proposed a generalized notion called adaptive pseudo-free groups, and showed that the RSA group Z × N is adaptive pseudo-free with some specific parametric distribution under the strong RSA assumption. In this paper, we develop an alternative parametric distribution and show that the RSA group Z × N is adaptive pseudo-free with the parametric distribution under the RSA assumption rather than the strong RSA assumption. Copyright c

    Original languageEnglish
    Pages (from-to)200-214
    Number of pages15
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE97-A
    Issue number1
    DOIs
    Publication statusPublished - 2014 Jan

    Keywords

    • Adaptive pseudo-free groups
    • Pseudo-freeness
    • RSA assumption

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'The RSA Group is adaptive pseudo-free under the RSA assumption'. Together they form a unique fingerprint.

  • Cite this