[6755] in cryptography@c2.net mail archive
Re: Looking for a cryptographic primitive
daemon@ATHENA.MIT.EDU (bram)
Thu Mar 9 11:29:11 2000
Date: Thu, 9 Mar 2000 06:34:44 -0800 (PST)
From: bram <bram@gawth.com>
To: cryptography@c2.net
In-Reply-To: <Pine.LNX.4.10.10003090547340.20126-100000@ultra.gawth.com>
Message-ID: <Pine.LNX.4.10.10003090631500.20126-100000@ultra.gawth.com>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
On Thu, 9 Mar 2000, bram wrote:
> Does anybody know of a field in which a + b and a * b can be computed
> quickly but (and this is important) it's computationally intractable to
> compute the additive inverse of a?
>
> [Bram: All fields of n elements are isomorphic to all other fields of
> n elements
I'm not using the additive or multiplicative identity, maybe eleminating
the requirement for those increases the number of mathematical structures
available?
-Bram
