Open Access
Translator Disclaimer
2005 Encryption Schemes using Finite Frames and Hadamard Arrays
Ryan Harkins, Eric Weber, Andrew Westmeyer
Experiment. Math. 14(4): 423-433 (2005).

Abstract

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.

Citation

Download Citation

Ryan Harkins. Eric Weber. Andrew Westmeyer. "Encryption Schemes using Finite Frames and Hadamard Arrays." Experiment. Math. 14 (4) 423 - 433, 2005.

Information

Published: 2005
First available in Project Euclid: 10 January 2006

zbMATH: 1090.94019
MathSciNet: MR2193805

Subjects:
Primary: 68P25 , 94A6-
Secondary: 42C99

Keywords: cryptography , finite frames , Random matrix

Rights: Copyright © 2005 A K Peters, Ltd.

JOURNAL ARTICLE
11 PAGES


SHARE
Vol.14 • No. 4 • 2005
Back to Top