Abstract
This paper presents a new stream cipher family whose output bits are produced by blocks. We particularly focus on the member of this family producing 128-bit blocks with a 256-bit key. The design is based on a new technique called crossing over which allows to vectorize stream ciphering by using nonlinear shift registers. These algorithms offer a very high cryptographic security and much higher speed encryption than any existing stream ciphers or block ciphers, particularly the AES candidates. A 1000 euros rewarded cryptanalysis challenge is proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Anderson, E. Biham, Two Practical and Provable Secure Block Ciphers: BEAR and LION, In Fast Software Encryption 96, number 1039 in Lecture Notes in Computer Science, pp 113–120, Springer Verlag, 1997.
K. Aoki, H. Lipmaa, Fast Implementation of AES Candidates, In Third AES Conference, April 13–14th, 2000, New York.
M. Bellare, J. Killian, P. Rogaway, The security of Cipher Block Chaining, In Advances in Cryptology-CRYPTO’94, number 839 in Lecture Notes in Computer Science, pp 341–358, Springer Verlag.
C.M. Campbell, Design and Specification of Cryptographic Capabilities, IEEE Computer Society Magazine, Vol. 16, Nr. 6, pp 15–19, November 1979.
A. Canteaut, M. Trabbia, Improved Fast Correlation Attacks using Parity-check Equations of weight 4 and 5. In Advances in Cryptology-EUROCRYPT’2000, number 1807 in Lecture Notes in Computer Science, pp 573–588, Springer Verlag 2000.
V. Chepyzhov, T. Johansson, B. Smeets. A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers. In Fast Software Encryption 2000, Lecture Notes in Computer Science 1978, Springer Verlag, 2001.
E. Filiol, Decimation Attack of Stream Ciphers, In Progress in Cryptology-INDOCRYPT’2000, number 1977 in Lecture Notes in Computer Science, pp 31–42, Springer Verlag, 2000.
E. Filiol, C. Fontaine, Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity, In Advances in Cryptology-EUROCRYPT’98, number 1403 in Lecture Notes in Computer Science, pp 475–488, Springer Verlag, 1998.
S.W. Golomb, Shift Register Sequences, Agean Park Press, 1982.
S.W. Golomb, On the Cryptanalysis of Nonlinear Sequences, In 7th IMA Conference on Cryptography and Coding, number 1746 in Lecture Notes in Computer Science, pp 236–242 Springer Verlag, 1999.
T. Johansson, F. Jönsson, Improved Fast Correlation Attack on stream Ciphers via Convolutional Codes, In Advances in Cryptology-EUROCRYPT’99, number 1592 in Lecture Notes in Computer Science, pp 347–362, Springer Verlag, 1999.
H. Krawczyk, LFSR-based Hashing and Authentication, In Advances in Cryptology-CRYPTO’94, number 839 in Lecture Notes in Computer Science, pp 129–139 Springer Verlag.
D.E. Knuth, The Art of Computer Programming,, Addison-Wesley, 1984.
X.J. Lai, R.A. Rueppel, J. Woolven, A fast Cryptographic Checksum Algorithm based on Stream Ciphers, In Advances in Cryptology-AUSCRYPT’92, number 718 in Lecture Notes in Computer Science, pp 338–348 Springer Verlag.
S. Maitra, P. Sarkar, Constructions of Non Linear Boolean Functions with important Cryptographic Properties, In Advances in Cryptology-EUROCRYPT’2000, number 1807 in Lecture Notes in Computer Science, pp 485–506, Springer Verlag.
S. Maitra, P. Sarkar, New Directions in Design of Resilient Boolean Functions, In Advances in Cryptology-CRYPTO’00, number 1880 in Lecture Notes in Computer Science, pp 515–532 Springer Verlag.
National Bureau of Standards, NBS FIPS PUB 81, DES Modes of Operation, U.S. Department of Commerce, Dec 1980.
M. Mihaljevic, J.D. Golic, A Fast Iterative Algorithm for a Shift-Register Initial State Reconstruction given the Noisy Output Sequence, In Advances in Cryptology-AUSCRYPT’90, number 453 in Lecture Notes in Computer Science, pp 165–175, Springer Verlag, 1990.
P. Rogaway, D. Coppersmith, A Software-optimized Encryption Algorithm. In In Fast Software Encryption 1993, Lecture Notes in Computer Science 809, pp 56–63, Springer Verlag, 1994.
T. Siegenthaler, Decrypting a Class of Stream Ciphers using Ciphertext Only, IEEE Transactions on Computers, C-34, 1, pp 81–84, 1985.
Y. Tarannikov, On resilient Boolean Functions with Maximal Possible Nonlinearity, http://www.eprint.iacr.org/2000/005.ps.
K. Zheng, M. Huang, On the Linear Syndrome Method in Cryptanalysis, In Advances in Cryptology-CRYPTO’88, number 405 in Lecture Notes in Computer Science, pp 469–478, Springer Verlag, 1990.
K. Zeng, C.H. Yang, T.R. Rao, An Improved Linear Syndrome Algorithm in Cryptanalysis with Applications, In Advances in Cryptology-CRYPTO’90, number 537 in Lecture Notes in Computer Science, pp 34–47, Springer Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filiol, E., Fontaine, C. (2001). A New Ultrafast Stream Cipher Design: COS Ciphers. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive