1996-11-18 - DSA over Elliptic Curves
Header Data
From: janke@unixg.ubc.ca
To: cypherpunks@toad.com
Message Hash: a71bcdcf8b00ccc6028dbd7ad6dce172f08f28ea23d967a12e3c935fa939369c
Message ID: <199611180136.RAA00729@clouds.heaven.org>
Reply To: N/A
UTC Datetime: 1996-11-18 01:36:18 UTC
Raw Date: Sun, 17 Nov 1996 17:36:18 -0800 (PST)
Raw message
From: janke@unixg.ubc.ca
Date: Sun, 17 Nov 1996 17:36:18 -0800 (PST)
To: cypherpunks@toad.com
Subject: DSA over Elliptic Curves
Message-ID: <199611180136.RAA00729@clouds.heaven.org>
MIME-Version: 1.0
Content-Type: text/plain
Has anyone implemented this yet? I am going to and was wondering
what good sizes for q (the prime corresponding to the
160 bit prime in DSA) and p (the prime corresponding to the
512-1024 bit prime in DSA) would be?
Leonard
Thread
Return to November 1996
Return to “janke@unixg.ubc.ca”
1996-11-18 (Sun, 17 Nov 1996 17:36:18 -0800 (PST)) - DSA over Elliptic Curves - janke@unixg.ubc.ca