Volume 149 of the series Lecture Notes in Computer Science pp 71-128


Encrypting by Random Rotations

  • N. J. A. SloaneAffiliated withBell Laboratories, Mathematics and Statistics Research Center

* Final gross prices may vary according to local VAT.

Get Access


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.