Open AccessEncrypting by Random Rotations
Author(s) -
N. J. A. Sloane
Publication year - 2007
Publication title -
cryptography
Language(s) - English
Resource type - Book series
ISSN - 2410-387X
ISBN - 3-540-11993-0
DOI - 10.1007/3-540-39466-4_6
Subject(s) - scrambling , encryption , cryptography , group (periodic table) , set (abstract data type) , computer science , scheme (mathematics) , mathematics , theoretical computer science , combinatorics , arithmetic , discrete mathematics , algorithm , computer network , physics , programming language , mathematical analysis , quantum mechanics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom