Advertisement

An Introduction to the Theory of Unconditional Secrecy and Authentication

  • A. Sgarro
Part of the International Centre for Mechanical Sciences book series (CISM, volume 313)

Abstract

A few insecure ciphers, a seemingly secure cipher and a provably secure ciphers are described to illustrate the basic points in Shannon-theoretic cryptography. Lower bounds for authentication codes in Simmons’ authentication theory are given.

Keywords

Success Probability Authentication Code Prob Ability Reduction Formula Plaintext Attack 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. /1/.
    C. A. Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J., vol. 28, Oct. 1949, pp. 656–715CrossRefMATHMathSciNetGoogle Scholar
  2. /2/.
    A. Sgarro, Equivocations for homophonic ciphers, in Advances in cryptology, ed. by Th.Bet, N.Cot and I.Ingemarsson, Lecture Notes in Computer Science 209, Springer Verlag, 1985, pp. 51–61Google Scholar
  3. /3/.
    J. L. Massey, An introduction to contemporary cryptology, Proceedings of the IEEE, May 1988, pp. 533–549Google Scholar
  4. /4/.
    Ch. G. Günther A universal algorithm for homophonic coding, in Advances in Cryptology — EUROCRYPT 88, ed. by Ch.G.Günther, Lecture Notes in Computer Science 330, Springer Verlag, 1988, pp. 405–414Google Scholar
  5. /5/.
    H. N. Jendal, Y. J. B. Kuhn, J. L. Massey, An information-theoretic analysis of Günther’s homophonic substitution scheme,Proceedings of Eurocrypt 89, to be published by Springer VerlagGoogle Scholar
  6. /6/.
    R. J. Blom, Bounds on key equivocation for simple substitution ciphers, IEEE Trans. Info. Th., vol. IT 25, Jan. 1979, pp. 8–18CrossRefMATHMathSciNetGoogle Scholar
  7. /7/.
    J. G. Dunham, Bounds on message equivocations for simple substitution ciphers, IEEE Trans. Info. Th., vol. IT 26, Sept. 1988, pp. 522–527CrossRefMathSciNetGoogle Scholar
  8. /8/.
    A. Sgarro, Error probabilities for simple substitution ciphers, IEEE Trans. Info. Th., vol. IT 29, March 1983, pp. 190–198CrossRefMATHMathSciNetGoogle Scholar
  9. /9/.
    A. Sgarro, Equivocations for transposition ciphers,Rivista di matematica per le scienze economiche e sociali, Anno 8, Fasc. 2., pp. 107–114Google Scholar
  10. /10/.
    A. Sgarro, Simple substitution ciphers, in Secure digital communications ed. by G. Longo, CISM Courses and Lectures N.279, Springer Verlag, 1983, pp. 61–77Google Scholar
  11. /11/.
    A. Sgarro, Information-theoretic versus decision-theoretic cryptography, Elektrotechnik und Maschinenbau (now: Elektrotechnik und Informationstechnik), Heft 12, Dez. 1987, pp. 562–564Google Scholar
  12. /12/.
    I. Csiszàr, J. Körner, Information theory, Academic Press, 1981Google Scholar
  13. /13/.
    A. Sgarro, Informational divergence bounds for authentication codes, Proceedings of Eurocrypt 89, in press for Springer VerlagGoogle Scholar
  14. /14/.
    G.J. Simmons, A survey of information authentication, Proceedings of the IEEE, May 1988, pp. 603–620Google Scholar
  15. /15/.
    D.R. Stinson, Some constructions and bounds for authentication codes. Journal of Cryptology, 11 (1988) pp. 37–52MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Wien 1990

Authors and Affiliations

  • A. Sgarro
    • 1
    • 2
  1. 1.Università di UdineUdineItaly
  2. 2.Università di TriesteTriesteItaly

Personalised recommendations