Encryption Schemes using Finite Frames and Hadamard Arrays

@article{Harkins2005EncryptionSU,
  title={Encryption Schemes using Finite Frames and Hadamard Arrays},
  author={Ryan Harkins and Eric Weber and Andrew Westmeyer},
  journal={Experimental Mathematics},
  year={2005},
  volume={14},
  pages={423-433}
}
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 which suggest that a brute force attack to the proposed scheme does not result in all possible plaintexts, as the One Time Pad does, but still the brute force attack does not compromise the system. However, we demonstrate that the cipher is vulnerable to a chosen-plaintext… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Frames , Bases , and Group Representations Mem

  • D. Han, D. Larson
  • Amer . Math . Soc .
  • 2000
Highly Influential
2 Excerpts

Oversampling of Fourier Coefficients for Hiding Messages.

  • Miotke, Rebollo-Neira 04 J.R. Miotke, L. RebolloNeira
  • Appl. Comput. Harmon. Anal
  • 2004

Kovacević. “Uniform Tight Frames for Signal Processing and Communications.

  • Casazza, J. Kovacević 01 P. Casazza
  • 2001

Frames, Bases, and Group Representations.

  • Han, Larson 00 D. Han, D. Larson
  • Mem. Amer. Math. Soc
  • 2000

The Art of Frame Theory.

  • P. Casazza
  • Taiwanese Math. J
  • 2000
1 Excerpt

P

  • A. Menezes
  • van Oorschot, and S. Vanstone. Handbook of…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…