Skip to Main content Skip to Navigation
Conference papers

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

Abstract : This paper studies the security level expected by the canon-ical 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 (PRF) are used as filtering functions. In this case, it is shown that the security against chosen-ciphertext attacks (IND-CCA security) cannot be reached for the canonical form of the SSSC, but it is however secure against chosen plaintext attacks (IND-CPA secure). This result guarantees the existence of SSSC that can be IND-CPA secure although till now, the SSSC proposed in the open literature had be broken against IND-CPA attacks. The security proof lies on the property of indistin-guishability.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Wednesday, February 17, 2016 - 11:20:09 AM
Last modification on : Wednesday, October 27, 2021 - 2:39:58 PM


Files produced by the author(s)


  • HAL Id : hal-01259081, version 2


Brandon Dravie, Philippe Guillot, Gilles Millérioux. Security proof of the canonical form of self-synchronizing stream ciphers. 9th International Workshop on Coding and Cryptography, WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01259081v2⟩



Record views


Files downloads