alculate the number of samples
needed to get the "reliability" of the predictions above a certian
threshold, and how to calculate the percentage of the predictions are
"reliable"? (If I use the median, it'll always be half; if I use some
other function, it'll
I wrote
> What's the average number of ones in a randomly-chosen N-bit number?
Duh..
Sorry, I was thinking of the average number of bits that change on
increment. The answer's obviously N/2 for the above.
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
seed w/ the public key, put it at the start,
recover that with your private key, seed the generator, and extract the
pgp message. That way, there's known plaintext, but you don't know
where to look for it.
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
unconditionally secure against quantum attack. (12kb)
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
f the contest are at
http://www.cs.oberlin.edu/students/mstay/contest.html
--
Mike Stay
mailto:[EMAIL PROTECTED]
ypted?
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
7;t
imagine right now. But firewalls and computer access devices...I have
trouble seeing it.
http://www.wired.com/news/news/technology/story/15572.html"
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
Dear Mike,
I think you've overestimated the implications of this method for
code breaking. My previous work with Dan Abrams did indeed show
that nonlinear quantum mechanics could be used to sol
anics, which are linear, appear extremely
>consistent with the measured reality.
Yep. "Extremely" meaning something like an inconceivable 14 decimal
places. It will be interesting to see if this paper provides a way
around the linearity or not.
[snip]
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
te:
>> At 12:26 PM 5/21/99 -0600, Mike Stay wrote:
>> There are actually two papers on the LANL site that say
>> nonlinear quantum computers imply quantum polynomial time
>> solves NP:
>
>We have, however, quite overwhelming reason to believe that
>the Hamiltonian i
gov/abs/quant-ph/9804025
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
search in log N time instead of sqrt N time.
If today's paper is correct, then it's just a matter of sufficient
technology to break ANY code with a known-plaintext attack.
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
d shall not, by reason of the launching
of such vehicle, be considered an export for purposes of this
subchapter...
That should make the Software Publisher's Association happy."
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
pting anything with symmetric keys) without paying royalties?
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
14 matches
Mail list logo