The Luhn mod N algorithm generates a check digit (more precisely, a check character) within the same range of valid characters as the input string.
The main idea behind the extension is that the full set of valid input characters is mapped to a list of code-points (i.e., sequential integers beginning with zero).