1996-09-23 - Re: provably hard PK cryptosystems

Header Data

From: Asgaard <asgaard@Cor.sos.sll.se>
To: cypherpunks@toad.com
Message Hash: 204121194f44272d285d96b6be827bbea2de9468b323773d3378c2aeb0f975eb
Message ID: <Pine.HPP.3.91.960923182407.12499B-100000@cor.sos.sll.se>
Reply To: <ae6b6083050210047554@[207.167.93.63]>
UTC Datetime: 1996-09-23 22:11:30 UTC
Raw Date: Tue, 24 Sep 1996 06:11:30 +0800

Raw message

From: Asgaard <asgaard@Cor.sos.sll.se>
Date: Tue, 24 Sep 1996 06:11:30 +0800
To: cypherpunks@toad.com
Subject: Re: provably hard PK cryptosystems
In-Reply-To: <ae6b6083050210047554@[207.167.93.63]>
Message-ID: <Pine.HPP.3.91.960923182407.12499B-100000@cor.sos.sll.se>
MIME-Version: 1.0
Content-Type: text/plain


On Sun, 22 Sep 1996, Timothy C. May wrote:

> Suppose a tile is placed at some place on the grid, and another tile
> (possibly a different tile, possibly the same type of tile) is placed some
> distance away on the grid. The problem is this: Can a "domino snake" be
> found which reaches from the first tile to the second tile, with the
> constraint that edges must match up on all tiles? (And all tiles must be in
> normal grid locations, of course)

Intuitively (but very well not, I'm not informed enough to know)
this might be a suitable problem for Hellman's DNA computer, the
one used for chaining the shortest route including a defined
number of cities?

Asgaard

Thread

• Return to September 1996

• Return to “Asgaard <asgaard@Cor.sos.sll.se>”
• Return to “Gary Howland <gary@systemics.com>”
• Return to “Jim McCoy <mccoy@communities.com>”
• Return to “Mike McNally <m5@tivoli.com>”
• Return to “Phil Fraering <pgf@acadian.net>”

• Return to “tcmay@got.net (Timothy C. May)”

• 1996-09-23 (Mon, 23 Sep 1996 20:41:35 +0800) - Re: provably hard PK cryptosystems - tcmay@got.net (Timothy C. May)
  • 1996-09-23 (Tue, 24 Sep 1996 06:11:30 +0800) - Re: provably hard PK cryptosystems - Asgaard <asgaard@Cor.sos.sll.se>
    • 1996-09-24 (Wed, 25 Sep 1996 01:53:08 +0800) - Re: provably hard PK cryptosystems - Gary Howland <gary@systemics.com>
      • 1996-09-25 (Wed, 25 Sep 1996 08:40:24 +0800) - Re: provably hard PK cryptosystems - Phil Fraering <pgf@acadian.net>
    • 1996-09-24 (Wed, 25 Sep 1996 02:35:32 +0800) - Re: provably hard PK cryptosystems - Mike McNally <m5@tivoli.com>
  • 1996-09-24 (Tue, 24 Sep 1996 08:30:50 +0800) - Re: provably hard PK cryptosystems - Jim McCoy <mccoy@communities.com>