On 1999-09-29 Atmel announced a partnership with IBM to make crypto
processors for the IBM PC 300 PL. From the press release [1]:
The hardware core of the security system is a cryptographic
processor developed by Atmel that can both store secret keys
in nonvolatile memory, and compute publi
List:
In reference to the recent discussions on voting, I am
preparing a list of desirable properties of voting, as a
secure protocol. Of course, it may not be desirable or even
possible for a particular election process to include *all*
of them -- the objective is just to have a list of choices.
>"paul a. bauerschmidt" wrote:
>> one password will decrypt correctly, many other passwords will produce
>> alternate, valid-looking keys to fool an attacker.
>>
>> is this an example of security through obscurity (a thought which many
>> frown upon, it seems)?
At 05:12 PM 10/8/99 -0700, Ed
It was suggested at the Cypherpunks meeting that I may want to announce
this here.
Lucky and I will be talking about GSM security (including how to break
the algorithms) at the Stanford Security Seminar tomorrow (Tuesday 12 Oct)
at 4:15 pm in room 498 Gates on the Stanford campus.
http://theory.
On Sat, 09 Oct 1999 20:35:15 -0700, Ed Gerck <[EMAIL PROTECTED]> wrote:
> In reference to the recent discussions on voting, I am
> preparing a list of desirable properties of voting, as a
> secure protocol. Of course, it may not be desirable or even
> possible for a particular election process to
From: IACR Newsletter <[EMAIL PROTECTED]>
IACR Newsletter
Vol. 16, No. 3, Fall 1999.
Published by the International Association for Cryptologic Research
Christian Cachin, Editor
http://www.iacr.org/newsletter/
...
SIGINT in Europe During the Cold War
==
[I'm just forwarding this with the expectation that someone might want to
try for the prize. I don't know anything about the code. -gnu]
Date: Sat, 9 Oct 1999 13:32:22 -0700 (PDT)
From: Alan Barnum Scrivener <[EMAIL PROTECTED]>
Subject: Re: unbreakable code?
Hello again friends. In my inexor
On Mon, Oct 11, 1999 at 07:40:16PM +0200, Anonymous wrote:
> > 2. Robustness: Dishonest voters, other participants or outsiders can't
> > disturb or disrupt an election.
>
> Votehere's system depends on a coalition of mutually suspicious parties
> to tally the vote (they mutually share the necess
John Gilmore wrote:
>
> [I'm just forwarding this with the expectation that someone might want to
> try for the prize. I don't know anything about the code. -gnu]
No, no. You are forwarding it with the expectation that we'll all shout
"snake oil" loud enough to deafen you.
BTW, I offer $1,00
Anonymous wrote:
> On Sat, 09 Oct 1999 20:35:15 -0700, Ed Gerck <[EMAIL PROTECTED]> wrote:
>
> > In reference to the recent discussions on voting, I am
> > preparing a list of desirable properties of voting, as a
> > secure protocol. Of course, it may not be desirable or even
> > possible for a
Thought this would be of interest.
--- Start of forwarded message ---
Message-Id:
Date: Mon, 11 Oct 1999 15:41:43 -0400
From: David Farber <[EMAIL PROTECTED]>
Subject: IP: Trusted Computing Platform Alliance Invites Companies to Join
(IBM/CQ/HP/IBM/INTEL/MSOFT)(IBM) Compaq, Hewlett Pa
11 matches
Mail list logo