Critique of the related-key attack concept (Q2430685): Difference between revisions

The author describes a new related-key attack against generic ciphers which requires \(O(1)\) work to distinguish a cipher from random and \(O({\text{key length}})\) to recover the key. This attack makes questionable the related-key attacks that have been considered earlier and seems to require re-formulation of the whole concept of related-key attack.