Skip to main content
Download book PDF
View expanded cover

Workshop on the Theory and Application of of Cryptographic Techniques

EUROCRYPT 1987: Advances in Cryptology — EUROCRYPT’ 87 pp 237–247Cite as

Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers

Part of the Lecture Notes in Computer Science book series (LNCS,volume 304)

Abstract

The purposes of this paper are: (1) to give appropriate definitions of robustly-perfect ciphers, linear ciphers and bilinear ciphers: (2) to give two general constructions of robustly-perfect bilinear block ciphers that do not expand the plaintext and that have the smallest possible amount of secret key; (3) to give some isolated examples of robustly-perfect linear stream ciphers that use less key than had been earlier conjectured to be necessary; and (4) to suggest some possible useful applications for robustly-perfect linear and bilinear ciphers.

Keywords

  • Finite Field
  • Block Cipher
  • Stream Cipher
  • Cipher System
  • Shift Register Sequence

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.

Download conference paper PDF

References

  1. C. E. Shannon, “Communication Theory of Secrecy Systems”, Bell Sys. Tech. J., vol. 28, pp. 656–715, Oct. 1949.

    MathSciNet  Google Scholar 

  2. J. Dénes and A. D. Keedwell, Latin Squares and their Applications. Budapest: Akadémiai Kiadó, 1974.

    MATH  Google Scholar 

  3. S. W. Golomb, Shift Register Sequences. San Francisco: Holden-Day. 1967.

    MATH  Google Scholar 

  4. R. Lidl and H. Niderreiter. Finite Fields (Vol. 20. Encyclopedia of Math. and its Appl.). Englewood Cliffs, NJ: Addison-Wesley, 1333.

    Google Scholar 

  5. J. L. Massey and R. A. Rueppel, “Linear Ciphers and Random Sequence Generators with Multiple Clocks”, PP. 74–87 in Advances in Cryptology (Proceedings of EUROCRYPT 84, Lecture Notes in Computer Science No. 209). Heidelberg and Yew York: Springer 1985.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Signal and Information Processing, Swiss Federal Institute of Technolog, CH-8092, Zürich, Switzerland

    James L. Massey, Ueli Maurer & Muzhong Wang

Authors
  1. James L. Massey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ueli Maurer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Muzhong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Mathematics and Computer Science (CWI), Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    David Chaum

  2. National Physical Laboratory, Teddington, Middlesex, TW11 OLW, UK

    Wyn L. Price

Rights and permissions

Reprints and Permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Massey, J.L., Maurer, U., Wang, M. (1988). Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers. 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_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-39118-5_22

  • 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