Abstract
This paper presents a new block cipher which offers good encryption rate on any platform. It is particularly optimized for hardware implementation where the expected rate is several Gbps on a small dedicated chip working at 30MHz. Its design combines up to date state of the art concepts in order to make it (hopefully) secure: diffusion network based on the Fast Fourier Transform, multipermutations, highly nonlinear confusion boxes.
Part of this work has been supported by the Compagnie des Signaux and may be subject to patent matter.
Chapter PDF
Similar content being viewed by others
References
Data Encryption Standard. Federal Information Processing Standard Publication 46, U. S. National Bureau of Standards, 1977.
DES Modes of Operation. Federal Information Processing Standard Publication 81, U. S. National Bureau of Standards, 1980.
K. Aoki, K. Ohta. Strict evaluation of the maximum average of differential probability and the maximum average of linear probability. IEICE Transactions on Fundamentals, vol. E80-A, pp. 1–8, 1997.
E. Biham. A fast new DES implementation in software. In Fast Software Encryption, Haifa, Israel, Lectures Notes in Computer Science 1267, pp. 260–272, Springer-Verlag, 1997.
E. Biham, A. Shamir. Differential cryptanalysis of the full 16-round DES. In Advances in Cryptology CRYPTO’92, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 740, pp. 487–496, Springer-Verlag, 1993.
E. Biham, A. Shamir. Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
F. Chabaud, S. Vaudenay. Links between differential and linear cryptanalysis. In Advances in Cryptology EUROCRYPT’94, Perugia, Italy, Lectures Notes in Computer Science 950, pp. 356–365, Springer-Verlag, 1995.
H. Dobbertin. Almost Perfect nonlinear power functions on GF(2n). IEEE Trans. Inf. Theory, submitted.
H. Feistel. Cryptography and computer privacy. Scientific american, vol. 228, pp. 15–23, 1973.
H. Gilbert. Cryptanalyse Statistique des Algorithmes de Chiffrement et Sécurité des Schémas d’Authentification, Thèse de Doctorat de l’Université de Paris 11, 1997.
H. Gilbert, G. Chassé. A statistical attack of the FEAL-8 cryptosystem. In Advances in Cryptology CRYPTO’90, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 537, pp. 22–33, Springer-Verlag, 1991.
H. M. Heys, S. E. Tavares. Substitution-Permutation Networks resistant to differential and linear cryptanalysis. Journal of Cryptology, vol. 9, pp. 1–19, 1996.
J. L. Massey. SAFER K-64: a byte-oriented block-ciphering algorithm. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 809, pp. 1–17, Springer-Verlag, 1994.
J. L. Massey. SAFER K-64: one year later. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 809, pp. 212–241, Springer-Verlag, 1994.
M. Matsui. Linear cryptanalysis methods for DES cipher. In Advances in Cryptology EUROCRYPT’93, Lofthus, Norway, Lectures Notes in Computer Science 765, pp. 386–397, Springer-Verlag, 1994.
M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Advances in Cryptology CRYPTO’94, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 839, pp. 1–11, Springer-Verlag, 1994.
M. Matsui. New structure of block ciphers with provable security against differential and linear cryptanalysis. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 1039, pp. 205–218, Springer-Verlag, 1996.
M. Matsui. New block encryption algorithm MISTY. In Fast Software Encryption, Haifa, Israel, Lectures Notes in Computer Science 1267, pp. 54–68, Springer-Verlag, 1997.
K. Nyberg. Perfect nonlinear S-boxes. In Advances in Cryptology EUROCRYPT’ 91, Brighton, United Kingdom, Lectures Notes in Computer Science 547, pp. 378–385, Springer-Verlag, 1991.
K. Nyberg, L. R. Knudsen. Provable security against a differential cryptanalysis. Journal of Cryptology, vol. 8, pp. 27–37, 1995.
Organisation for Economic Co-operation and Development Cryptography Policy Guidelines, 27 March, 1997.
C. P. Schnorr. FFT-Hashing: an efficient cryptographic hash function. Présenté à CRYPTO’91. Non publié.
C. P. Schnorr. FFT-Hash II, efficient cryptographic hashing. In Advances in Cryptology EUROCRYPT’92, Balatonfüred, Hungary, Lectures Notes in Computer Science 658, pp. 45–54, Springer-Verlag, 1993.
C.-P. Schnorr, S. Vaudenay. Parallel FFT-hashing. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 809, pp. 149–156, Springer-Verlag, 1994.
C.-P. Schnorr, S. Vaudenay. Black box cryptanalysis of hash networks based on multipermutations. In Advances in Cryptology EUROCRYPT’94, Perugia, Italy, Lectures Notes in Computer Science 950, pp. 47–57, Springer-Verlag, 1995.
C. P. Schnorr, S. Vaudenay. Black box cryptanalysis of cryptographic primitives. Submitted. Early version available as LIENS Report 95-28, Laboratoire d’Informatique de l’Ecole Normale Supérieure, 1995. ftp://ftp.ens.fr/pub/reports/liens/liens-95-28.A4.ps.Z
C. E. Shannon. Communication theory of secrecy systems. Bell system technical journal, vol. 28, pp. 656–715, 1949.
A. Tardy-Corfdir, H. Gilbert. A known plaintext attack of FEAL-4 and FEAL-6. In Advances in Cryptology CRYPTO’91, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 576, pp. 172–181, Springer-Verlag, 1992.
S. Vaudenay. On the need for multipermutations: cryptanalysis of MD4 and SAFER. In Fast Software Encryption, Leuven, Belgium, Lectures Notes in Computer Science 1008, pp. 286–297, Springer-Verlag, 1995.
S. Vaudenay. La Sécurité des Primitives Cryptographiques, Thèse de Doctorat de l’Université de Paris 7, Technical Report LIENS-95-10 of the Laboratoire d’Informatique de l’Ecole Normale Supérieure, 1995.
Rocke Verser. Strong cryptography makes the world a safer place. http://www.frii.com/~rcv/deschall.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stern, J., Vaudenay, S. (1998). CS-Cipher. In: Vaudenay, S. (eds) Fast Software Encryption. FSE 1998. Lecture Notes in Computer Science, vol 1372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69710-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-69710-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64265-7
Online ISBN: 978-3-540-69710-7
eBook Packages: Springer Book Archive