256 Bit Standardized Crypto for 650 GE – GOST Revisited

  • Axel Poschmann
  • San Ling
  • Huaxiong Wang
Conference paper

DOI: 10.1007/978-3-642-15031-9_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6225)
Cite this paper as:
Poschmann A., Ling S., Wang H. (2010) 256 Bit Standardized Crypto for 650 GE – GOST Revisited. In: Mangard S., Standaert FX. (eds) Cryptographic Hardware and Embedded Systems, CHES 2010. CHES 2010. Lecture Notes in Computer Science, vol 6225. Springer, Berlin, Heidelberg

Abstract

The former Soviet encryption algorithm GOST 28147-89 has been standardized by the Russian standardization agency in 1989 and extensive security analysis has been done since. So far no weaknesses have been found and GOST is currently under discussion for ISO standardization. Contrary to the cryptographic properties, there has not been much interest in the implementation properties of GOST, though its Feistel structure and the operations of its round function are well-suited for hardware implementations. Our post-synthesis figures for an ASIC implementation of GOST with a key-length of 256 bits require only 800 GE, which makes this implementation well suitable for low-cost passive RFID-tags. As a further optimization, using one carefully selected S-box instead of 8 different ones -which is still fully compliant with the standard specifications!- the area requirement can be reduced to 651 GE.

Keywords

lightweight cryptography ASIC GOST 

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Axel Poschmann
    • 1
  • San Ling
    • 1
  • Huaxiong Wang
    • 1
  1. 1.Division of Mathematical Sciences, School of Physical and Mathematical SciencesNanyang Technological UniversitySingapore

Personalised recommendations