According to the article, the scheme depends on this seekrit algorithm for picking all the combinations, called "combinatorial condensation". That term links t

According to the article, the scheme depends on this seekrit algorithm for picking all the combinations, called "combinatorial condensation". That term links to an article in Romanian, which I can't read. But honestly, why's it supposed to be hard to list all possible combinations of 6 of the first 50 integers? Isn't that the same as listing all 6-digit integers in base 50? [Edit] ...Yeah, you also have to filter-out all those integers with repeated digits, but that hardly needs a super-seekrit algorithm.