Demonstrating possession without revealing factors

Hiroki Shizuya, Kenji Koyama, Toshiya Itoh

    Research output: Contribution to journalArticlepeer-review


    This paper presents a zero-knowledge interactive protocol that demonstrates two factors a and b of a composite number n(= ab) are really known by the prover, without revealing the factors themselves. Here the factors a and b need not be primes. The security of the protocol is based on the difficulty of computing discrete logarithms modulo a large prime.

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

    ASJC Scopus subject areas

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


    Dive into the research topics of 'Demonstrating possession without revealing factors'. Together they form a unique fingerprint.

    Cite this