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 chosen-plaintext attack.
Publié le : 2005-05-14
Classification:
Cryptography,
finite frames,
random matrix,
94A6-,
68P25,
42C99
@article{1136926973,
author = {Harkins, Ryan and Weber, Eric and Westmeyer, Andrew},
title = {Encryption Schemes using Finite Frames and Hadamard Arrays},
journal = {Experiment. Math.},
volume = {14},
number = {1},
year = {2005},
pages = { 423-433},
language = {en},
url = {http://dml.mathdoc.fr/item/1136926973}
}
Harkins, Ryan; Weber, Eric; Westmeyer, Andrew. Encryption Schemes using Finite Frames and Hadamard Arrays. Experiment. Math., Tome 14 (2005) no. 1, pp. 423-433. http://gdmltest.u-ga.fr/item/1136926973/