Encrypting by random rotations

Authors:
N. J. A. Sloane
Affiliations:
Mathematics and Statistics Research Center, Bell Laboratories, Murray Hill, New Jersey
Venue:
Proceedings of the 1982 conference on Cryptography
Year:
1982

Citing 16
Cited 6

The fast Fourier transform and its applications

The fast Fourier transform and its applications
Uniform Random Number Generators

Journal of the ACM (JACM)
Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography

ACM Computing Surveys (CSUR)
Remark on algorithm 381 [G5]

Communications of the ACM
Computer methods for sampling from the exponential and normal distributions

Communications of the ACM
Algorithm 488: A Gaussian pseudo-random number generator

Communications of the ACM
Algorithm 381: random vectors uniform in solid angle

Communications of the ACM
Algorithm 235: Random permutation

Communications of the ACM
An efficient method for generating uniformly distributed points on the surface of an n-dimensional sphere

Communications of the ACM
A note on a method for generating points uniformly on n-dimensional spheres

Communications of the ACM
Time series: data analysis and theory

Time series: data analysis and theory
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Remarks on a Recent Paper: "An EfIicient Method for Generating Uniformly Distributed Points on the Surface of an n-Dimen- sional Sphere" (2, No. 4 (1959), 17)

Communications of the ACM
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Computer
Unified Matrix Treatment of the Fast Walsh-Hadamard Transform

IEEE Transactions on Computers
An Algorithm for a Fast Hadamard Matrix Transform of Order Twelve

IEEE Transactions on Computers

Wyner's analog encryption scheme: results of a simulation

Proceedings of CRYPTO 84 on Advances in cryptology
On rotation group and encryption of analog signals

Proceedings of CRYPTO 84 on Advances in cryptology
Time-division multiplexing scramblers: selecting permutations and testing the systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Improving Lattice Based Cryptosystems Using the Hermite Normal Form

CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
On decompositional algorithms for uniform sampling from n-spheres and n-balls

Journal of Multivariate Analysis
A new pseudo-random generator based on gollmann cascades of baker-register-machines

EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory

Quantified Score

Hi-index	0.00

Visualization

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.