On the security of CS-Cipher

CS-Cipher is a block cipher which has been proposed at FSE 1998. It is a Markov cipher in which diffusion is performed by multipermutations. We first provide a formal treatment for differential, linear and truncated differential cryptanalysis, and we apply it to CS-Cipher in order to prove that there exists no good characteristic for these attacks. This holds under the approximation that all round keys of CS-Cipher are uniformly distributed and independent. For this we introduce some new techniques for counting active Sboxes in computational networks by the Floyd-Warshall algorithm.


Published in:
Fast Software Encryption, 6th International Workshop, FSE'99, 1636, 260-274
Presented at:
Fast Software Encryption, 6th International Workshop, FSE'99, Rome, Italy, March 24-26, 1999
Year:
1999
Laboratories:




 Record created 2007-01-18, last modified 2018-03-17

n/a:
Download fulltext
PS

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)