You might want to look at Hall et al's Reaction Attacks,
http://www.counterpane.com/reaction_attacks.html
Basically, you take a valid message and tweak it to see where it becomes
invalid. Leave the seed value entirely alone, and just add powers of
two to one of the integers you send until it to
At 09:53 PM 3/5/00 -0500, [EMAIL PROTECTED] wrote:
>
>Perhaps this solves a little problem we've been playing with:
>
>We have an untrusted user that needs a key to unlock a file for
>processing. Is there anyway we can transmit a key to the program that
>processes the file and allow the program
On Sat, 4 Mar 2000, bram wrote:
>
> I've written up a public key encryption algorithm I came up with and some
> thoughts on it at
>
> http://www.gawth.com/bram/essays/simple_public_key.html
Here's an idea I just had towards an attack on the system. I'm not
sure it goes all the way through.
On Sun, 5 Mar 2000, Jim Choate wrote:
>
>
> On Sun, 5 Mar 2000, dmolnar wrote:
Just a note - the conjecture is due to [EMAIL PROTECTED] and can be found on
his web page. My apologies if including it in my post caused any
confusion.
>
> > > Conjecture - For any axiomatic system, there exi
On Sun, 5 Mar 2000, dmolnar wrote:
> On Sun, 5 Mar 2000, Jim Choate wrote:
>
> > On Sun, 5 Mar 2000, dmolnar wrote:
>
> Just a note - the conjecture is due to [EMAIL PROTECTED] and can be found on
> his web page. My apologies if including it in my post caused any
> confusion.
Actualy I shou
On Sun, 5 Mar 2000 [EMAIL PROTECTED] wrote:
> Perhaps this solves a little problem we've been playing with:
>
> We have an untrusted user that needs a key to unlock a file for
> processing. Is there anyway we can transmit a key to the program that
> processes the file and allow the program to
On Sun, 5 Mar 2000, Tim May wrote:
> This is starting to look like a variant of the old "we share a large set of
> numbers--"one time pad"--and then the message includes a set of bits
> specifying an entry point into this set of numbers." In this case, the
> shared PRNG is not only security thro
On Sun, 5 Mar 2000 [EMAIL PROTECTED] wrote:
> Perhaps this solves a little problem we've been playing with:
>
> We have an untrusted user that needs a key to unlock a file for
> processing. Is there anyway we can transmit a key to the program that
> processes the file and allow the program t
At 6:07 PM -0800 3/5/00, dmolnar wrote:
>On Sun, 5 Mar 2000, bram wrote:
>
>> During encryption, the encrypter has to pick a bunch of random 0 or 1 bits
>
>Here "a bunch" = k, right ?
>
>> to determine whether to include each of the public key integers in each
>> sum. Rather than doing that rando
Perhaps this solves a little problem we've been playing with:
We have an untrusted user that needs a key to unlock a file for
processing. Is there anyway we can transmit a key to the program that
processes the file and allow the program to unlock the file for
processing such that the key canno
On Sun, 5 Mar 2000, dmolnar wrote:
> On Sun, 5 Mar 2000, bram wrote:
>
> > During encryption, the encrypter has to pick a bunch of random 0 or 1 bits
>
> Here "a bunch" = k, right ?
k times number of bits sent, yes.
> > to determine whether to include each of the public key integers in each
On Sun, 5 Mar 2000, bram wrote:
> During encryption, the encrypter has to pick a bunch of random 0 or 1 bits
Here "a bunch" = k, right ?
> to determine whether to include each of the public key integers in each
> sum. Rather than doing that randomly, she picks a seed for a standard
> cryptog
David Molnar wrote:
>
> On Sat, 4 Mar 2000, bram wrote:
>
> > I've also posted some very provocative conjectures at
> >
> > http://www.gawth.com/bram/essays/wild_cryptographic_conjectures.html
>
> I'm not sure I understand the first one...would you help me out?
Using zero knowledge techniques
> On Sat, 4 Mar 2000, bram wrote:
>
> > I've written up a public key encryption algorithm I came up with and
> > some thoughts on it at
> >
> > http://www.gawth.com/bram/essays/simple_public_key.html
>
> If I just send you the final sum, how do you know it was generated
> correctly by adding
On Sun, 5 Mar 2000, dmolnar wrote:
> > Conjecture - For any axiomatic system, there exists a function which
> > runs in a practical amount of time which takes as inputs a statement in
> > that axiomatic system and a fixed length string,
>
> > such that given a proof of any statement in the ax
On Sat, 4 Mar 2000, bram wrote:
>
> I've written up a public key encryption algorithm I came up with and some
> thoughts on it at
>
> http://www.gawth.com/bram/essays/simple_public_key.html
If I just send you the final sum, how do you know it was generated
correctly by adding stuff in the
On Sat, 4 Mar 2000, bram wrote:
> I've also posted some very provocative conjectures at
>
> http://www.gawth.com/bram/essays/wild_cryptographic_conjectures.html
>
I'm not sure I understand the first one...would you help me out?
> Conjecture - For any axiomatic system, there exists a functi
I've written up a public key encryption algorithm I came up with and some
thoughts on it at
http://www.gawth.com/bram/essays/simple_public_key.html
I've also posted some very provocative conjectures at
http://www.gawth.com/bram/essays/wild_cryptographic_conjectures.html
You might find them in
18 matches
Mail list logo
