In the `traditional' DC Net, how is absence of a message detected?
If this is a seperately distinguishable outcome of a round, each round may
return three outcomes: `0', `1' and `none'. To represent these quantum
mechanically, you need at least a 3-state quantum system (to make the outcomes
Jaap-Henk Hoepman, [EMAIL PROTECTED], writes:
In the `traditional' DC Net, how is absence of a message detected?
A practical implementation of a DC Net would require multiple protocol
layers. The lowest layer is the "raw" DC net itself, which has the
property that each person sends a bit
Abstract:
Recently, I.C. Wiener published a reverse engineering effort of the RSA
SecurID algorithm. There were few speculations on the security ramifications
of the algorithm in I.C. Wiener's posting, so this note is an effort to
touch upon areas of concern. We have verified that I.C. Wiener's
At 11:20 PM 1/17/01 -0800, [EMAIL PROTECTED] wrote in part:
The probability that Eve's measurement will leave the result unchanged is
3/4, and therefore the probability that she will perturb the result is 1/4.
OK so far. Then, for the case of two measurements,
Eve's chances of perturbing the
John Denker, [EMAIL PROTECTED], writes:
Eve need not limit herself to snooping "the signal". What she really wants
to know is the "state of mind" of the participants, i.e. the settings of
their rotators. If she knows that, she knows everything. She can, as a
final step, synthesize a
