I want to know why is it that XOR is ignored in the computation cost of a security protocol? And is there any reference there which can prove that it is insignificant so can be ignored?
Like in a certain research paper it is stated that "In the proposed scheme, we take the
cost of concatenation (||) operations and XOR (⊕) evaluated as insignificant." why is this?
Zeeshan, on the contrary, XOR is commonly used in cryptography.
https://www.quora.com/Why-is-the-XOR-operation-so-common-in-cryptography-and-encoding-digital-data-for-transmission-Why-arent-other-bit-wise-operations-as-ubiquitous
https://www.sciencedirect.com/topics/computer-science/stream-ciphers
I have my own two favorite reasons: (1) it is computationally very efficient, and (2) the ciphertext is no longer than the plaintext. Other operations are possible too, but will typically result in longer ciphertext.
Like in a certain research paper it is stated that "In the proposed scheme, we take the cost of concatenation (||) operations and XOR (⊕) evaluated as insignificant." why is this?
Not sure what this is saying. All I can say is, XOR is very commonly used in cryptography, and that true enough, concatenating two XOR operations is not helpful. In fact, it seems to reduce the entropy of the ciphertext, and provides no security advantage. That's easy to understand. It only takes one other XOR operation, to decrypt something that was encrypted with concatenated XOR.
xor-ing takes a cycle, but looking a table for a substitution or a permutation takes most of the processing time.
The exclusive-or operation is widely used in cryptography. The same XOR function can be used for both encryption and decryption. Also, XOR operation has low computational cost.
- Badges
- Science topic
- Similar topics
- Methodology
- Research Methodology
- Research Papers