000115085 001__ 115085
000115085 005__ 20180317093340.0
000115085 02470 $$2ISI$$a000252885500013
000115085 037__ $$aCONF
000115085 245__ $$aLinear Cryptanalysis of Non Binary Ciphers (with an application to SAFER)
000115085 269__ $$a2007
000115085 260__ $$bSpringer$$c2007
000115085 336__ $$aConference Papers
000115085 490__ $$aLecture Notes in Computer Science$$v4876
000115085 520__ $$aIn this paper we re-visit distinguishing attacks. We show how to generalize the notion of linear distinguisher to arbitrary sets. Our thesis is that our generalization is the most natural one. We compare it with the one by Granboulan et al. from FSE'06 by showing that we can get sharp estimates of the data complexity and cumulate characteristics in linear hulls. As a proof of concept, we propose a better attack on their toy cipher TOY100 than the one that was originally suggested and we propose the best known plaintext attack on SAFER K/SK so far. This provides new directions to block cipher cryptanalysis even in the binary case. On the constructive side, we introduce DEAN18, a toy cipher which encrypts blocks of 18 decimal digits and we study its security.
000115085 700__ $$0241292$$aBaignères, Thomas$$g119309
000115085 700__ $$aStern, Jacques
000115085 700__ $$0241950$$aVaudenay, Serge$$g131602
000115085 7112_ $$aSAC 2007$$cOttawa, Canada
000115085 773__ $$q184-211$$tSAC 2007
000115085 8564_ $$s586129$$uhttps://infoscience.epfl.ch/record/115085/files/groupLC.pdf$$yn/a$$zn/a
000115085 909CO $$ooai:infoscience.tind.io:115085$$pIC$$pconf
000115085 909C0 $$0252183$$pLASEC$$xU10433
000115085 917Z8 $$x194711
000115085 937__ $$aLASEC-CONF-2008-059
000115085 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000115085 980__ $$aCONF