Policy gradients for cryptanalysis

  • Authors:
  • Frank Sehnke;Christian Osendorfer;Jan Sölter;Jürgen Schmidhuber;Ulrich Rührmair

  • Affiliations:
  • Faculty of Computer Science, Technische Universität München, Germany;Faculty of Computer Science, Technische Universität München, Germany;Faculty of Biology, Freie Universität Berlin, Germany;Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Lugano, Switzerland and Faculty of Computer Science, Universitá della Svizzera italiana, Lugano, Switzerland;Faculty of Computer Science, Technische Universität München, Germany

  • Venue:
  • ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part III
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

So-called Physical Unclonable Functions are an emerging, new cryptographic and security primitive. They can potentially replace secret binary keys in vulnerable hardware systems and have other security advantages. In this paper, we deal with the cryptanalysis of this new primitive by use of machine learning methods. In particular, we investigate to what extent the security of circuit-based PUFs can be challenged by a new machine learning technique named Policy Gradients with Parameter-based Exploration. Our findings show that this technique has several important advantages in cryptanalysis of Physical Unclonable Functions compared to other machine learning fields and to other policy gradient methods.