Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 1-2/2017

11-02-2016

Security proof of the canonical form of self-synchronizing stream ciphers

Authors: Brandon Dravie, Philippe Guillot, Gilles Millérioux

Published in: Designs, Codes and Cryptography | Issue 1-2/2017

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper is concerned with the security level expected by the canonical form of the self-synchronizing stream cipher (SSSC). A SSSC can be viewed as the combination of a shift register together with a filtering function. The maximum security of such a cipher is reached when the filtering function is random. However, in practice, pseudo random functions are used as filtering functions. In this case, we show that the security against chosen ciphertext attacks (IND-CCA security) cannot be reached but it is however secure against chosen plaintext attacks (IND-CPA secure). To relax the condition of pseudo randomness, a new family of functions with a weaker property is introduced. A connection with the left-or-right indistinguishability is made. This property provides a necessary and sufficient condition to characterize the indistinguishablity of SSSC.
previous article Observing biases in the state: case studies with Trivium and Trivia-SC
next article Row reduction applied to decoding of rank-metric and subspace codes
Literature
1.
Bellare M., Desai A., Jokipii E., Rogaway P.: A concrete security treatment of symmetric encryption, In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 394–403, IEEE Computer Society Press (1997).
2.
Bellare M., Rogaway P.: Introduction to modern cryptography. In: UCSD CSE, Course Notes, p. 207 (2005).
3.
Daemen J.: Cipher and Hash function design, strategies based on linearand differential cryptanalysis. Ph.D. Thesis, Katholieke Universiteit Leuven (1995).
4.
Daemen J., Kitsos P.: The self-synchronizing stream cipher moustique. In: New Stream Cipher Designs, The eSTREAM Finalists, pp. 210–223 (2008).
5.
Daemen J., Govaerts R., Vandewalle J.: A practical approach to the design of high speed self-synchronizing stream ciphers. In: IEEE ICCS/ISITA 92, Singapore, pp. 279–293 (1992).
6.
Dravie B., Guillot P., Millérioux G.: Security proof of the canonical form of self-synchronizing stream ciphers, In: Proceedings of Workshop on Cryptography and Coding, WCC 2015, Paris, France (2015).
7.
8.
Goldwasser S., Micali S.: Probabilistic encryption and how to play mental poker keeping secret all partial information, In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, San Francisco, 5–7 May, pp. 365–377 (1982).
9.
Goldwasser S., Micali S.: Probabilistic encryption. J. Comput. Syst. Sci. 28, 270–299 (1984).
10.
Joux A., Muller F.: Loosening the KNOT. In: Fast Software Encryption, 10th International Workshop, FSE, Lund, Sweden, 24–26 February, 2003. Revised Papers, pp. 87–99 (2003).
11.
Joux A., Muller F.: Two attacks against the HBB stream cipher, In: Fast Software Encryption: 12th International Workshop, FSE 2005. Paris, France, 21–23 February, 2005. Revised Selected Papers, pp. 330–341 (2005).
12.
Joux A., Muller F.: Chosen-ciphertext attacks against MOSQUITO. In: Fast Software Encryption, 13th International Workshop, FSE. Graz, Austria, 15–17 March, 2006. Revised Selected Papers, pp. 390–404 (2006).
13.
Kásper E., Rijmen V., Bjørstad T.E., Rechberger C., Robshaw M.J.B., Sekar G.: Correlated keystreams in moustique. In: Proceedings of the Progress in Cryptology—AFRICACRYPT 2008, First International Conference on Cryptology in Africa, Casablanca, 11–15 June, 2008. pp. 246–257 (2008).
14.
Klíma V.: Cryptanalysis of hiji-bij-bij (HBB), IACR Cryptology ePrint Archive, Report 2005/003 (2005).
15.
Maurer U.M.: New approaches to the design of self-synchronizing stream ciphers. In: Proceedings of the Advances in Cryptology—EUROCRYPT’91, Workshop on the Theory and Application of Cryptographic Techniques, Brighton, 8–11 April, pp. 458–471 (1991).
16.
Menezes A., van Oorschot P.C., Vanstone S.A.: Handbook of Applied Cryptography, CRC Press, Boca Raton (1996).
17.
Millérioux G., Guillot P.: Self-synchronizing stream ciphers and dynamical systems: state of the art and open issues. Int. J. Bifurc. Chaos 20, 2979–2991 (2010).
18.
National Bureau of Standards. Des mode of operations, Technical report, Institute for Computer Sciences and Technology, National Bureau of Standards, Springfield, VA (1980).
19.
Parriaux J.: Control, synchronization and encryption. Ph.D. Thesis, Université de Lorraine (2012).
20.
Parriaux J., Guillot P., Millérioux G.: Towards a spectral approach for the design of self-synchronizing stream ciphers. Cryptogr. Commun. 3, 259–274 (2011).
21.
Sarkar P.: Hiji-bij-bij: a new stream cipher with a self-synchronizing mode of operation, IACR Cryptology ePrint Archive, Report 2003/014 (2003).
Metadata
Title
Security proof of the canonical form of self-synchronizing stream ciphers
Authors
Brandon Dravie
Philippe Guillot
Gilles Millérioux
Publication date
11-02-2016
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1-2/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-016-0185-8

Other articles of this Issue 1-2/2017

Designs, Codes and Cryptography 1-2/2017 Go to the issue

OriginalPaper

A code-based group signature scheme

EditorialNotes

Editorial: Special issue on coding and cryptography

OriginalPaper

Reflection ciphers

OriginalPaper

Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension

OriginalPaper

Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity

OriginalPaper

MacWilliams Extension Theorem for MDS codes over a vector space alphabet

Premium Partner

    Image Credits