Policy gradients for cryptanalysis

6Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sehnke, F., Osendorfer, C., Sölter, J., Schmidhuber, J., & Rührmair, U. (2010). Policy gradients for cryptanalysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6354 LNCS, pp. 168–177). https://doi.org/10.1007/978-3-642-15825-4_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free