1993-10-20 - Re: crypto technique

Header Data

From: Karl Lui Barrus <klbarrus@owlnet.rice.edu>
To: cypherpunks@toad.com
Message Hash: 8a078858e3a0f67dd90ccab22c38dbed799587a918f0c47ad6265bf315108971
Message ID: <9310201728.AA13517@screech.owlnet.rice.edu>
Reply To: N/A
UTC Datetime: 1993-10-20 17:32:34 UTC
Raw Date: Wed, 20 Oct 93 10:32:34 PDT

Raw message

From: Karl Lui Barrus <klbarrus@owlnet.rice.edu>
Date: Wed, 20 Oct 93 10:32:34 PDT
To: cypherpunks@toad.com
Subject: Re: crypto technique
Message-ID: <9310201728.AA13517@screech.owlnet.rice.edu>
MIME-Version: 1.0
Content-Type: text/plain


-----BEGIN PGP SIGNED MESSAGE-----


>So, if I could prevent you from finding c, then you couldn't solve it. 
>How can I do this?  By adding another constant.

[...]

>136.375x^4 + 139.25x^3 + 33.625x^2 + 110.75x + 179

>So what values for A,B,C,D,E,& F did I use?  Have fun factoring!  :)

Sure, I'll give it a whirl as soon as my exams are over.

Offhand, it looks like you get five equations in six unknowns, which
is under-specified.  So possibly one parameter can take on any value
(or maybe any odd value), and the rest are then solved in terms of the
fixed variable.  The variable paramter can only take on values less
than P (maybe only odd values under P), the number of unknows is then
2*(nestings) - 1; everything still looks linear.

However, I haven't actually tried yet, so we'll see!

This isn't meant as a flame (in fact, this method is very
interesting), but you've posted two or three methods and declared them
all impossible to break.  Are you yourself trying to break these
schemes?  The very first method posted would have fallen under
scrutiny.

Also, mail any additional info to me directly; I'm behind on list
mail.

-----BEGIN PGP SIGNATURE-----
Version: 2.3a

iQCVAgUBLMV1CIOA7OpLWtYzAQGQRAP8CT79JpMKxVb/R//GVUfmCJ2ybtf8ASGY
BZa8bsL1VG49sxpoe7LsnQH2mJVAv3GloJhnuVN0d/MbTmohN6mgtGXbrQxvTdyn
r0eaTYcrXI0hiR5ahPp5SdfAHGuQ9LeQDermiiU+DK8I6lc+K6tzG0ZOUvs4r80n
cF4K9aXSaLQ=
=wMas
-----END PGP SIGNATURE-----





Thread