1995-12-02 - Cypher secure versus computationally unbounded adversary
Header Data
From: solman@MIT.EDU
To: cypherpunks@toad.com
Message Hash: 6d4f6a5599cf547dfb34f3fba147e29ce4722ff9f7a6191b4ae52d79d1bbf64e
Message ID: <9512021931.AA01944@ua.MIT.EDU>
Reply To: N/A
UTC Datetime: 1995-12-02 19:48:06 UTC
Raw Date: Sun, 3 Dec 1995 03:48:06 +0800
Raw message
From: solman@MIT.EDU
Date: Sun, 3 Dec 1995 03:48:06 +0800
To: cypherpunks@toad.com
Subject: Cypher secure versus computationally unbounded adversary
Message-ID: <9512021931.AA01944@ua.MIT.EDU>
MIME-Version: 1.0
Content-Type: text/plain
Hi all,
I've just come up with a method for implementing and encryption algorithm
that is absolutely secure from passive attacks by a computationally
unbounded adversary. Is this a new capability, or am I reinventing the
wheel here?
Thanks,
Jason W. Solinsky
Thread
Return to December 1995
- Return to “SINCLAIR DOUGLAS N <sinclai@ecf.toronto.edu>”
Return to “solman@MIT.EDU”
- 1995-12-02 (Sun, 3 Dec 1995 03:48:06 +0800) - Cypher secure versus computationally unbounded adversary - solman@MIT.EDU
- 1995-12-02 (Sun, 3 Dec 1995 03:52:21 +0800) - Re: Cypher secure versus computationally unbounded adversary - solman@MIT.EDU
- 1995-12-03 (Sun, 3 Dec 95 06:10:26 PST) - Re: Cypher secure versus computationally unbounded adversary - SINCLAIR DOUGLAS N <sinclai@ecf.toronto.edu>