256 bit standardized crypto for 650 GE – GOST revisited

• Main Authors: Poschmann, Axel, Ling, San, Wang, Huaxiong
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2012
• Subjects: DRNTU::Science::Mathematics
• Online Access: https://hdl.handle.net/10356/99818; http://hdl.handle.net/10220/7716
• Institution: Nanyang Technological University

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.