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.
Chapter PDF
References
C. E. Shannon, “Communication Theory of Secrecy Systems”, Bell Sys. Tech. J., vol. 28, pp. 656–715, Oct. 1949.
J. Dénes and A. D. Keedwell, Latin Squares and their Applications. Budapest: Akadémiai Kiadó, 1974.
S. W. Golomb, Shift Register Sequences. San Francisco: Holden-Day. 1967.
R. Lidl and H. Niderreiter. Finite Fields (Vol. 20. Encyclopedia of Math. and its Appl.). Englewood Cliffs, NJ: Addison-Wesley, 1333.
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.
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
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