query: What's the difference between substitution and permutation in DES?
positive_passages.docid: 111966
positive_passages.text: The exact difference between a permutation and a substitution
negative_passages.docid: 28124
negative_passages.text: What is the difference between currying and partial application?
negative_passages.docid: 3354
negative_passages.text: Permutations[Range[12]] produces an error instead of a list
negative_passages.docid: 106603
negative_passages.text: How to tell if an array is a permutation in O(n)?
negative_passages.docid: 149867
negative_passages.text: Why is `sort < "$f1" ` preferred over `sort -- "$f1"`, and why is this preferred over `sort "$f1"`?
negative_passages.docid: 35274
negative_passages.text: What is wrong with this substitution?
negative_passages.docid: 134597
negative_passages.text: How do substution-permutation networks work?
negative_passages.docid: 22630
negative_passages.text: DES with the bitwise complement of a key
negative_passages.docid: 63211
negative_passages.text: Replacements/Substitutions in Mathematica
negative_passages.docid: 68793
negative_passages.text: Worst-case number of transpositions needed to generate a permutation
negative_passages.docid: 115209
negative_passages.text: Elementary formula for permutations?
negative_passages.docid: 113953
negative_passages.text: Circular permutations with indistinguishable objects
negative_passages.docid: 60416
negative_passages.text: Finding a permutation, and number of, from powers of the permutation
negative_passages.docid: 153721
negative_passages.text: Conjugating a permutation
negative_passages.docid: 48019
negative_passages.text: Explanation circular permutation
negative_passages.docid: 119292
negative_passages.text: How to generate all permutations of an array in sorted order?
negative_passages.docid: 127210
negative_passages.text: Is there any pre-built method for finding all permutations of a given string in JavaScript?