Advertisement

Wyner’s Analog Encryption Scheme: Results of a Simulation

  • Burt S. Kaliski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 196)

Abstract

This paper presents the results of a simulation of an analog encryption scheme. The scheme, introduced in 1979 by Aaron Wyner of Bell Telephone Laboratories, provides secure, accurate scrambling of speech waveforms, while conforming to the bandlimitedness of a telephone channel. The simulation confirms the scheme’s theoretical properties, based on numerical measures and on listening to encrypted and decrypted waveforms.

Keywords

Vector Product Output Space Hadamard Matrice Bell Telephone Laboratory Speech Waveform 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Wyner, A.D. (1979a) “An analog encryption scheme which does not expand bandwidth — Part I: Discrete time,” IEEE Trans. Inform. Theory, 25.Google Scholar
  2. Wyner, A.D. (1979b) “An analog encryption scheme which does not expand bandwidth — Part II: Continuous time,” ibid.Google Scholar
  3. Sloane, N.J.A. (1983) “Encrypting by random rotations,” in “ Cryptography,” Lecture Notes in Computer Science, 149, Springer-Verlag, Berlin.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Burt S. Kaliski
    • 1
  1. 1.MIT Laboratory for Computer ScienceCambridgeUSA

Personalised recommendations