A New Ultrafast Stream Cipher Design: COS Ciphers

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.

[1]  Xuejia Lai,et al.  A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers , 1992, AUSCRYPT.

[2]  Shafi Goldwasser,et al.  Advances in Cryptology — CRYPTO’ 88: Proceedings , 1990, Lecture Notes in Computer Science.

[3]  Mihir Bellare,et al.  The Security of Cipher Block Chaining , 1994, CRYPTO.

[4]  Kaisa Nyberg,et al.  Advances in Cryptology — EUROCRYPT'98 , 1998 .

[5]  Phillip Rogaway,et al.  A Software-Optimised Encryption Algorithm , 1993, FSE.

[6]  C. Campbell Design and specification of cryptographic capabilities , 1978, IEEE Communications Society Magazine.

[7]  Chung-Huang Yang,et al.  An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications , 1990, CRYPTO.

[8]  Eric Filiol,et al.  Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity , 1998, EUROCRYPT.

[9]  Palash Sarkar,et al.  New Directions in Design of Resilient Boolean Functions , 2000, IACR Cryptol. ePrint Arch..

[10]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[11]  Jennifer Seberry,et al.  Advances in Cryptology — AUSCRYPT '90 , 1990, Lecture Notes in Computer Science.

[12]  Yuriy Tarannikov,et al.  On Resilient Boolean Functions with Maximal Possible Nonlinearity , 2000, INDOCRYPT.

[13]  Solomon W. Golomb,et al.  On the Cryptanalysis of Nonlinear Sequences , 1999, IMACC.

[14]  Jacques Stern,et al.  Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.

[15]  Palash Sarkar,et al.  Construction of Nonlinear Boolean Functions with Important Cryptographic Properties , 2000, EUROCRYPT.

[16]  Thomas Johansson,et al.  Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes , 1999, EUROCRYPT.

[17]  Kencheng Zeng,et al.  On the Linear Syndrome Method in Cryptanalysis , 1988, CRYPTO.

[18]  Vladimir V. Chepyzhov,et al.  A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers , 2000, FSE.

[19]  Eli Biham,et al.  Two Practical and Provably Secure Block Ciphers: BEARS and LION , 1996, FSE.

[20]  Phillip Rogaway,et al.  A Software-Optimized Encryption Algorithm , 1998, Journal of Cryptology.

[21]  Bart Preneel,et al.  Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings , 2000 .

[22]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[23]  Jennie Malboeuf Algorithm , 1994, Neurology.

[24]  Bimal Roy,et al.  Progress in Cryptology —INDOCRYPT 2000 , 2002, Lecture Notes in Computer Science.

[25]  Eric Filiol,et al.  Decimation Attack of Stream Ciphers , 2000, INDOCRYPT.

[26]  Jovan Dj. Golic,et al.  A Fast Iterative Algorithm For A Shift Register Initial State Reconstruction Given The Nosiy Output Sequence , 1990, AUSCRYPT.

[27]  Palash Sarkar,et al.  Nonlinearity Bounds and Constructions of Resilient Boolean Functions , 2000, CRYPTO.

[28]  Jennifer Seberry,et al.  Advances in Cryptology — AUSCRYPT '92 , 1992, Lecture Notes in Computer Science.

[29]  Anne Canteaut,et al.  Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 , 2000, EUROCRYPT.

[30]  Yvo Desmedt,et al.  Advances in Cryptology — CRYPTO ’94 , 2001, Lecture Notes in Computer Science.

[31]  Thomas Siegenthaler,et al.  Decrypting a Class of Stream Ciphers Using Ciphertext Only , 1985, IEEE Transactions on Computers.

[32]  Hugo Krawczyk,et al.  LFSR-based Hashing and Authentication , 1994, CRYPTO.