Skip to content

Conversation

@nktrejo2020
Copy link
Contributor

Up to line 321

Up to line 321
XOR, as we've just defined it, operates only on single bits or Boolean
values. Since we usually deal with values comprised of many bits, most
programming languages provide a “bitwise XOR” operator: an operator that
XOR, as defined, only operates on single bits or Boolean
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

"as defined" is a little tricky. XOR is a binary operation so doesn't have to be single bits or Boolean values.

more) recipients. We can compute the ciphertext by taking the bitwise
XOR of the two sequences of bits.
Suppose we translate our plaintext into a sequence of bits. We
have the pad of random bits that are shared between the sender and the recipients (one or
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

"translate our plaintext into a sequence of bits" doesn't give the pad to the sender and the recipient.
also that needs to be assumed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants