On the importance of cryptographic agility for industrial automation
Authors:
- 1 May 2019
- journal article
- research article
- Published by Walter de Gruyter GmbH in at - Automatisierungstechnik
- Vol. 67 (5) , 402-416
Abstract
Cryptographic primitives do not remain secure, they deteriorate over time. On the one hand increasing computing power leads to more powerful attacks on their underlying mathematical problems. On the other hand quantum computing threatens to break many widely used cryptographic primitives. The main goal of cryptographic agility is to enable an easy transition to alternative cryptographic schemes. Considering the long lifetime of products within industrial automation, we argue that vendors should strive for cryptographic agility in their products. In this work we motivate cryptographic agility by discussing the threat of quantum computers to modern cryptography. Additionally, we introduce the reader to the concept of post-quantum cryptography. Ultimately, we demonstrate that cryptographic agility requires three elements: 1) cryptographic application programming interfaces, 2) secure update mechanisms and 3) documentation of cryptographic primitives. By providing practical concepts we show how to meet these requirements in software-based systems.Keywords
This publication has 44 references indexed in Scilit:
- Constructing elliptic curve isogenies in quantum subexponential timeJournal of Mathematical Cryptology, 2013
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions2011
- The Internet of Things: A surveyComputer Networks, 2010
- Introduction to post-quantum cryptography2009
- An introduction to quantum computing for non-physicistsACM Computing Surveys, 2000
- NTRU: A ring-based public key cryptosystem1998
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms1996
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985
- Simulating physics with computersInternational Journal of Theoretical Physics, 1982