EUROCRYPT 1982: Cryptography pp 71-128

Encrypting by Random Rotations

  • N. J. A. Sloane
Conference paper

DOI: 10.1007/3-540-39466-4_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 149)
Cite this paper as:
Sloane N.J.A. (1983) Encrypting by Random Rotations. In: Beth T. (eds) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, Heidelberg

Abstract

This paper gives some well-known, little known, and new results on the problem of generating random elements in groups, with particular emphasis on applications to cryptography. The groups of greatest interest are the group of all orthogonal n × n matrices and the group of all permutations of a set. The chief application is to A. D. Wyner’s analog scrambling scheme for voice signals.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • N. J. A. Sloane
    • 1
  1. 1.Bell LaboratoriesMathematics and Statistics Research CenterMurray HillUSA

Personalised recommendations