Infinite Structures in Information Theory

  • G. R. Blakley
  • Laif Swanson


The idea of infinite structures, even of continua, in information theory is not a new one [K056]. This note is devoted to infinite one-time pads [BL81] and an infinite projective geometric [BL79] threshold scheme. Perhaps an infinite structure can be better understood than its finite analog if it is amenable to investigation by methods from calculus or harmonic analysis. It is conceivable that an existing error control code, pool/split/restitute process [AS82], or cryptosystem can be better understood by examining an infinite version.


Complex Projective Space Affine Space Threshold Scheme Uniform Probability Measure Perfect Security 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. AS82.
    C. A. Asmuth and G.R. Blakley, Pooling, splitting and restituting information to overcome total failure of some channels of communication, Proceedings of the 1982 Symposium on Security and Privacy, IEEE Computer Society, Los Angeles, California (1982), pp. 156–169.Google Scholar
  2. BA72.
    H. Bauer, Probability Theory and Elements of Measure Theory, Holt, Rinehart and Winston, New York (1969).Google Scholar
  3. BL79.
    G. R. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies-Conference Proceedings, Vol. 48 (1979), pp. 313–317.Google Scholar
  4. BL80.
    G. R. Blakley, One-time pads are key safeguarding schemes, not cryptosystems. Fast key safeguarding schemes (threshold schemes) exist, Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society, Long Beach, California (1980), pp. 108–113.Google Scholar
  5. BL81.
    G. R. Blakley and Laif Swanson, Security proofs for information protection systems, Proceedings of the 1981 Symposium on Security and Privacy, IEEE Computer Society (1981), Los Angeles, California, pp. 75–82.Google Scholar
  6. BL81b.
    J. Bloom, A note on superfast threshold schemes, Preprint, Texas AM University, Department of Mathematics (1981), and Threshold schemes and error correcting codes, Astracts of Papers Presented to the American Mathematical Society, Vol. 2 (1981), p. 230.Google Scholar
  7. DE82.
    D. E. R. Denning, Cryptography and Data Security, Addison Wesley, Reading, Massachusetts (1982).Google Scholar
  8. GR78.
    P. Griffiths and J. Harris, Principles of Algebraic Geometry, Wiley-Interscience, New York (1978).Google Scholar
  9. K056.
    A. N. Kolmogorov, On the Shannon theory of information in the case of continuous signals, IEEE Transactions on Information Theory, Vol. IT-2 (1956), pp. 102–108, Reprinted as pages 238–244 in D. Slepian (editor), Key Papers in the Development of Information Theory, IEEE Press, New York (1974).Google Scholar
  10. MC67.
    G. McCarty, Topology: An Introduction with Application to Topological Groups, McGraw-Hill, New York (1967).Google Scholar
  11. SH49.
    C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28 (1949), pp. 656–715.Google Scholar
  12. SH79.
    A. Shamir, How to share a secret, Communications of the ACM, vol. 22 (1979), pp. 612–613.CrossRefGoogle Scholar
  13. WA71.
    F. W. Warner, Foundations of Differentiable Manifolds and Lie Groups, Springer-Verlag, New York (1971).Google Scholar
  14. YA68.
    P. B. Yale, Geometry and Symmetry, Holden-Day, San Francisco (1968).Google Scholar

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • G. R. Blakley
    • 1
  • Laif Swanson
    • 2
  1. 1.Department of MathematicsTexas A&M UniversityCollege StationUSA
  2. 2.Communications Systems Research SectionJet Propulsion Laboratory of California Institute of TechnologyPasadenaUSA

Personalised recommendations