Skip to main content

Analog Scrambling by the General Fast Fourier Transform

  • Conference paper
  • First Online:
Cryptography (EUROCRYPT 1982)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 149))

Included in the following conference series:

Abstract

There are many different methods in use to scrample voice signals. Two of them seem to be of special importance: band-splitting and time-division. In existing devices for scrambling analog signals often only on of these methods is implemented. However, newer equipment, which is realized by digital circuitry, allow us to use both methods, band splitting and time division, at the same time.

The work presented in this paper was partially supported by the Oesterreichischen Fonds zur Foerderung der Wissenschaftlichen Forschung under EWF-Project Nr 4141.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fellner, H.: Master Thesis (in German), Institut fur System-wissenschaften, Universität Linz, 1982

    Google Scholar 

  2. Karpovsky, M.G.: Fast Fourier Transforms on Finite Non-Abelian Groups, IEEE Trans. on Computers, Vol. C-26, No. 10, October, 1977, pp. 1028–1030.

    Article  MathSciNet  Google Scholar 

  3. Kunz, H.: Approximation optimaler linearer Transformationen durch eine Klasse schneller, verallgemeinerter, Fourier-Transformationen. Dissertation ETH5832, Zurich, Juris Druck & Verlag, Zurich, 1977.

    Google Scholar 

  4. Nicholson, P.: Algebraic Theory of Finite Fourier Transforms. Journal of Comp. and Systems Sc. 5 (1971), pp. 524–547.

    MATH  MathSciNet  Google Scholar 

  5. Pichler, F.: Fast Linear Methods for Image Filtering, in: Applications of Information and Control Systems (D.G. Lainiotis and N.S. Tzannes, eds.) Reidel Publishing Corp., Denhaag, 1980, pp. 3–11.

    Google Scholar 

  6. Rudin, W.: Fourier Analysis on Groups Interscience, New York, 1962.

    Google Scholar 

  7. N.J.A. Sloane: “Encryption by Random Rotations” Lecture presented at the “Workshop on Cryptography” Burg Feuerstein March 29–April 2, 1982 organized by Institut fur Mathematische Maschinen und Datenverarbeitung, Universität Erlangen (Thomas Beth).

    Google Scholar 

  8. Wyner, A.D.: An Analog Scrambling Scheme which does not Expand Bandwith, IEEE Trans. on Informational Theory, Vol. 25, Part I (May 1979), Part II (July 1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pichler, F. (1983). Analog Scrambling by the General Fast Fourier Transform. In: Beth, T. (eds) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39466-4_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-39466-4_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11993-7

  • Online ISBN: 978-3-540-39466-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics