- Original Message -
From: Jeroen C. van Gelderen [EMAIL PROTECTED]
Here is a scenario: Scott wants Alice to generate a key pair after
which he will receive Alice's public key. At the same time, Scott wants
to make sure that this key pair is newly generated (has not been used
before).
On Mon, 20 Jan 2003, Jeroen C. van Gelderen wrote:
Hi,
Here is a scenario: Scott wants Alice to generate a key pair after
which he will receive Alice's public key. At the same time, Scott wants
to make sure that this key pair is newly generated (has not been used
before).
I do not know what
Jeroen writes:
Here is a scenario: Scott wants Alice to generate a key pair after
which he will receive Alice's public key. At the same time, Scott wants
to make sure that this key pair is newly generated (has not been used
before).
How about a discrete log key where you fix p, q, and g.
I do not know what the proper terminology is to discuss this. Assuming
there is none, I will call the solution Key Pair Agreement.
Call it kosherized public key generation. Kosherization is not a term often
used in theoretical cryptography, but it is often used in practice
It would seem that
http://online.wsj.com/article_print/0,,SB1043113086596504224,00.html
The Wall Street Journal
January 21, 2003
New Powers Fuel Legal Assault
On Suspected Terror Supporters
By GLENN R. SIMPSON and JESS BRAVIN
Staff Reporters of THE WALL STREET JOURNAL
WASHINGTON -- Quietly deploying new
Patents were originally intended, and are usually used (for better
or for worse), as a mechanism for protecting inventors and their
licensees from competition. But I've noticed a couple of areas where
patents are also used as a security mechanism, aiming to prevent the
unauthorized production of
On Mon, Jan 20, 2003 at 09:08:31PM -0500, Radia Perlman wrote:
[...] I was going to suggest something similar to what David Wagner
suggested, but with Scott telling Alice the modulus size and the
*high* order 64 bits (with the top bit constrained to be 1). I can
see how Alice can easily
Matt Blaze wrote:
Patents were originally intended, and are usually used (for better
or for worse), as a mechanism for protecting inventors and their
licensees from competition. But I've noticed a couple of areas where
patents are also used as a security mechanism, aiming to prevent the
Matt Blaze wrote:
Patents were originally intended, and are usually used (for better
or for worse), as a mechanism for protecting inventors and their
licensees from competition.
That's an oversimplification. Patents were originally
intended as a bargain between the inventors and the
society
Another problem with this problem is that there are trivial solutions
because it is difficult to ensure that SEED1 is functionally essential
in the public key. For example, generate a public key PK using a
normal method, and define the new public key PK' = (PK, SEED1). Then to
encrypt to PK' the
At 09:08 PM 1/20/2003 -0500, Radia Perlman - Boston Center for Networking
wrote:
I was going to suggest something similar to what
David Wagner suggested, but with Scott telling Alice
the modulus size and the *high* order 64 bits (with the
top bit constrained to be 1). I can see how Alice
can
I can see how Alice
can easily generate two primes whose product will have
that *high* order part, but it seems hard to
generate an RSA modulus with a specific *low* order
64 bits.
It is easy in both cases, here are examples I easily came up
with:
(low order DEADBEEF))
p =
CodeCon 2.0 is the premier event in 2003 for the P2P, Cypherpunk, and
network/security application developer community. It is a workshop for
developers of real-world applications with working code and active
development projects.
CodeCon registration is $95; a $15 discount is available for
On Tue, Jan 21, 2003 at 11:02:25AM -0500, Matt Blaze wrote:
One example close to home is the DVD patents, which, in addition to
providing income for the DVD patent holders, also allows them to prevent
the production of players that don't meet certain requirements. This
effectively reduces the
Declan McCullagh recently posted an interesting article on a legal
opinion:
http://news.com.com/2100-1023-981449.html
He's placed the decision here:
http://www.politechbot.com/docs/verizon.riaa.decision.012103.pdf
All this to learn the identity of a computer at a particular IP address.
Adam Back [EMAIL PROTECTED] writes:
On Mon, Jan 20, 2003 at 09:08:31PM -0500, Radia Perlman wrote:
[...] I was going to suggest something similar to what David Wagner
suggested, but with Scott telling Alice the modulus size and the
*high* order 64 bits (with the top bit constrained to be 1). I can
16 matches
Mail list logo
