Abstract
A blockcipher maps each pair of plaintext and key onto a ciphertext in such a way that for every fixed key, the relationship between plaintexts and ciphertexts is one-to-one. It is assumed that plaintexts and ciphertexts belong to a message space comprising all bit-strings (sequences of zeros and ones) of a given length; keys are taken from a key space made up of aU bitstrings of a possibly Merent given length. A well-known blockcipher is the NBS Data Encryption Standard (DES) [6], whch is the iteration of sixteen essentially equal “rounds”.
This research was supported by the Netherlands Organization for the Advancement of Pure Research (Z.W.O.).
Chapter PDF
Similar content being viewed by others
References
Chaum, D. & Evertse, J.-H, Cryptanalysis of DES with a reduced number of rounds; sequences of linear factors in block ciphers, in Advances in Cryptology: Proc. Crypto’ 85, H.C. Williams, ed., Lecture Notes in Computer Science 218, Springer Verlag, Berlin etc. (1986), pp. 192–211.
Davio, M., Desmedt, Y., Fosseprez, M., Govaerts, R., Hulsbosch, J., Neutjens, P., Piret, P., Quisquater, J.J., Vandewalle, J., Wouters, P., Analytical characteristics of the DES, in Advances in Cryptology: Proc. Crypto’ 83, D. Chaum, ed., Plenum, New York (1984), pp. 171–202.
Franklin, M., M.Sc. Thesis, Univ. Berkeley, May 1985.
Hellman, M., Merkle, R., Schroeppel, R., Washington, L., Diffie, W., Pohlig, S., Schweitzer, P., Results of an initial attempt to cryptanalyze the NBS Data Encryption Standard, Information Systems Lab. report SEL 76-042, Stanford University (1976).
Meyer C.H. Ciphertext /plaintext and ciphertext/key dependencies vs. number of roundr for the Data Encryption Standard, AFIPS Conference Proceedings, 47, (June 1978), pp. 1119–1126.
National Bureau of Standards, Data Encryption Standard, U.S. Department of Commerce, FIPS pub. 46 (January 1977).
Reeds, J.A. & Manferdelli, J.L., DES has no per round linear factors, in Advances in Cryptology: Roc. Crypto’ 84, G.R. Blakley and D. Chaum, eds. Lecture Notes in Computer Science 196, Springer Verlag, Berh etc. (1985), pp. 377–389.
Shamir, A., On the security of DES, in Advances in Cryptology: Proc. Crypto’ 85, H.C. Williams, ed., Lecture Notes in Computer Science 218, Springer Verlag, Berlin etc. (1986), pp. 280–281.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Evertse, JH. (1988). Linear Structures in Blockciphers. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive