In one example, a method includes creating a password having ‘n’ characters that each constitute a byte, placing the characters of the password in a first buffer, generating a random number corresponding to the password, using the random number to map a character in the first buffer to a respective random character present in a second buffer, copying the random character to a third buffer, and removing the mapped character from the first buffer. The mapping, copying, and removing processes are repeated for each character in the first buffer so that the first buffer empties and an ‘xth’ random string of ‘n’ length is generated in the third buffer, the ‘xth’ random string comprising the random characters to which respective characters from the first buffer were mapped. Finally, the ‘xth’ random string is placed in a fourth buffer and constitutes at least a portion of an encryption key.