Abstract
A design principle for the computation of a cryptographic checksum is proposed. Unlike most of the existing message authentication algorithms, the proposed scheme is based on stream cipher techniques and is non-iterative. In this scheme, a key stream sequence is used to demultiplex the message into two subsequences, which are then fed into two accumulating feedback shift registers to produce the checksum (also called message authentication code). The scheme is suitable for highspeed implementation and possesses valuable properties such as “perfect hashing”, “perfect MAC” and complete key diffusion.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
ANSI X9.9-1986, Financial Institution Message Authentication (Wholesale), American Bankers Association, Washington DC, 1986.
G. Brassard, Modern Cryptology, LNCS 325, Springer-Verlag, 1988.
Data Encryption Standard, FIPS PUB 46, National Tech. Info. Service, Springfield, VA, 1977.
I. B. Damgaard, “A Design Principle for Hash Functions”, Advances in Cryptology-CRYPTO'89, LNCS 435, pp. 416–427, Springer-Verlag, 1990.
Yvo Desmedt, “Unconditional secure authentication schemes and practical and theoretical consequences”, Advances in Cryptology-CRYPTO'85, LNCS 218 pp. 42–55, Springer-Verlag, 1986.
T. El Gamal, “A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms”, IEEE Trans. on Info. Th., Vol. IT-31, pp. 469–472, 1985.
S. W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, 1967.
ISO 8731-1, “Banking — Approved Algorithms for Message Authentication — Part 1: DEA”, International Organization for Standardization, 1987.
ISO/IEC 9797, “Data cryptographic techniques — Data integrity mechanism using a cryptographic check function employing a block cipher algorithm”, International Organization for Standardization, 1-st. edition, 1989.
R. R. Jueneman, “A High-Speed Manipulation Detection Code”, Advances in Cryptology-CRYPTO'86, Proceedings, pp. 327–346, Springer-Verlag, 1987.
X. Lai, “On the Design and Security of Block Ciphers”, ETH series in Information Processing (Ed. J.L. Massey), Vol.1, Hartung-Gorre Verlag, Konstanz, 1992.
X. Lai and J. L. Massey, “Some Connections between Scramblers and Invertible Automata”, Proceedings of Beijing International Workshop on Information Theory (BIWIT'88), p. DI-5.1, International Academic Publishers, July, 1988.
C. J. Mitchell, F. Piper and P. Wild, “Digital Signatures”, Contemporary Cryptology (Ed. G. Simmons), pp. 325–378, IEEE Press, 1991.
R. L. Rivest, A. Shamir and L. Adleman, “A Method for obtaining digital Signatures and Public-Key Cryptosystems”, Communications of the ACM 21 (1978), pp. 120–126.
R. A. Rueppel, Analysis and Design of Stream Ciphers, New York, NY, Springer-Verlag, 1986.
R. A. Rueppel, “Stream Ciphers”, Contemporary Cryptology: The Science of Information Integrity (Ed. G. Simmons), pp. 65–134, IEEE Press, 1991.
C. E. Shannon, “Communication Theory of Secrecy Systems”, Bell. System Technical Journal, Vol. 28, pp. 656–715, Oct. 1949.
R. S. Winternitz, “Producing One-Way Hash Function from DES”, Advances in Cryptology-CRYPTO'83, Proceedings, pp. 203–207, Plenum Press, New York, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lai, X., Rueppel, R.A., Woollven, J. (1993). A fast cryptographic checksum algorithm based on stream ciphers. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_73
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive