Encryption Schemes using Finite Frames and Hadamard Arrays
Ryan C. Harkins, Eric Weber, Andrew Westmeyer · Experimental Mathematics · 2005
We propose a cipher similar to the one-time pad and McEliece cipher based on a subband coding scheme. The encoding process is an approximation to the one-time pad encryption scheme. We present results of numerical experiments that suggest that a brute force attack on the proposed scheme does not result in all possible plaintexts, as the one-time pad does, but the brute force attack does not compromise the system. However, we demonstrate that the cipher is vulnerable to a chosenplaintext attack.