Making cryptographic primitives harder

    Research output: Contribution to journalArticlepeer-review


    This paper studies a method for transforming ordinary cryptographic primitives to new harder primitives. Such a method is expected to lead to general schemes that make present cryptosystems secure against the attack of quantum computers. We propose a general technique to construct a new function from an ordinary primitive function f with a help of another hard function g so that the resulting function is to be new hard primitives. We call this technique a lifting of f by g. We show that the lifted function is harder than original functions under some simple conditions.

    Original languageEnglish
    Pages (from-to)330-337
    Number of pages8
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    Issue number1
    Publication statusPublished - 2008 Jan 1


    • Discrete logarithm
    • Graph isomorphism
    • Liftings
    • Multivalued functions

    ASJC Scopus subject areas

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


    Dive into the research topics of 'Making cryptographic primitives harder'. Together they form a unique fingerprint.

    Cite this