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
Solving Optimisation Problems in Cryptography, Its Implementation and Cryptanalysis,
  • Publication Type:
    Conference
  • Authors:
    COURTOIS N, Hulme D, Mourouzis T
  • Publisher:
    Institute of Mathematics and its Applications
  • Publication date:
    2011
  • Published proceedings:
    CD-ROM and web proceedings of 2nd IMA Mathematics in Defence 2011
  • Status:
    In preparation
  • Name of conference:
    2nd IMA Mathematics in Defence 2011
  • Conference place:
    Defence Academy, Shrivenham, UK
  • Conference start date:
    20/10/2011
  • Conference finish date:
    20/10/2011
  • Keywords:
    Block ciphers, non-linearity, algebraic attacks, circuit complexity, multiplicative complexity, algebraic cryptanalysis, side-channel attacks
  • Publisher URL:
Abstract
One of the hardest practical problems in computer science is the problem of gate-eĀ±cient implementation. Such optimizations are particularly important in industrial hardware implementations of standard cryptographic algorithms. In this paper we focus on optimizing some small digital circuits such as S-boxes in some well-known ciphers. We consider the notion of Multiplicative Complexity which was recently applied to find gate-efficient implementations for the S-box of the U.S. encryption standard AES. We applied the same methodology to produce a compact implementation of several ciphers. In this short paper we report our results on PRESENT and GOST, two block ciphers known for their exceptionally low hardware cost. This kind of minimization seems to be very promising in implementations aiming at preventing side channel attacks on cryptographic chips. It also has interesting applications in cryptanalysis of ciphers.
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