Skip to main content
SpringerLink
Log in

Encrypting by Random Rotations

  • 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

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.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  • Abramowitz, M. and Stegun, I. A. (1972), Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, US. Dept. Commerce, Washington, D.C.

    MATH  Google Scholar 

  • Ahrens, J. H. and Dieter, U. (1972), Computer methods for sampling from the exponential and normal distributions, Commun. ACM, 15, 873–882.

    Article  MATH  MathSciNet  Google Scholar 

  • Ahrens, J. H. and Dieter, U. (1973). Extensions of Forsythe’s method for random sampling from the normal distribution, Math. Comp., 27, 927–937.

    Article  MATH  MathSciNet  Google Scholar 

  • Atkinson, A. C. and Pearce, M. C. (1976), The computer generation of beta, gamma and normal random variables, J. Royal Statist. Soc., A139, 431–461.

    MathSciNet  Google Scholar 

  • Auerbach, H. (1933–34), Sur les groups linéaires bornés, Studia Math., 4, 113–127 and 158–166; 5, 43–49.

    MATH  Google Scholar 

  • Ayoub, F. (1981), Encryption with keyed random permutations, Electronics Letters, 17, 583–585.

    Article  MathSciNet  Google Scholar 

  • Baer, R. M. and Brock, P. (1968), Natural sorting over permutation spaces, Math. Comp., 22, 385–410.

    Article  MathSciNet  Google Scholar 

  • Berlekamp, E. R. (1968), Algebraic Coding Theory, McGraw-Hill, New York.

    MATH  Google Scholar 

  • Bernhard, R. (1982), Breaching system security, IEEE Spectrum, 19 (No. 6), 24–31.

    Google Scholar 

  • Bloomfield, P. (1976), Fourier Analysis of Time Series: An Introduction. Wiley, New York.

    MATH  Google Scholar 

  • Blum, L., Blum, M. and Shub, M. (1982), A simple secure pseudo-random number generator, presented at “Crypto 82”, Univ. of Calif., Santa Barbara, August 1982.

    Google Scholar 

  • Boothby, W. M. and Weiss, G. L., editors (1972), Symmetric Spaces, Dekker, New York.

    MATH  Google Scholar 

  • Bourbaki, N. (1968), Groups et algebras de Lie, Chap. 4–6, Hermann, Paris.

    Google Scholar 

  • Bovey, J. D. (1980), The probability that some power of a permutation has small degree. Bull. London Math. Soc., 12, 47–51.

    Article  MATH  MathSciNet  Google Scholar 

  • Bovey, J. D. and Williamson, A. (1978), The probability of generating the symmetric group, Bull. London Math. Soc., 10, 91–96.

    Article  MATH  MathSciNet  Google Scholar 

  • Box, G. E. P. and Muller, M. E. (1958), A note on the generation of normal deviates, Annals Math. Stat., 29, 610–611.

    Article  MATH  Google Scholar 

  • Brent, R. P. (1974), A Gaussian pseudo-random number generator, Commun. ACM, 17, 704–706.

    Article  MATH  Google Scholar 

  • Brigham, E. O. (1974), The Fast Fourier Transform. Prentice-Hall, Englewood Cliffs, N.J.

    MATH  Google Scholar 

  • Bright, H. S. and Enison, R. L. (1979), Quasi-random number sequences from a long-period TLP generator with remarks on application to cryptography, Computing Surveys, 11, 357–370.

    Article  MATH  Google Scholar 

  • Brillinger, D. R. (1973), Time Series: Data Analysis and Theoty, Holt, Rinehart and Winston, New York.

    Google Scholar 

  • Brown, G. W. (1956), Monte Carlo methods, in Modern Mathematics for the Engineer, edited E. F. Beckenbach, McGraw-Hill, New York, pp. 279–303.

    Google Scholar 

  • Brown, M. and Solomon, H. (1979): On combining pseudorandom number generators, Ann. Statistics, 7, 691–695.

    Article  MATH  MathSciNet  Google Scholar 

  • Cartan, E. (1966), The Theory of Spinors, Hermann, Paris. Reprinted by Dover Publications, New York, 1981.

    MATH  Google Scholar 

  • Chambers, R. P. (1967), Random-number generation, IEEE Spectrum, 4 (No. 2), 48–56.

    Article  Google Scholar 

  • Chatfield, C. (1975), The Analysis of Time Series: Theory and Practice, Chapman and Hall, London.

    MATH  Google Scholar 

  • Conway, J. H., Parker, R. A. and Sloane, N. J. A. (1982), The covering radius of the Leech lattice, Proe. Royal Soc. London, A 380, 261–290.

    Article  MATH  MathSciNet  Google Scholar 

  • Cook, J. M. (1957). Rational formulae for the production of a spherically symmetric probability distribution, Math. Tables Other Aids Comp., 11, 81–82.

    MATH  Google Scholar 

  • Cook, J. M. (1959), Remarks on a recent paper, Commun. ACM, 2 (No. 10), 26.

    Google Scholar 

  • Coppersmith, D. and Grossman, E. (1975), Generators for certain alternating groups with applications to cryptography, SIAM J. Applied Math., 29, 624–627.

    Article  MATH  MathSciNet  Google Scholar 

  • Coxeter, H. S. M. (1973), Regular Polytopes, Dover, New York, third edition.

    Google Scholar 

  • Davis, R. M. (1978), The Data Encryption Standard in perspective. IEEE Communications Society Magazine, 16 (November), 5–9.

    Article  Google Scholar 

  • Deak, I. (1979), Comparison of methods for genercting uniformly distributed random points in and on a hypersphere, Problems of Control and Information Theory, 8, 105–113.

    MATH  MathSciNet  Google Scholar 

  • Diaconis, P. (1980), Average running time of the fast Fourier transform, J. Algorithms, 1, 187–208.

    Article  MATH  MathSciNet  Google Scholar 

  • Diaconis, P. (1982), Group Theory in Statistics, lecture notes, Harvard University.

    Google Scholar 

  • Diaconis, P. and Graham, R. L. (1977), Spearman’s footrule as a measure of disarray, J. Royal Stat. Soc., B 39, 262–268.

    MATH  MathSciNet  Google Scholar 

  • Diaconis, P., Graham, R. L., and Kantor, W. M. (1982), The mathematics of perfect shuffles, Advances in Applied Math., in press.

    Google Scholar 

  • Diaconis, P. and Shahshahani, M. (1981), Generating a random permutation with random transpositions, Z. Wahrscheinlichkeitstheorie, 57, 159–179.

    Article  MATH  MathSciNet  Google Scholar 

  • Diaconis, P. and Shahshahani, M. (1982), Factoring probabilities on compact groups, preprint.

    Google Scholar 

  • Dieter, U. and Ahrens, J. H. (1973), A combinatorial method for the generation of normally distributed random variables, Computing, 11, 137–146.

    Article  MATH  MathSciNet  Google Scholar 

  • Diffie, W. and Hellman, M. E. (1976), A critique of the proposed Data Encryption Standard, Commun. ACM, 19, 164–165.

    Google Scholar 

  • Diffie, W. and Hellman, M. E. (1977), Exhaustive analysis of the NBS Data Encryption Standard, Computer, 10, 74–84.

    Article  Google Scholar 

  • Dixon, J. D. (1969), The probability of generating the symmetric group, Math. Zeit., 110, 199–205.

    Article  MATH  MathSciNet  Google Scholar 

  • Durstenfeld, R. (1964), Random permutation, Commun. ACM, 7, 420.

    Article  Google Scholar 

  • Eaton, M. L. and Perlman, M. (1977), Generating O(n) with reflections, Pacific J. Math., 73, 73–80.

    MathSciNet  Google Scholar 

  • Even, S. and Goldreich, O. (1981), The minimum-length generator sequence problem is NP-hard, J. Algorithms, 2, 311–313.

    Article  MATH  MathSciNet  Google Scholar 

  • Feistel, H. (1973), Cryptography and computer privacy, Scientific American, 228 (May), 15–23.

    Article  Google Scholar 

  • Feistel, H., Notz, W. A. and Smith, J. L. (1975), Some cryptographic techniques for machine-to-machine data communications, Proc. IEEE, 63, 1545–1554.

    Article  Google Scholar 

  • Feller, W. (1957), An Introduction to Probability Theory and Its Applications, Volume I, Wiley, New York, second edition.

    MATH  Google Scholar 

  • Fienberg, S. E. (1971), Randomization and social affairs: the 1970 draft lottery, Science, 167 (22 January), 255–261.

    Article  Google Scholar 

  • Fino, B. J. and Algazi, V. R. (1976), Unified matrix treatment of the fast Walsh-Hadamard transform, IEEE Trans. Computers, C-25, 1142–1146.

    Article  MathSciNet  Google Scholar 

  • Fox, P. A., editor (1976), The PORT Mathematical Subroutine Library, Bell Laboratories, Murray Hill, New Jersey.

    Google Scholar 

  • Furstenberg, H. (1980), Random walks on Lie groups, in Harmonic Analysis and Representations of Semisimple Lie Groups, edited by J. A. Wolf et al., Reidel Publ., Dordrecht, Holland, pp. 467–489.

    Google Scholar 

  • Geffe, P. R. (1967), An open letter to communication engineers, Proc. IEEE, 55, 2173.

    Article  Google Scholar 

  • Geramita, A. V. and Seberry, J. (1979), Orthogonal Designs, Dekker, New York.

    MATH  Google Scholar 

  • Girsdansky, M. B. (1971), Data privacy—cryptology and the computer at IBM Research, IBM Research Reports, 7 (No. 4), 12 pages. Reprinted in Computers and Automation, 21 (April, 1971), 12–19.

    Google Scholar 

  • Golomb, S. W. (1964), Random permutations, Bull. Amer. Math. Soc., 70, 747.

    Article  MathSciNet  Google Scholar 

  • Goncharov, V. (1944), Du domaine d’analyse combinatoire (Russian, French summary), Bull. de 1’Académie URSS, Sér. Math. 8, 3–48. English translation in Amer. Math. Soc. Translations, (2) 19 (1962), 1–46.

    MATH  Google Scholar 

  • Good, I. J. (1 958), The interaction algorithm and practical Fourier analysis, J. Roy. Stat. Soc. B 20, 361–372 and B 22, 372–375.

    MathSciNet  Google Scholar 

  • Grenander, U. (1963), Probability on Algebraic Structures. Wiley, New York.

    Google Scholar 

  • Guivarc’h, Y., Keane, M. and Roynette, B. (1977), Marches aleatoires sur les groups de Lie, Lecture Notes in Math. 624, Springer-Verlag, New York.

    Google Scholar 

  • Hall, M., Jr. (1967), Combinatorial Theory, Blaisdell, Waltham, Mass.

    MATH  Google Scholar 

  • Hall, M., Jr. (1975), Semi-automorphisms of Hadamard matrices, Math. Proc. Camb. Phil. Soc., 77, 459–473.

    Article  MATH  Google Scholar 

  • Halmos, P. R. (1950), Measure Theory, Van Nostrand, Princeton, N.J.

    MATH  Google Scholar 

  • Halmos, P. R. (1956), Lectures on Ergodic Theory, Chelsea, New York.

    MATH  Google Scholar 

  • Hammersley, J. H. (1972), A few seedlings of research, in Proc. Sixth Berkeley Symp. Math. Stat. and Prob., Vol. 1, pp. 345–394.

    MathSciNet  Google Scholar 

  • Hannan, E. J. (1960), Time Series Analysis, Methuen, London.

    MATH  Google Scholar 

  • Harwit, M. and Sloane, N. J. A. (1979), Hadamard Transform Optics, Academic Press, New York.

    MATH  Google Scholar 

  • Heiberger, R. M. (1978), Generation of random orthogonal matrices, Applied Statistics, 27, 199–206.

    Article  MATH  Google Scholar 

  • Hess, P. and Wirl, K. (1983), A voice scrambling system for testing and demonstration, in this volume.

    Google Scholar 

  • Hewitt, E. and Ross, K. A. (1963–1970), Abstract Harmonic Analysis, 2 vols., Springer-Verlag, New York.

    MATH  Google Scholar 

  • Heyer, H. (1977), Probablity Measures on Locally Compact Groups, Springer-Verlag, New York.

    Google Scholar 

  • Heyer, H., editor (1982), Probability Measures on Groups. Lecture Notes in Math. 928, Springer-Verlag, New York.

    MATH  Google Scholar 

  • Hicks, J. S. and Wheeling, R. F. (1959), An efficient method for generating uniformly distributed points on the surface of an n-dimensional sphere, Commun. ACM, 2 (No.4), 17–19.

    Article  MATH  Google Scholar 

  • Hopf, E. (1937), Ergodenthorie, J. Springer, Berlin. Reprinted by Chelsea, New York. 1948.

    Google Scholar 

  • Humphreys, J. E. (1972), Introduction to Lie Algebras and Representation Theory, Springer-Verlag, New York, second printing.

    MATH  Google Scholar 

  • Ito, N., Leon, J. S. and Longyear, J. Q. (1981), Classification of 3-(24,12.5) designs and 24-dimensional Hadamard matrics, J. Combinatorial Theory, A31, 66–93.

    Article  MathSciNet  Google Scholar 

  • Jansson, B. (1966), Random Number Generators, Stockholm.

    Google Scholar 

  • Jayant, N. S. (1982), Analog scramblers for speech privacy. preprint.

    Google Scholar 

  • Kantor, W. M. (1969), Automorphism groups of Hadamard matrices, J. Combinatorial Theory, 6, 279–281.

    Article  MATH  MathSciNet  Google Scholar 

  • Kantor, W. M. (1982), Polynomial-time perfect shuffling. preprint.

    Google Scholar 

  • Kendall, M. (1970), Rank Correlation Methods, Griffin, London, fourth edition.

    Google Scholar 

  • Kennedy, W. J., Jr. and Gentle, J. E. (1980), Statistical Computing, Dekker, New York.

    MATH  Google Scholar 

  • Knop, R. E. (1970), Random vectors uniform in solid angle, Commun. ACM, 13, 326.

    Article  Google Scholar 

  • Knuth, D. E. (1980), Deciphering a linear congruential encryption, Report STAN-CS-80-800, Computer Science Dept., Stanford Univ., Stanford, Calif.

    Google Scholar 

  • Knuth, D. E. (1981), The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, Reading Mass., second edition.

    Google Scholar 

  • Lewis, T. G. (1975), Distribution Sampling for Computer Simulation, Lexington Books, Lexington, Mass.

    MATH  Google Scholar 

  • Li, T. Y. and Yorke, J. A. (1978), Ergodic maps on [0,1] and nonlinear pseudorandom number generators, Nonlinear Analysis, Theory, Methods and Applications, 2, 473–481.

    Article  MATH  MathSciNet  Google Scholar 

  • Lloyd, S. P. (1977), Random rotation secrecy systems, unpublished memorandum, Bell Laboratories, Murray Hill, N.J.

    Google Scholar 

  • Lloyd, S. P. (1978), Choosing a rotation at random, unpublished memorandum, Bell Laboratories, Murray Hill, N.J.

    Google Scholar 

  • Logan, B. F. and Shepp, L. A. (1977), A variational problem for random Young tableaux, Advances in Math., 26, 206–222.

    Article  MATH  MathSciNet  Google Scholar 

  • McGonegal, C. A., Berkley, D. A. and Jayant, N. S. (1981), Private communications, Bell Syst. Tech. J. 60, 1563–1572.

    Google Scholar 

  • MacKinnon, N. R. F. (1980), The development of speech encipherment, Radio and Electronic Engineer, 50, No. 4, 147–155.

    Article  Google Scholar 

  • MacLaren, M. D. and Marsaglia (1965), Uniform random number generators, J. Assoc. Comput. Mach., 12, 83–89.

    MATH  MathSciNet  Google Scholar 

  • MacWilliams, F. J. and Sloane, N. J. A. (1981), The Theory of Error-Correcting Codes, North-Holland, Amsterdam.

    Google Scholar 

  • Marsaglia, G. (1972), Choosing a point from the surface of a sphere, Annals. Math. Stat., 43, 645–646.

    Article  MATH  Google Scholar 

  • Marsaglia, G., Ananthanarayanan, K., and Paul, N. (1973), Random number generator package — “Super-Duper”, School of Computer Science, McGill University, Montreal, Quebec.

    Google Scholar 

  • Marsaglia, G., Ananthanarayanan, K., and Paul, N. J. (1976), Improvements on fast methods for generating normal random variables, Information Processing Letters, 5 (No. 2), 27–30.

    Article  MATH  MathSciNet  Google Scholar 

  • Marsaglia, G. and Bray, T. A. (1964), A convenient method for generating normal variables, SLAM Review, 6, 260–264.

    Article  MATH  MathSciNet  Google Scholar 

  • Massey, J. L. (1969), Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory, IT-15, 122–127.

    Article  MathSciNet  Google Scholar 

  • Meyer, C. H. and Tuchman, W. L. (1972), Pseudorandom codes can be cracked, Electronic Design, 20 (Nov. 9), 74–76.

    Google Scholar 

  • Mihram, G. A. (1972), Simulation: Statistical Foundations and Methodology, Academic Press, New York.

    MATH  Google Scholar 

  • Moore, C. C., editor (1973), Harmonic Analysis on Homogeneous Spaces, Proc. Sympos. Pure Math. 26, Amer. Math, Soc., Providence, Rhode Island.

    Google Scholar 

  • Morris, R. (1978), The Data Encryption Standard — retrospective and prospects, IEEE Communications Society Magazine, 16 (November), 11–14.

    Article  Google Scholar 

  • Morris, R., Sloane, N. J. A. and Wyner, A. D. (1977), Assessment of the National Bureau of Standards proposed Federal Data Encryption Standard, Cryptologia, 1, 281–306.

    Article  Google Scholar 

  • Muller, M. E. (1959), A note on a method for generating points uniformly on n-dimensional spheres, Commun. ACM, 2 (No. 4), 19–20.

    Article  MATH  Google Scholar 

  • Von Neumann, J. (1951), Various techniques used in connection with random digits, in Monte Carlo Methods, National Bureau of Standards Applied Math. Series 12, U. S. Dept. Commerce, Washington, D.C. pp. 36–38.

    Google Scholar 

  • Niederreiter, H. (1978), Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc., 84, 957–1041.

    Article  MATH  MathSciNet  Google Scholar 

  • Nijenhuis, A. and Wilf, H. S. (1978), Combinatorial Algorithms, Academic Press, New York, second edition.

    MATH  Google Scholar 

  • Page, E. S. (1967), A note on generating random permutations, Applied Statist., 16, 273–274.

    Article  Google Scholar 

  • Plackett, R. L. (1968), Random permutations. J. Royal Stat. Soc., 30, 517–534.

    MATH  MathSciNet  Google Scholar 

  • Pratt, W. K. (1969), An algorithm for a fast Hadamard matrix transform of order twelve, IEEE Trans. Computers, C-18, 1131–1132.

    Article  Google Scholar 

  • Pratt, W. K., Kane, J. and Andrews, H. C. (1969), Hadamard transform image coding, Proc. IEEE, 57, 58–68.

    Article  Google Scholar 

  • Reeds, J. (1977), “Cracking” a random number generator, Cryptologia, 1 (No. 1), 20–26.

    Article  MathSciNet  Google Scholar 

  • Reeds, J. (1979), Cracking a multiplicative congruential encryption algorithm. in Information Linkage Between Applied Mathematics and Industry (Proc. First Annual Workshop, Naval Postgraduate School, Monterey, Calif., 1978), Academic Press, New York, pp. 467–472.

    Google Scholar 

  • Reeds, J. (1979a), Solution of challenge cipher, Cryptologia, 3, 83–95.

    Article  Google Scholar 

  • Riordan, J. (1958), An Introduction to Combinatorial Analysis, Wiley, New York.

    MATH  Google Scholar 

  • Robbins, D. P. and Bolker, E. D. (1981), The bias of three pseudo-random shuffles. Aequationes Math., 22, 268–292.

    Article  MATH  MathSciNet  Google Scholar 

  • Rose, D. J. (1980), Matrix identities of the fast Fourier transform, Linear Alg. Applic., 29, 423–443.

    Article  MATH  Google Scholar 

  • Rosenblatt, J. R. and Filliben, J. J. (1971), Randomization and the draft lottery, Science, 167 (22 January), 306–308.

    Article  Google Scholar 

  • Sakasegawa, H. (1978), On generation of normal pseudo-random numbers. Ann. Inst. Statist. Math., A30, 271–279.

    Article  MathSciNet  Google Scholar 

  • Schmeiser, B. W. (1980), Random variate generation: a survey, in Simulation with Discrete Models: A State-of-the-Art Survey, edited by T. I. Oren, C. M. Shub and P. F. Roth, IEEE Press, New York.

    Google Scholar 

  • Schrack, G. F. (1972), Remark on Algorithm 381, Commun. ACM, 15, 468.

    Article  Google Scholar 

  • Schwerdtfeger, H. (1950), Introduction to Linear Algebra and the Theory of Matrices, Noordhoff, Groningen.

    MATH  Google Scholar 

  • Shamir, A. (1981), The generation of cryptographically strong pseudo-random sequences, presented at “Crypto 81”, Univ. of Calif., Santa Barbara, August 1981.

    Google Scholar 

  • Shannon, C. E. (1949), Communication theory of secrecy systems, Bell Syst. Tech. J., 28, 656–715.

    MathSciNet  MATH  Google Scholar 

  • Shepp, L. A. and Lloyd, S. P. (1966), Ordered cycle lengths in a random permutation, Trans. Amer. Math. Soc., 121, 340–357.

    Article  MATH  MathSciNet  Google Scholar 

  • Sibuya, M. (1964), A method for generating uniformly distributed points on n-dimensional spheres, Ann. Inst. Stat. Math., 14, 81–85.

    Article  MathSciNet  Google Scholar 

  • Slepian, D. (1978), Prolate spheroidal wave functions. Fourier analysis, and uncertainty, Part V: the discrete case, Bell Syst. Tech. J., 57, 1371–1430.

    Google Scholar 

  • Sloane, N. J. A. (1981), Error-correcting codes and cryptography, in The Mathematical Gardner, edited by D. A. Klarner, Prindle, Weber and Schmidt, Boston, pp. 346–382. Reprinted in Cryptologia, 6 (1982), 128–153 and 258–278.

    Google Scholar 

  • Smith, J. L. (1971), The design of Lucifer. a cryptographic device for data communicazions, Report RC-3326, IBM Thomas Watson Research Center, Yorktown Heights, N.Y.

    Google Scholar 

  • Stewart, G. W. (1980), The efficient generation of random orthogonal matrices with an application to condition estimators, SIAM J. Numer. Anal., 17, 403–409.

    Article  MATH  MathSciNet  Google Scholar 

  • Tashiro, Y. (1977), On methods for generating uniform random points on the surface of a sphere. Ann. Inst. Stat. Math., A29, 295–300.

    Article  MathSciNet  Google Scholar 

  • Turyn, R. J. (1974), Hadamard matrices, Baumert-Hall units, four-symbol sequences, pulse compression, and surface wave encodings, J. Combinatorial Theory, 16A, 313–333.

    Article  MathSciNet  Google Scholar 

  • Veršik, A. M. and Kerov, S. V. (1977), Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tableaux (Russian), Dokl. Akad. Nauk SSSR, 233, No. 6. English translation in Soviet Math. Doklady, 18 (1977), 527–531.

    Google Scholar 

  • Wallis, W. D., Street, A. P. and Wallis, J. S. (1972), Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Math., 292, Springer-Verlag, New York.

    Google Scholar 

  • Walter, P. (1981), An Introduction to Ergodic Theory, Springer-Verlag, Berlin and New York.

    Google Scholar 

  • Warner, G. (1972), Harmonic Analysis on Semi-Simple Lie Groups, 2 vols., Springer-Verlag, New York.

    Google Scholar 

  • Wyner, A. D. (1979), An analog scrambling scheme which does not expand bandwidth, Part I: discrete time, IEEE Trans. Inform. Theory, IT-25, 261–274.

    Article  MathSciNet  Google Scholar 

  • Wyner, A. D. (1979a), An analog scrambling scheme which does not expand bandwidth. Part II: continuous times, IEEE Trans. Inform. Theory, IT-25, 415–425.

    Article  MathSciNet  Google Scholar 

  • Yao, A. C. (1982), private communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Laboratories, Mathematics and Statistics Research Center, Murray Hill, New Jersey, 07974, USA

    N. J. A. Sloane

Authors
  1. N. J. A. Sloane
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematische Maschinen und Datenverarbeitung (Informatik 1), Friedrich-Alexander Universität Erlangen-Nürnberg, Martensstr. 3, 8520, Erlangen, FRG

    Thomas Beth

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/3-540-39466-4_6

Download citation

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

  • 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

Search

Navigation