UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
On Optimal Size in Truncated Differential Attacks
  • Publication Type:
    Conference
  • Authors:
    Courtois N, Mourouzis T, Grocholewska-Czurylo A, Quisquater JJ
  • Publication date:
    01/07/2015
  • Place of publication:
    Budapest, Hungary
  • Published proceedings:
    Studia Scientiarum Mathematicarum Hungarica
  • Volume:
    52
  • Issue:
    2
  • Series:
    Studia Scientiarum Mathematicarum Hungarica
  • Editors:
    Csirmaz L
  • Status:
    Published
  • Name of conference:
    CECC 2014
  • Conference place:
    Budapest, Hungary
  • Conference start date:
    21/05/2014
  • Conference finish date:
    24/05/2014
  • Print ISSN:
    0081-6906
  • Language:
    English
  • Keywords:
    Block ciphers, GOST, DES, differential cryptanalysis, sets of differentials, truncated differentials, automated cryptanalysis
Abstract
Differential Cryptanalysis (DC) is one of the oldest known attacks on block ciphers. DC is based on tracking of changes in the differences between two messages as they pass through the consecutive rounds of encryption. However DC remains very poorly understood. In his textbook written in the late 1990s Schneier wrote that against differential cryptanalysis, GOST is “probably stronger than DES”. In fact Knudsen have soon proposed more powerful advanced differential attacks however the potential space of such attacks is truly immense. To this day there is no method which allows to evaluate the security of a cipher against such attacks in a systematic way. Instead, attacks are designed and improved in ad-hoc ways with heuristics [6–13,21]. The best differential attack known has time complexity of 2^179 [13]. In this paper we show that for a given block cipher there exists an optimal size for advanced differential properties. This new understanding allows to considerably reduce the space to be searched for “good” truncated differential properties suitable for an attack.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by