1996-01-13 - Theory Question: Why isn’t RSA a 0-knowledge Proof
Header Data
From: “Joseph M. Reagle Jr.” <reagle@rpcp.mit.edu>
To: cypherpunks@toad.com
Message Hash: db58425675a6d6d8922fe389f0f59fe305289637e297ea158cc65a441bec659a
Message ID: <9601132108.AA19991@rpcp.mit.edu>
Reply To: N/A
UTC Datetime: 1996-01-13 21:16:37 UTC
Raw Date: Sun, 14 Jan 1996 05:16:37 +0800
Raw message
From: "Joseph M. Reagle Jr." <reagle@rpcp.mit.edu>
Date: Sun, 14 Jan 1996 05:16:37 +0800
To: cypherpunks@toad.com
Subject: Theory Question: Why isn't RSA a 0-knowledge Proof
Message-ID: <9601132108.AA19991@rpcp.mit.edu>
MIME-Version: 1.0
Content-Type: text/plain
Simple question, why isn't the hard problem of proving that I know a secret
key (d) for a given (e,n) (public key and modulus) a zero-knowledge proof?
Is some amount of information leaked during challanges?
_______________________
Regards, Is this true or only clever? -Augustine Birrell
Joseph Reagle http://farnsworth.mit.edu/~reagle/home.html
reagle@mit.edu 0C 69 D4 E8 F2 70 24 33 B4 5E 5E EC 35 E6 FB 88
Thread
Return to January 1996
- Return to “hallam@w3.org”
Return to ““Joseph M. Reagle Jr.” <reagle@rpcp.mit.edu>”
- 1996-01-13 (Sun, 14 Jan 1996 05:16:37 +0800) - Theory Question: Why isn’t RSA a 0-knowledge Proof - “Joseph M. Reagle Jr.” <reagle@rpcp.mit.edu>
- 1996-01-13 (Sat, 13 Jan 96 15:02:31 PST) - Re: Theory Question: Why isn’t RSA a 0-knowledge Proof - hallam@w3.org