On the Security of Compressed Encodings

  • Selim G. Akl


A compressed encoding is a cryptographic function which maps a file of n bits into an m — bit block where m is significantly smaller than n. Such a function finds applications in the protection of file integrity in computer systems and in the computation of digital signatures on electronic messages. This paper discusses the weaknesses and strengths of various implementations of compressed encodings and is intended as a guide to anyone using them in a security environment.


Digital Signature Signed Message Data Encryption Standard Digital Signature Scheme Cipher Block Chain 
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. [1]
    Akl, S.G., Digital signatures with blindfolded arbitrators who cannot form alliances, Proceedings of the 1982 IEEE Symposium on Security and Privacy, Oakland, California, April 26–28, 1982.Google Scholar
  2. [2]
    Akl, S.G. Digital signatures: a tutorial survey, IEEE Computer Vol. 16, No. 2, February 1983, pp. 15–24.Google Scholar
  3. [3]
    Carter, J.L. and Wegman, M.N., Universal classes of hash functions, Journal of Computer and System Sciences Vol. 18, 1979, pp. 143–154.Google Scholar
  4. [4]
    Data Encryption Standard Federal Information Processing Standards (FIPS), Publication 74, National Bureau of Standards, U.S. Department of Commerce, April 1981.Google Scholar
  5. [5]
    Davies, D.W., Applying the RSA signature to electronic mail, Computer Vol. 16, No. 2, February 1983, pp. 55–62.Google Scholar
  6. [6]
    Davies, D.W. and Clayden, D.O., A message authentication algorithm suitable for a main frame computer, NPL Report DITC 17/83, National Physical Laboratory, Teddington, Middlesex, February 1983.Google Scholar
  7. [7]
    Davies, D.W. and Price, W.L., The application of digital signatures based on public-key cryptosystems, Proceedings of the International Conference on Computer Communications, Atlanta, Georgia, October 1980, pp. 525–530.Google Scholar
  8. [8]
    Denning, D.F_.R., Cryptography and Data Security Addison-Wesley, Reading, Massachusetts, 1982.Google Scholar
  9. [9]
    Denning, D.E., A note on strengthening RSA and other public-key cryptosystems, Technical Report CSD-TR-419, Computer Science Department, Purdue University, West Lafayette, Indiana, October 1982.Google Scholar
  10. [10]
    Diffie, W. and Hellman, M., New directions in cryptography, IEEE_ Transactions on Information Theory Vol. IT-22, No. 6, November 1976, pp. 644–654.Google Scholar
  11. [11]
    Gilbert, E.N., MacWilliams, F.J. and Sloane, N.J.A., Codes which detect deception, _The Bell System Technical Journal s Vol. 53, No. 3, March 1974, pp. 405–424.Google Scholar
  12. [12]
    Jueneman, R.R., Matyas, S.M. and Meyer, C.H., Authentication with manipulation detection code, Proceedings of the 1983 IEEE Symposium on Security and Privacy, Oakland, California, April 1983.Google Scholar
  13. [13]
    Konheim, A.G., Cryptography: A Primer John Wiley & Sons, Toronto, 1981.Google Scholar
  14. [14]
    Matyas, S.M., Digital signatures–an overview, Computer Networks Vol. 3, 1979, pp. 87–94.Google Scholar
  15. [15]
    Meijer, H. and Akl, S.G., Digital signature schemes, Cryptoloqia Vol. 6, No. 4, October 1982, pp. 329–338.Google Scholar
  16. [16]
    Meijer, H. and Akl, S.G., Remarks on a digital signature scheme, Cryptoloqia Vol. 7, No. 2, April 1983, pp. 183–186.Google Scholar
  17. [17]
    Merkle, R.C., Secrecy, authentication, and public-key systems, Ph.D. Thesis, Stanford University, 1979, pp. 32–61.Google Scholar
  18. [18]
    Meyer, C. and Matyas, S.M., Cryptography - A New Dimension In _Computer Data Security John Wiley & Sons, New York, 1982.Google Scholar
  19. [19]
    Porter, S., On a flaw in XOR-CBC based data authentication scheme, Cipher Newsletter March 1983, pp. 4–6.Google Scholar
  20. [20]
    Wegman, M.N. and Carter, J.L., New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences Vol. 22, 1981, pp. 265–279.Google Scholar
  21. [21]
    Winternitz, R.S., Using DES to produce a one-way hash function, Proceedings of CRYPTO 83, Santa Barbara, California, August 1983.Google Scholar
  22. [22]
    Yuval, G., How to swindle Rabin, Cryptoloqia Vol. 3, No. 3, July 1979, pp. 187–189.Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Selim G. Akl
    • 1
  1. 1.Department of Computing and Information ScienceQueen’s UniversityKingstonCanada

Personalised recommendations