Demonstrating Possession without Revealing Factors

Hiroki SHIZUYA  Kenji KOYAMA  Toshiya ITOH  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E77-A   No.1   pp.39-46
Publication Date: 1994/01/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)
zero-knowledge proof,  factoring,  discrete logarithm,  

Full Text: PDF(610KB)>>
Buy this Article

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.