Advertisement

LOKI — A cryptographic primitive for authentication and secrecy applications

  • Lawrence Brown
  • Josef Pieprzyk
  • Jennifer Seberry
Section 6 Block Ciphers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 453)

Abstract

This paper provides an overview of the LOKI encryption primitive which may be used to encrypt and decrypt a 64-bit block of data using a 64-bit key. The LOKI primitive may be used in any mode of operation currently defined for ISO DEA-1, with which it is interface compatible [AAAA83]. Also described are two modes of operation of the LOKI primitive which compute a 64-bit, and 128-bit, Message Authentication Code (or hash value). These modes of operation may be used to provide authentication of a communications session, or of data files.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [AAAA83]
    "Information Interchange — Data Encryption Algorithm — Modes of Operation," American National Standards Institute X3.106-1983, American National Standards Institute, New York, 1983.Google Scholar
  2. [Brow88]
    L. Brown, "A Proposed Design for an Extended DES," in Proc. Fifth International Conference and Exhibition on Computer Security, IFIP, Gold Coast, Queensland, Australia, 19–21 May, 1988.Google Scholar
  3. [BrSe89]
    L. Brown and J. Seberry, "On the Design of Permutation P in DES Type Cryptosystems" in Abstracts of Eurocrypt 89, IACR, Houthalen, Belgium, 10–13 Apr., 1989.Google Scholar
  4. [BrSe90]
    L. Brown and J. Seberry, "Key Scheduling in DES Type Cryptosystems," accepted for presentation at Auscrypt90, ADFA, Sydney, Australia, Jan. 1990.Google Scholar
  5. [DaPr84]
    D. W. Davies and W. L. Price, Security for Computer Networks, John Wiley and Sons, New York, 1984.Google Scholar
  6. [PiFi88]
    J. Pieprzyk and G. Finkelstein, "Permutations that Maximize Non-Linearity and Their Cryptographic Significance," in Proc. Fifth Int. Conf. on Computer Security — IFIP SEC '88, IFIP TC-11, Gold Coast, Queensland, Australia, 19–21 May 1988.Google Scholar
  7. [Piep89]
    J. Pieprzyk, "Non-Linearity of Exponent Permutations," in Abstracts of Eurocrypt 89, IACR, Houthalen, Belgium, 10–13 Apr., 1989.Google Scholar
  8. [PiSe89]
    J. Pieprzyk and J. Seberry, "Remarks on Extension of DES — Which Way to Go?," Tech. Rep. CS89/4, Dept. of Computer Science, UC UNSW, Australian Defence Force Academy, Canberra, Australia, Feb. 1989.Google Scholar
  9. [Piep89]
    J. Pieprzyk, "Error Propagation Property and Application in Cryptography," IEEE Proceedings-E, Computers and Digital Techniques, vol. 136, no. 4, pp. 262–270, July 1989.Google Scholar
  10. [QuGi89]
    J. Quisquater and M. Girault, "2n-Bit Hash Functions Using n-Bit Symmetric Block Cipher Algorithms," in Abstracts of Eurocrypt 89, p. 4.5, IACR, Houthalen, Belgium, 10–13 Apr., 1989.Google Scholar
  11. [VCFJ89]
    J. Vandewalle, D. Chaum, W. Fumy, C. Janssen, P. Landrock and G. Roelofsen, "A European Call for Cryptographic Algorithms: RIPE RACE Integrity Primitives Evaluation," in Abstracts of Eurocrypt 89, p. 6.6, IACR, Houthalen, Belgium, 10–13 Apr., 1989.Google Scholar
  12. [Wint83]
    R. S. Winternitz, "Producing a One-Way Hash Function from DES," in Advances in Cryptology — Proc. of Crypto 83, D. Chaum, R. L. Rivest and A. T. Sherman (editors), pp. 203–207, Plenum Press, New York, Aug. 22–24, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Lawrence Brown
    • 1
  • Josef Pieprzyk
    • 1
  • Jennifer Seberry
    • 1
  1. 1.Centre for Computer Security Research Department of Comuter ScienceUniversity College, UNSW Australian Defence Force AcademyCanberraAustralia

Personalised recommendations