My solution is a two steps process.

Step 1

1. Create a base permutation

Step 2

2. Create a sequence of values based on the whole password

3. Now, taking advantage of having a card deck handy, mix up the base permutation using the sequence just created.

setup a 26 cards deck (using red cards or rblack cards as you wish), order these 26 cards in the order of the base permutation, face up (remember, each card is assigned a letter, eg. $1\diamondsuit$=A, $2\diamondsuit$=B, $...$, $Q\diamondsuit$=L, $K\diamondsuit$=M, $1\heartsuit$=N, $2\heartsuit$=O, $...$, $Q\heartsuit$=Y, $K\heartsuit$=Z).

For each value of the resulting sequence of point 2, deal that many cards, face up, one at a time, to make a pile in reverse order (You may create the pile on the table or better, in your other hand. The only important thing is that the cards must be face up and be in reverse order). Then, put the resulting pile under the remaining cards of the deck. Repeat until the sequence is exhausted.

My solution is a three steps process.

Step 1 : Create a base permutation

Step 2 : Create a sequence of values based on the whole password

#Step 3 : mix up the base permutation using the sequence just created.

Taking advantage of having a card deck handy, setup a 26 cards deck (using red cards or black cards as you wish), order these 26 cards in the order of the base permutation, face up (remember, each card is assigned a letter, eg. $1\diamondsuit$=A, $2\diamondsuit$=B, $...$, $Q\diamondsuit$=L, $K\diamondsuit$=M, $1\heartsuit$=N, $2\heartsuit$=O, $...$, $Q\heartsuit$=Y, $K\heartsuit$=Z).

For each value of the resulting sequence of step 2, deal that many cards, face up, one at a time, to make a pile in reverse order (You may create the pile on the table or better, in your other hand. The only important thing is that the cards must be face up and be in reverse order). Then, put the resulting pile under the remaining cards of the deck. Repeat until the sequence is exhausted.

A while ago, I spent time playing with modern field/pen & paper ciphers, especially with Card-Chameleon. Card-Chameleon needs two separate full alphabet permutations as a key. As it's a field/pen & paper cipher, I tried to find a computer-less, math-less, way to generate these permutations from passwords.

Fill in the matrix with the remaining letters, leaving space for letters already present in the password

Read the matrix column by column to get the base permutation

It looks nice but related passwords (eg. PASSWORD, PASWWORD, PASSWORDS, PASSWORDA, PAASSWORD, ...) will produce the very same base permutation. So I needed to do something more to the base permuation, something which takes into account the whole password

Assign to each letter a value equal to its rank in the alphabet

A B C D E F G ...  Y  Z
1 2 3 4 5 6 7 ... 25 26

Group them by 2 instead of 3 (if the password has an odd number of letters, append 0 to the base 3 digits of the last character of the passord to be able to make pairs)

3. Now, taking adavange of having a card deck handy, mix up the letters of the base permutation using the resulting sequence created above.

Order the cards of the deck in the order of the base permutation, face up.

For each value of the resulting sequence of previous point, deal that many cards, face up, one at a time, to make a pile in reverse order (You may create the pile on the table or better, in your other hand. The only important thing is that the cards must be face up and be in reverse order). Then, put the resulting pile under the card deck. Repeat until the sequence is exhausted.

A while ago, I spent time playing with modern field ciphers, especially with Card-Chameleon. Card-Chameleon uses a 52 card deck, assigning a letter to each red and each black card and needs two separate full alphabet permutations as a key. As it's a field I tried to find a computer-less, math-less, way to generate permutations from passwords.

Fill in a matrix under the written down password with the remaining letters, leaving spaces for letters already present in the password

Read the matrix column by column ignoring the spaces to get a base permutation

It looks nice but related passwords (eg. PASSWORD, PASWWORD, PASSWORDS, PASSWORDA, PAASSWORD, ...) will produce the very same base permutation. So I needed to do something more to the base permutation, something which takes into account the whole password

Assign to each letter a value equal to its rank in the alphabet minus 1

A B C D E F G ...  Y  Z
0 1 2 3 4 5 6 ... 24 25

Group these digits by 2 instead of 3 (if the password has an odd number of letters, append 0 to the base 3 digits of the last character of the password to be able to make pairs)

3. Now, taking advantage of having a card deck handy, mix up the base permutation using the sequence just created.

setup a 26 cards deck (using red cards or rblack cards as you wish), order these 26 cards in the order of the base permutation, face up (remember, each card is assigned a letter, eg. $1\diamondsuit$=A, $2\diamondsuit$=B, $...$, $Q\diamondsuit$=L, $K\diamondsuit$=M, $1\heartsuit$=N, $2\heartsuit$=O, $...$, $Q\heartsuit$=Y, $K\heartsuit$=Z).

For each value of the resulting sequence of point 2, deal that many cards, face up, one at a time, to make a pile in reverse order (You may create the pile on the table or better, in your other hand. The only important thing is that the cards must be face up and be in reverse order). Then, put the resulting pile under the remaining cards of the deck. Repeat until the sequence is exhausted.

Group them by 2 instead of 3 (if the password has an odd number of letters, append 0 at the end of the base 3 digits so you can make pairs)

Group them by 2 instead of 3 (if the password has an odd number of letters, append 0 to the base 3 digits of the last character of the passord to be able to make pairs)