Security and Communication Networks

Security and Communication Networks / 2020 / Article

Research Article | Open Access

Volume 2020 |Article ID 5738215 | https://doi.org/10.1155/2020/5738215

Yuhei Watanabe, Hideki Yamamoto, Hirotaka Yoshida, "Lightweight Crypto Stack for TPMS Using Lesamnta-LW", Security and Communication Networks, vol. 2020, Article ID 5738215, 12 pages, 2020. https://doi.org/10.1155/2020/5738215

Lightweight Crypto Stack for TPMS Using Lesamnta-LW

Academic Editor: Leonardo Mostarda
Received08 Mar 2019
Revised20 Jul 2020
Accepted10 Sep 2020
Published24 Sep 2020

Abstract

Modern vehicles which have internal sensor networks are one of the examples of a cyberphysical system (CPS). The tire pressure monitoring system (TPMS) is used to monitor the pressure of the tires and to inform the driver of them. This system is mandatory for vehicles in the US and EU. To ensure the security of TPMS, it is important to reduce the cost of the cryptographic mechanisms implemented in resource-constrained devices. To address this problem, previous works have proposed countermeasures employing lightweight block ciphers such as PRESENT, SPECK, or KATAN. However, it is not clear to us that any of these works have addressed the issues of software optimization that considers TPMS packet protection as well as session key updates for architectures consisting of the vehicle TPMS ECU and four low-cost TPMS sensors equipped with the tires. In this paper, we propose the application of ISO/IEC 29192-5 lightweight hash function Lesamnta-LW to address these issues. When we apply cryptographic mechanisms to a practical system, we consider the lightweight crypto stack which contains cryptographic mechanisms, specifications for the implementation, and performance evaluation. Our approach is to apply the known method of converting Lesamnta-LW to multiple independent pseudorandom functions (PRFs) in TPMS. In our case, we generate five PRFs this way and then use one PRF for MAC generation and four for key derivation. We use the internal AES-based block cipher of Lesamnta-LW for encryption. Although we follow the NIST SP 800-108 framework of converting PRFs to key derivation functions, we confirm the significant advantage of Lesamnta-LW-based PRFs over HMAC-SHA-256 by evaluating the performance on AVR 8-bit microcontrollers, on which we consider simulating TPMS sensors. We expect that our method to achieve multiple purposes with a single cryptographic primitive will help us to reduce the total implementation cost required for TPMS security.

1. Introduction

1.1. Positioning of This Paper

This paper is an extended version of the paper that appeared in the proceedings of the escar Asia 2018 [1]. The main changes and increments are as follows:(1)Addition of the description of the relationship between modern vehicles and cyberphysical systems(2)Addition of the background of the adoption of TPMS(3)Addition of the definition of the TPMS sensor’s architecture(4)Addition of descriptions of the lightweight crypto stack(5)Addition of specifications of TPMS sensors such as SP37, SP40+, and FXTH87(6)Revision of descriptions of applications of Lesamnta-LW(7)Implementation results of the Lesamnta-LW-based authenticated encryption mechanism

Yoshida who is one of the coauthors of this paper mentioned the above known results as current tendency of the lightweight cryptography in his presentation at ASK 2018 [2].

1.2. Background and Our Contribution

Modern vehicles are one of the examples of a cyberphysical system (CPS) because they have many sensors and computer systems which are connected via internal networks. There have been security analyses for systems in the modern vehicle, and the demand for security has been shown by them [35].

The tire pressure monitoring system (TPMS) is employed in modern vehicles to monitor the status of tire pressures and establish communication between the vehicles and the sensors equipped within the tires. It is typical that in TPMS, the sensors spend more than 90% of their time in power-down mode [6]. Since there was the Ford–Firestone tire failure controversy in the US [7], TREAD Act was established and TPMSs were the wide deployment. Currently, it is mandatory for many new vehicles to adopt the TPMS in the US [8] and EU [9]. Since it is difficult to establish wire connection between the vehicles and the TPMS sensors, the wireless communication by a radio frequency (RF) is used in the TPMS. Then, it is considered that there are security risks by eavesdropping communication packets of TPMS [10].

In 2010, eavesdropping and spoofing attacks on TPMS were reported [10]. Therefore, the security of TPMS has become increasingly important, although there are harsh requirements in the automotive industry, saying that implementation costs are severely constrained. Costs are evaluated from many metrics including power consumption, energy consumption, required time, and circuit size. Therefore, it is not always clear whether power consumption or energy consumption requirements can be met or not.

There have been a number of studies on cryptographic protocols for ensuring the confidentiality and/or integrity of communication packets as well as cryptographic or noncryptographic key management protocols for TPMS. For instance, a packet protection protocol using the hardware-oriented block cipher KATAN32 [11] has been proposed, and the FPGA implementation of this protocol has been evaluated in terms of delay and power [12]. The authors proposed a session key update mechanism but did not apply a cryptographic mechanism. In [6], a lightweight protocol based on lightweight hardware-oriented block ciphers such as SPECK [13] and PRESENT [14] was proposed, and this achieved energy consumption of some two orders of magnitude lower than that reported in [12].

According to the authors, this is because the dedicated TPMS sensors form the deployment platform as well as the lightweight implementation properties of SPECK. The applicability of their protocol was studied using Infineon SP37 sensors [15] implemented on an 8-bit microcontroller. In [16], the authors propose a packet protection protocol using PRESENT and show that their implementations are suitable for the NXP FXTH87 TPMS sensor [17] in terms of RAM, ROM, and computation time.

We argue the important problem is that it appears to us that none of the above works [6, 12, 16] explores optimized embedded software solutions for session key generation (or key derivation), as well as communication packet protection, that are suitable for the TPMS architectures. These architectures consist of the vehicle TPMS electronic control unit (ECU) and four TPMS sensors that are severely constrained, especially in terms of RAM for cryptographic implementations.

1.2.1. TPMS Sensor’s Architecture

A TPMS sensor consists of devices such as a pressure sensor, a microcontroller, an RF transmitter, and a low-frequency receiver. TPMS sensors such as SP37 and FXTH87 usually use an 8-bit microcontroller. The Infineon SP40+ sensor [18] which is a successor product to SP37 also employs an 8-bit microcontroller. Thus, an 8-bit microcontroller is widely used in the TPMS sensor. TPMS sensors have constrained resources of RAM. For instance, there are 256 bytes of RAM in SP37, 160 bytes of RAM in SP40+, and 512 bytes of RAM in FXTH87. In this paper, we assume that the architecture of the TPMS sensor employs an 8-bit microcontroller and a constrained RAM. In our performance evaluation, we use the tool supporting 8-bit devices.

1.2.2. Performance Evaluation Tool

There is a free and open-source benchmarking framework named FELICS [19] to evaluate lightweight symmetric primitives in the embedded devices such as 8-bit, 16-bit, and 32-bit microcontrollers. FELICS supports evaluations of lightweight block ciphers and lightweight stream ciphers. It also provides evaluation scenarios which assume the communication protocol and the challenge-handshake authentication protocol in the IoT context. Nowadays, there are studies extending FELICS to evaluate an authenticated encryption scheme [20, 21].

1.2.3. Perspectives from Lightweight Crypto Stack

The lightweight crypto stack is summarized with essential perspectives to apply a lightweight cryptographic mechanism to the CPS. When an application of lightweight cryptographic mechanisms is constructed, consideration of integrated multiple perspectives is important to reduce the cost and to ensure the practicality. Especially, since resources for cryptographic mechanisms are constrained, it is also important that multiple cryptographic applications should be obtained from few cryptographic primitives. For instance, there have been a number of studies that have realized multiple symmetric key ciphers such as the block cipher, stream cipher, MAC, and hash function from single cryptographic primitive [2226]. The lightweight hash function Lesamnta-LW [27] specified in ISO/IEC 29192-5 is one of the primitives which has the above mentioned characteristic. It employs the internal AES-based block cipher. There is a pseudorandom function mode [28] and an authenticated encryption with associated data (AEAD) [29] based on Lesamnta-LW. We consider that we obtain multiple applications for a TPMS protocol by using one primitive. We propose our methods based on the above concept.

1.2.4. Our Contribution

In this paper, we propose the application of the ISO/IEC 29192-5 embedded software-oriented hash function Lesamnta-LW to TPMS-communication protection and key derivation for the purpose of minimizing the RAM size of cryptographic implementations. Considering the long life cycle of the vehicles, our preference is given to the 128-bit security that Lesamnta-LW is expected to offer over 80-bit security that many lightweight cryptographic primitives offer to meet very severe implementation requirements. We propose to use the known multiple pseudorandom functions (PRFs) based on Lesamnta-LW for MAC generation as well as key derivation in the NIST SP800-108-specified key derivation function (KDF) framework [30]. We also obtain the encryption method by using the internal AES-based block cipher of Lesamnta-LW. We present an authenticated encryption mechanism by using the MAC generation method and the encryption method based on Lesamnta-LW. We first clarify the implementation specification for TPMS use and then confirm the suitability of the proposed methods for the TPMS architecture by evaluating its performance on an 8-bit microcontroller which we consider a vehicle implementation environment. Our proposed KDF properties that the session key sequences for the four tires are independent of each other. As a result, we propose three applications based on Lesamnta-LW and clarify the implementation specification for the TPMS use. In our evaluation, we compare Lesamnta-LW-based PRFs and HMAC-SHA-256. We use FELICS for the performance evaluation to fairly evaluate different cryptographic mechanisms. FELICS supports the evaluation on the AVR 8-bit microcontroller such as AVR ATmega 128. In order to evaluate hash function-based mechanisms, we extend the evaluation scenario in FELICS. We evaluate the performance of each mechanism and confirm the advantage of Lesamnta-LW-based PRFs. Therefore, our approach is constructed along the lightweight crypto stack and to obtain three applications from the Lesamnta-LW-based primitive.

1.2.5. Expected Impact on TPMS Development

In recent years, 8-bit microcontrollers such as Infineon SP37 have received increasing interest from the automotive industry. From the viewpoint of a cryptographic protocol for TPMS, the implementation cost constraints are severe; in particular, the RAM cost on an 8-bit microcontroller for vehicle ECUs is considered critical. We expect that our achievement of 128-bit security on Lesamnta-LW-based PRFs will contribute to the development of TPMS in terms of cost efficiency and the long life cycle of vehicles.

We consider the problem of the key being compromised to be a serious issue. The key separation property that our KDF offers helps us to minimize the negative impact of this event.

1.2.6. Organization

In Section 2, we discuss some preliminary work related to this paper. In Section 3, we identify the problems with previous protocols and then the proposed approach. In Section 4, we evaluate the performance of the Lesamnta-LW-based PRFs and the Lesamnta-LW-based authenticated encryption mechanism. Section 5 explores the limitations of our work. Section 6 presents our conclusion.

2. Preliminary

2.1. Overview of the Target TPMS

Referring to [10], we here give a brief introduction to TPMS. In TPMS, TPMS data transmissions typically use the 433/315 MHz bands. The tire pressure sensor contains an identifier (ID) that determines the origin of the packet and filters out packets sent by other vehicles. The TPMS sensors broadcast the pressure and temperature measurements associated with their identifiers in a periodical manner. The TPMS ECU/receiver receives the packets, filters out packets, and performs temperature compensation.

The above communication between the TPMS ECU and TPMS sensor is summarized in Figure 1.

2.1.1. Tire Pressure Monitoring Sensors SP37 and SP40+

SP37 is a battery-powered sensor for TPMS and a product of Infineon. In [15], features of SP37 are summarized. This sensor has an 8-bit low-power embedded microcontroller based on Intel 8051, and we can use the instruction set compatible to the standard 8051 processor. 6 kB of flash memory for application codes, 16 kB of ROM for ROM library functions, and 256 bytes of RAM are present. Customers can implement their applications to this sensor and store them to flash memory.

SP40+ is a successor product to SP37. In [18], features of SP40+ are summarized. 12 kB of flash memory for application codes, 40 kB of ROM for firmware, and 160 bytes of RAM are present.

2.1.2. Tire Pressure Monitoring Sensor FXTH87

FXTH87 is a sensor used for TPMS and a product of NXP. In [17], features of FXTH87 are summarized. This sensor has an 8-bit S08 microcontroller. 8 kB of flash memory for application codes and 512 bytes of RAM are present. Customers can implement their applications to this sensor and store them to flash memory.

2.2. Lightweight Crypto Stack for Embedded Systems

In the lightweight crypto stack, there are six components, e.g., the cryptographic primitive, mode of operation, protocol, standard, specification, and implementation. We describe them by using the stack form as shown in Figure 2. The cryptographic primitive is described by a primitive. In a mode of operation, we consider how to use primitives to protect confidentiality and/or integrity. Cryptographic components in a protocol consist of primitives and modes of operation. When we use cryptographic techniques in a practical system, we choose standardized one to use more reliable techniques. We clarify detailed specifications of applications in the system to evaluate performances and costs. We implement them to evaluate performances on the microcontroller and clarify effectiveness and feasibility in the practical environment. When we propose applications of cryptographic mechanisms for the practical system, we consider them along the lightweight crypto stack.

In the embedded system, implementation resources are severely constrained. From perspectives between the primitive and the protocol, we consider that multiple applications are obtained from few primitives to reduce costs for the cryptographic mechanisms in a system.

2.3. Applications of Lesamnta-LW Lightweight Hash Function
2.3.1. Notations and Definitions

Following [28], we introduce notations and definitions for explaining specifications of cryptographic mechanisms. Let . For any nonnegative integer , is identified with the set of all sequences of length . is the set of the empty sequence . Let .

For , the length of is denoted by . The concatenation of and in is denoted by .

For any natural number , let be . Let denote the set of all permutations on . represents an identity permutation. Let be the set of all block ciphers with key size and block size . A block cipher in is called a block cipher.

Let . We say that is pairwise distinct everywhere if, for any pair of distinct permutations , for every .

2.3.2. Hashing Mode of Lesamnta-LW and Its Variant with MDP

Lesamnta-LW is a Merkle–Damgård iterated hash function [27]. It is the plain Merkle–Damgård iteration of a block cipher taking input as -bit key and -bit plaintext in , where is a positive even integer. The input of from the top is its key input. is an initialization vector, where . are the message blocks, where for .

The variant of the hashing mode of Lesamnta-LW with the MDP domain extension [31] is introduced as follows. Hereafter, it is assumed that the underlying block cipher is in , where . The MDP variant with a permutation on is the function , which is defined as follows: for and ,such thatwhere and for . Note that need not be a cryptographic primitive. Thus, the computational overhead of can be very small.

2.3.3. Multiple PRFs Based on Lesamnta-LW

Let be a keyed function such that , where , , and . is a secret key, and is an initialization vector. is also denoted by . For and , let

Suppose that is pairwise distinct everywhere and that for any , and , such that .

Theorem 1 (see [27]). This theorem states that and are two independent PRFs with a single key if is a PRP. It is depicted in Figure 3. In this way, one cryptographic primitive can be converted to produce multiple cryptographic functions with a small additional cost.

In [27], functions used in Lesamnta-LW-based PRFs are not specified. Hence, when applied to real-world systems, one has to specify them.

2.4. HMAC-SHA-256: Hash Function-Based PRF

HMAC-SHA-256 [32] is a widely known PRF based on the SHA-256 [33] hash function for a general purpose. The overview of HMAC-SHA-256 is given in Figure 4, where is a message input, is a secret key, is SHA-256, ipad = 0 × 3636...36, and opad = 0 × 5c5c...5c.

3. The Problems and Our Approaches

3.1. The Problems

This section identifies several problems with previous protocols.

3.1.1. Security Properties of TPMS

The following aspects of cryptographic application to TPMS require clarification.

From the explanations given in the previous works, it is not systematically selected which data are protected for confidentiality and which data are protected for integrity. It is necessary to protect IDs with regards to confidentiality, and this is the case for ensuring location privacy.

The lightweight application of cryptographic primitives is derived by considering what is really needed to counter the targeted threats. More specifically, which data should be protected for which security perspective, namely, confidentiality or integrity, is considered in a more optimized manner.

In the protocol proposed in [12], KATAN32 and CBC-MAC are used as the underlying primitive and mode of operation. However, KATAN32 only accepts small key and plaintext input lengths; hence, it is not clear to us whether the security strength of the proposed protocol is appropriate for long-term security over the life cycles that vehicles typically (should) achieve.

PRESENT and SPECK also take small plaintext sizes because they have small block sizes. Therefore, it is not clear to us whether the security strength of the proposed protocol in [6, 16] is appropriate for long-term security over the life cycles that vehicles typically (should) achieve.

3.1.2. Implementation Cost for the TPMS Sensors

The cryptographic protocol for TPMS presented in [12] assumes that both the tire pressure sensors and the vehicle ECU have the hardware components for cryptography. Although hardware implementations of cryptography are effective in some cases, under the current circumstance of a tire pressure sensor, it is not reasonable to assume that a hardware-based cryptographic solution is the immediate choice.

TPMS faces severe cost constraints. For the vehicle ECU, it is expected that the cryptographic mechanisms are typically implemented in software on an 8-bit low-cost microcontroller. The relevant computation cost metrics are the amount of RAM consumption, which could be critical, the execution time, and the code size. As for applications to the TPMS sensors, implementations of cryptographic mechanisms must require a small amount of RAM.

In [12], the proposed protocol assumes that the cryptographic primitive and random number generator are employed in the TPMS sensors. Although the implementation of this protocol is evaluated, it is not clear to us whether the above assumption is realistic.

To reduce the implementation cost of TPMS-PRF using SHA-256, we investigate the applicability of lightweight cryptographic primitives. The known performance metrics of lightweight cryptographic primitives include the circuit size, power consumption, and latency for hardware, and the memory size and latency for software. Lightweight cryptographic primitives are typically designed for the target constraint device and are likely to be either hardware oriented or software oriented.

Regarding TPMS-PRF, we point out that the software implementation requiring small amounts of RAM on the vehicle ECU is the critical factor to consider. Note that regarding TPMS, the computation time is typically on the order of milliseconds (ms); therefore, this is not expected to be critical for cryptography.

In [6], a lightweight protocol has been proposed using lightweight block ciphers such as SPECK and PRESENT, and CBC-MAC to be used as the underlying ciphers and mode of operation, respectively. The applicability of this protocol was studied using SP37 sensors. The proposed protocol is similar to the protocol proposed in [12] and processing 96-bit data frames. However, they showed that implementation evaluation where the environment is SP37 8-bit microcontrollers. The lightweight metrics of energy consumption and power consumption for the TPMS sensors are the main focus of the evaluation experiments. Table 1 shows the performances of previous cryptographic protocols for TPMS.


MechanismKey length (bits)RAM (bytes)ROM (bytes)Comp. time (ms)Evaluation
environment
Reference

KATAN32-based protocol80N/AN/A36.6Arduino Uno + RFM22[12]
PRESENT-based protocol8027846303.3SP37[6]
SPECK-based protocol1282086529.1SP37[6]
PRESENT-based
Enc-then-MAC
80 or 128 (unspecified)5027,01319.4RL78[16]

In this study, KATAN32-based implementation requires 1231uJ w.r.t power [12].
3.1.3. Key Management Required for Secure TPMS Communication

One of the key characteristics of the TPMS is that, unlike many IT systems, the sender (ECU) has to communicate with multiple (four) receivers in the form of the TPMS sensors.

The protocol in [12] assumed that the master key is installed in a secure environment, such as the car dealer stores. This suggests that the protocol assumes that individuals do not replace their own tires. The authors refer to the TESLA protocol [34] but claim that this protocol is not suitable for TPMS because there are only four receivers, even if the broadcast protocol is applied. The authors propose the session key establishment protocol and evaluate the FPGA implementations using KATAN block ciphers in terms of power and delay.

In [6], the assumption that the master key is installed at secure locations is removed, allowing tires to be changed at places other than secure garage. This protocol recommends using the standard technique specified in [35] for key establishment. However, this standard was developed for generic purposes rather than specific wireless systems such as TPMS.

In [16], the authors propose a protocol using PRESENT as underlying lightweight cipher and CMAC mode as the mode of operation. They showed the simple Enc-then-MAC paradigm by PRESENT and CMAC. This protocol was evaluated by simulating four sensors. Consequently, the authors showed that their implementations are suitable for the NXP FXTH87 TPMS sensor. However, it is not clear to us how their protocol solves the key management issue.

The important key management problem is that none of the above works [6, 12, 16] appears to explore the solutions for session key generation or key derivation that are suitable for the TPMS architecture. That is, the functionalities of encryption/integrity have to be performed in software on the TPMS devices that are severely constrained in terms of RAM, all while addressing the issue of preventing the key from being compromised.

3.2. Our Approaches

This section explains how we propose to deal with the problems identified in the previous subsection. We consider our approaches along the lightweight crypto stack as shown in Figure 2.

3.2.1. Applying Lesamnta-LW Hash Function to TPMS Key Derivation

It would be a challenge that the key management problem is solved at a low cost. More specifically, we obtain different session key sequences from one master key without having many cryptographic primitives installed in the receiver. Different session key sequences, depending on the receiver, namely, TPMS sensors, would be better than the same session key sequences from security perspectives.

We propose to apply to multiple PRFs based on Lesamnta-LW to the NIST framework of NIST SP 800-108 on key derivation using PRFs [30] that describes how to generate or derivate the session keys required for confidentiality and/or integrity protection, which could be performed by means of KDF, as shown in Figure 5. Figure 5 shows the example on the right front (RF) tire and the left front (LF) tire. Here, for the 16-byte encryption key and the 16-byte authenticated key , is generated as the output of the 32-byte output of each call to Lesamnta-LW-. In this way, we achieve key separation, meaning that the compromise of some keys must not degrade the security of any of the other keys that are obtained from the output of the same KDF execution.

We show how to manage the session keys for the encryption and authentication in four tires. Four tires are denoted by the RF tire, the LF tire, the right back (RB) tire, and the left back (LB) tire. We assume that one master key is installed in the ECU and each TPMS sensor. We use PRFs based on Lesamnta-LW to obtain four independent session key sequences from a master key. As mentioned in Section 2.3.3, PRFs based on Lesamnta-LW can construct independent PRFs by changing the permutation . Let , , , and be session keys for each tire. Let , , , and be fixed input data for each tire. The ECU sends each fixed input data to each sensor. Let , , , and be KDFs constructed by independent PRFs for each tire. The session keys are given by , , , and . When a sensor updates the session key, a sensor updates the counter and calculates value for the session key by PRF. The ECU can obtain the session keys by using same process. We show the overview of the above process in Figure 6.

We discuss the scenario of the session key compromise. By achieving key separation, even if one session key is compromised, there is no degradation of security in other three session keys. Since a session key is derived from the master key, fixed input value, and counter by using Lesamnta-LW-based PRFs, we consider that it is difficult for attackers to derive past session keys and future session keys from the compromised session key. Therefore, if a past TPMS message uses different session keys, our approach can prevent attack with the compromised session key.

Considering the 10-year life cycle of vehicles, we choose cryptographic primitives with a key length of 128 bits for our evaluation. For a real-world use, we focus on the standardized cryptographic primitives.

In ISO/IEC 29192-5 [36], there are three hash functions, namely, PHOTON [37], SPONGENT [38], and Lesamnta-LW [27]. We chose Lesamnta-LW for our consideration because this standard characterizes this function as the (embedded)-software-oriented hash function, whereas PHOTON and SPONGENT are characterized as hardware-oriented hash functions.

3.2.2. Applying Cryptographic Hash Functions for Authenticated Encryption

To achieve the confidentiality and integrity of TPMS packets, we apply the Enc-then-MAC mechanism as is proposed in [16]. To reduce the implementation cost, for integrity protection of the TPMS communication, we again propose to use PRFs based on Lesamnta-LW as MAC generation algorithms. Note that the function is changed from those used in PRFs for KDF. For TPMS-packet confidentiality protection, following the use of a block cipher in counter mode proposed in [16], we apply the underlying block cipher used in Lesamnta-LW in the counter mode. By reusing Lesamnta-LW as the cryptographic primitive, we expect to reduce the total cost for integrity protection as well as key derivation.

For each data field in the TPMS packet, Table 2 lists which property is protected in terms of confidentiality (C) and/or integrity (I).


MechanismSensor IDPressureTemperatureReference

KATAN32-based protocolCII[12]
PRESENT-based protocolC, IC, IC, I[6]
SPECK-based protocolC, IC, IC, I[6]
PRESENT-based Enc-then-MACC, IC, IC, I[16]
Lesamnta-LW-based PRFC, IC, IC, IThis paper

3.2.3. FELICS-Enhanced Performance Evaluation

We choose FELICS [19] as the evaluation tool. FELICS is a free and open-source benchmarking tool designed for software implementations of lightweight cryptographic primitives for embedded devices. It evaluates the performance of 21 lightweight block ciphers and three lightweight stream ciphers on the target microcontrollers: 8-bit AVR ATmega 128. The metrics are the execution time, RAM consumption, and binary code size. 32 general purpose registers are present. In its Harvard memory architecture, there is 128 kB of Flash and 4 kB of SRAM. This microcontroller has more implementation resources than those of SP37 as shown in Section 2.1.1. The limitations of our approach for implementations are mentioned in Section 5.

FELICS is an implementation performance evaluation tool for block ciphers and stream ciphers on microcontrollers. However, hash functions are not considered in the FELICS evaluation.

We first explain what is investigated regarding the interface of hash functions. To evaluate hash functions on FELICS, we view them as the composition of a mode of operation and the underlying cryptographic primitive such as a block cipher. For example, Lesamnta-LW employs the AES-based block cipher as its underlying cryptographic primitive, whereas SHA-256 employs the SHACAL-2 block cipher [39]. Therefore, we evaluate hash functions on FELICS using the following processes:(i)Implement the internal process of hash functions as the block cipher(ii)Implement an iterative process that depends on the message length as the evaluation scenario in FELICS

We also implement hash function-based modes of operation such as PRF, HMAC, and Enc-then-MAC as evaluation scenarios in FELICS. Our work of FELICS extension is summarized in Figure 7 where the files we added are indicated in italic.

It is important to evaluate the performance of the PRFs taking input messages shorter than 16 bytes. This is because we study how small the communication cost can be.

As for data units, the minimum data unit for all of our implementations is the uint8_t adopted by the FELICS encryption process evaluation adopts.

4. Our Evaluation Results on PRF Employing a Lesamnta-LW Hash Function

For application to TPMS, we clarify the specification of the Lesamnta-LW-based PRFs introduced in Section 2 by specifying the functions. Moreover, we evaluate their performance in the extended FELICS as explained in Section 3.2.3. We also evaluate the performance of HMAC employing the SHA-256 hash function to show the effectiveness of the Lesamnta-LW-based PRFs compared with those based on a general purpose hash function.

4.1. Specification of Function

We consider that PRF is used for generating session keys, namely, and and the MACs in the vehicle ECU and four tires. As we use distinct values for the session keys in tires, different tires need different functions. Therefore, our Enc-then-MAC mechanism uses five functions. We now specify the functions. The conditions on them are given as follows:(1)Any pair of distinct permutations , for every (2) for any and , such that

In [28], the consideration of function is given as follows:

Remark 1. (see [28]). Let and be integers such that . Let and . Let be distinct constants in . Let be distinct nonzero constants in . Suppose that for and that for . Then,(i) is pairwise distinct everywhere(ii)Since , if The proofs of security of PRFs including the situation of Remark 1 are given in [28]. Therefore, we determine five functions as follows: , . These functions fulfill condition 1. We use IVs that have the same value in four bits from the least significant bit (LSB) to fulfill condition 2. Since our functions fulfill condition 1, they derive different values from the IVs.

4.2. Our Optimized Implementations of Lesamnta-LW and SHA-256

There is a reference implementation of Lesamnta-LW written by Kuwakado [40]. In his implementation of the underlying AES-based block cipher, a key scheduling process is performed until all round keys are generated. This implementation requires RAM to store all of the round keys. Based on this, we develop RAM-optimized implementations of cryptographic primitives in Lesamnta-LW.

Our implementation of Lesamnta-LW sequentially performs an encryption process and a key scheduling process in the round function. This implementation reduces the RAM required for data by decreasing that required for round keys.

In our implementations for both Lesamnta-LW and SHA-256, we mainly use uint32_t integers. The interfaces of input value in FELICS use uint8_t integers. Referring to the code of Trivium [41] in FELICS, we optimize the process in changing uint8_t to uint32_t. When we define a uint32_t array for storing uint8_t input values, we use a pointer as follows:where ex and ex32 are the uint8_t and uint32_t arrays, respectively. In this case, we modify the byte order of ex32 to match that of ex. Since ex32 shares RAM with ex, we can reduce the RAM consumption.

In our implementation of S-box and the round constants of both Lesamnta-LW and SHA-256, we use table-lookup implementations and store constants of S-box in ROM.

4.3. Our Results on Lesamnta-LW-Based PRFs for KDFs and MACs

Table 3 presents our implementation results on PRF employing Lesamnta-LW, namely, Lesamnta-LW- for , and HMAC employing SHA-256, namely, HMAC-SHA-256, on an AVR ATmega 128 platform. Note that only implementations in C are considered here, and we use an 8-byte message.


NameCode (byte)RAM (data) (byte)RAM (stack) (byte)No of cycles @16 MHzTime (ms)Compiler option

Lesamnta-LW-PRF/17226457759254.75−O1
Lesamnta-LW-PRF/17806452683614.27−O2
Lesamnta-LW-PRF/23006442539563.37−O3
Lesamnta-LW-PRF/17026459772814.83−Os
Lesamnta-LW-PRF/17326457759324.75−O1
Lesamnta-LW-PRF/17906452683684.27−O2
Lesamnta-LW-PRF/23106442539633.37−O3
Lesamnta-LW-PRF/17126459772884.83−Os
HMAC-SHA-25624326089765946941.22−O1
HMAC-SHA-25623846089965955241.22−O2
HMAC-SHA-256278260810767439242.15−O3
HMAC-SHA-256246860810770396044.00−Os

We consider that the process of xoring 0x0 is skipped by optimization of the compiler.

According to Table 3, PRF employing a Lesamnta-LW hash function shows a better performance than HMAC-SHA-256 in terms of each metrics. Interestingly, our results show that Lesamnta-LW- is about ten times faster than HMAC-SHA-256, and the amount of RAM on Lesamnta-LW- is about one-tenth of the amount of RAM on HMAC-SHA-256. Since execution time is obtained from the number of cycles consumed in the cryptographic process, the fewer the cycles cryptographic process requires, the faster the cryptographic process is. Our results show that Lesamnta-LW- can have an advantage over HMAC-SHA-256, in terms of RAM and time for the sensors for TPMS.

4.4. Our Results on Lesamnta-LW-Based Authenticated Encryption

In Table 4, we present our implementation results on Lesamnta-LW-based authenticated encryption. Note that only implementation in C is considered here, and we use an 8-byte message. We evaluate the performance of the Lesamnta-LW-based Enc-then-MAC mechanism. In our implementations, RAM (Data) contains data of the block, message, encryption key, authentication key, counter, and IV. Our approach requires 120 (= 32 + 8+16 + 16+32 + 16) RAM (Data) bytes. Remarkably, our mechanism only requires 183 (= 120 + 63) RAM bytes.


MechanismCode (byte)RAM (data) (byte)RAM (stack) (byte)No. of cycles @16 MHzTime (ms)Compiler option

Lesamnta-LW-based Enc-then-MAC1846120741556529.73−O1
1962120681444499.03−O2
2726120631149637.19−O3
1836120811578029.86−Os

5. Limitation

Our experimental results on 8-bit AVR microcontrollers are at the simulation level, whereas the real implementation environment for TPMS, such as SP37, might be more severe regarding the implementation resources available for cryptographic mechanisms. Therefore, further investigations would be needed.

All the codes we developed and evaluated here are written in C language. Since the optimization level depends on the compiler, the optimization for performance is limited.

Our key management method is available for the management of session keys. The method of the management of the master key is important but is not provided in our paper.

We show the authenticated encryption scheme based on Lesamnta-LW by using the Enc-then-MAC technique. The comparison between our scheme and the Lesamnta-LW-based AEAD scheme is not provided in this paper because our paper has been submitted before the presentation of the Lesamnta-LW-based AEAD scheme.

6. Conclusion

In TPMS, the implementation cost constraints are severe, particularly the RAM cost on 8-bit microcontrollers for vehicle ECUs. In this paper, we considered the lightweight crypto stack for TPMS and proposed the application of the known multiple PRFs based on lightweight hash function Lesamnta-LW to TPMS to ensure the confidentiality/integrity of data packet as well as to offer reasonable solutions for the key derivation in line with the NIST SP 800-108-specified KDF framework.

We confirmed the significant advantages of these proposed methods over the standard stack, namely, HMAC-SHA-256, by conducting experiments and evaluating the performance on the AVR 8-bit microcontrollers, on which we consider simulating TPMS sensors.

We expect that our results on Lesamnta-LW-based PRFs achieving 128-bit security contribute to the TPMS development from perspectives of its cost efficiency and of the long life cycle of the vehicle.

Furthermore, our proposed KDF shows an interesting property that the session key sequences for the four tires are independent of each other. We consider key compromise to be a serious issue. Having the key separation property that our KDF offers, the negative impact when this event happens would be minimized.

In future work, binding TESLA to our stack should help TPMS developers in terms of their cryptographic applications and implementations.

Data Availability

The data used to support the findings of this study have not been made available because of the contract of the collaboration research.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Y. Watanabe, H. Yamamoto, and H. Yoshida, “A study on the applicability of the Lesamnta-LW lightweight hash function to tpms,” in Proceedings of the 5th Embedded Security in Cars Conference Asia (escar Asia 2018), Tokyo, Japan, 2018. View at: Google Scholar
  2. H. Yoshida, “On the design and use of lightweight cryptography for cyber-physical systems,” in Proceedings of the 8th Asian Workshop on Symmetric Key Cryptography (ASK 2018), Kolkata, India, 2018, https://www.isical.ac.in/∼ask2018/slides/hirotaka-yoshida.pdf. View at: Google Scholar
  3. K. Koscher, A. Czeskis, F. Roesner et al., “Experimental security analysis of a modern automobile,” in Proceedings of the 31st IEEE Symposium on Security and Privacy (S&P 2010), pp. 447–462, Oakland, CA, USA, May 2010. View at: Google Scholar
  4. S. Checkoway, D. McCoy, B. Kantor et al., “Comprehensive experimental analyses of automotive attack surfaces,” in Proceedings of the 2011 20th USENIX Security Symposium, San Francisco, CA, USA, August 2011. View at: Google Scholar
  5. J. Petit and S. E. Shladover, “Potential cyberattacks on automated vehicles,” IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 2, pp. 546–556, 2015. View at: Google Scholar
  6. C. Solomon and B. Groza, “Limon-lightweight authentication for tire pressure monitoring sensors,” in Proceedings of the Security of Industrial Control Systems and Cyber Physical Systems-First Workshop, CyberICS 2015 and First Workshop, WOS-CPS 2015, pp. 95–111, Vienna, Austria, 2015. View at: Google Scholar
  7. S. Govindjee, Firestone Tire Failure Analysis, 2001, http://faculty.ce.berkeley.edu/sanjay/REPORT_Secure.PDF.
  8. National Highway Traffic Safety Administration, Federal Motor Vehicle Safety Standards; Tire Pressure Monitoring Systems; Controls and Displays, NHTSA, Washington, DC, USA, 2005, https://www.nhtsa.gov/sites/nhtsa.dot.gov/files/fmvss/TPMSfinalrule_6.pdf.
  9. European Commission, “Cars safer from 1 November 2012,” 2012, http://europa.eu/rapid/press-release_IP-12-1169_en.htm. View at: Google Scholar
  10. I. Rouf, R. D. Miller, H. A. Mustafa et al., “Security and privacy vulnerabilities of in-car wireless networks: a tire pressure monitoring system case study,” in Proceedings of the 19th USENIX Security Symposium, Washington, DC, USA, August 2010. View at: Google Scholar
  11. C. De Cannière, O. Dunkelman, and M. Knezevic, “KATAN and KTANTAN - a family of small and efficient hardware-oriented block ciphers,” in Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems-CHES 2009, pp. 272–288, Lausanne, Switzerland, September 2009. View at: Google Scholar
  12. M. Xu, W. Xu, J. Walker, and B. Moore, “Lightweight secure communication protocols for in-vehicle sensor networks,” in Proceedings of the 2013 ACM Workshop on Security, Privacy and Dependability for CyberVehicles, Co-located with CCS 2013 CyCAR’13, Berlin, Germany, November 2013. View at: Google Scholar
  13. R. Beaulieu, D. Shors, J. Smith, S. Treatman-Clark, B. Weeks, and L. Wingers, “SIMON and SPECK: block ciphers for the internet of things,” IACR Cryptology ePrint Archive, vol. 2015, no. 585, 2015. View at: Google Scholar
  14. A. Bogdanov, L. R. Knudsen, G. Leander et al., “PRESENT: an ultralightweight block cipher,” in Proceedings of the 9th International Workshop on Cryptographic Hardware and Embedded Systems-CHES 2007, pp. 450–466, Vienna, Austria, September 2007. View at: Google Scholar
  15. Infineon Technologies AG, Sp37 High Integrated Single-Chip Tpms Sensor with a Low Power Embedded Micro-Controller and Wireless fsk/ask uhf Transmitter, Infineon, Neubiberg, Germany, 2012.
  16. K. Emura, T. Hayashi, and S. Moriai, “Toward securing tire pressure monitoring systems: a case of present-based implementation,” in Proceedings of the 2016 International Symposium on Information Theory and its Applications (ISITA 2016), pp. 403–407, Monterey, CA, USA, April 2016. View at: Google Scholar
  17. NXP Semiconductors, Fxth87 tire pressure monitor sensor family, https://www.nxp.com/products/sensors/pressure-sensors/tire-pressure-monitoring-sensors/fxth87-tire-pressure-monitor-sensor-family:fxth87.
  18. Infineon Technologies AG, Sp40plus Tire Pressure Monitoring Sensor, Infineon, Neubiberg, Germany, 2020.
  19. FELICS, Fair evaluation of lightweight cryptographic systems, https://www.cryptolux.org/index.php/FELICS.
  20. L. Cardoso dos Santos, J. Großschädl, and A. Biryukov, “FELICS-AEAD: benchmarking of lightweight authenticated encryption algorithms,” in Proceedings of the 2019 NIST Lightweight Cryptography Workshop, Gaithersburg, MD, USA, 2019. View at: Google Scholar
  21. K. Le Gouguec, “FELICS-AE: a framework to benchmark lightweight autheticated block ciphers,” in Proceedings of the 2019 NIST Lightweight Cryptography Workshop, Gaithersburg, MD, USA, 2019. View at: Google Scholar
  22. D. J. Bernstein, S. Kölbl et al., “GIMLI: a cross-platform permutation,” in Proceedings of the 19th International Conference Cryptographic Hardware and Embedded Systems (CHES 2017), pp. 299–320, Taipei, Taiwan, 2017. View at: Google Scholar
  23. R. AlTawy, R. Rohit, M. He, K. Mandal, G. Yang, and G. Gong, “SLISCP-light: towards hardware optimized sponge-specific cryptographic permutations,” ACM Transactions on Embedded Computing Systems, vol. 17, no. 4, pp. 81:1–81:26, 2018. View at: Google Scholar
  24. K. Stoffelen and J. Daemen, “Column parity mixers,” IACR Transactions on Symmetric Cryptology, vol. 2018, no. 1, pp. 126–159, 2018. View at: Google Scholar
  25. J. Daemen, S. Hoffert, G. Van Assche, and R. Van Keer, “The design of Xoodoo and Xoofff,” IACR Transactions on Symmetric Cryptology, vol. 2018, no. 4, pp. 1–38, 2018. View at: Google Scholar
  26. R. AlTawy, R. Rohit, M. He, K. Mandal, G. Yang, and G. Gong, “Towards a cryptographic minimal design: the sLISCP family of permutations,” IEEE Transactions on Computers, vol. 67, no. 9, pp. 1341–1358, 2018. View at: Publisher Site | Google Scholar
  27. S. Hirose, K. Ideguchi, H. Kuwakado, T. Owada, B. Preneel, and H. Yoshida, “An AES based 256-bit hash function for lightweight applications: Lesamnta-LW,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E95-A, no. 1, pp. 89–99, 2012. View at: Publisher Site | Google Scholar
  28. S. Hirose, H. Kuwakado, and H. Yoshida, “A pseudorandom-function mode based on Lesamnta-LW and the MDP domain extension and its applications,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E101.A, no. 1, pp. 110–118, 2018. View at: Publisher Site | Google Scholar
  29. S. Hirose, H. Kuwakado, and H. Yoshida, “Authenticated encryption based on Lesamnta-LW hashing mode,” in Proceedings of the 22nd International Conference on Information Security and Cryptology (ICISC 2019), pp. 52–69, Seoul, South Korea, December 2019. View at: Google Scholar
  30. NIST, Special publication 800-108 recommendation for key derivation using pseudorandom functions (revised), NIST, Gaithersburg, MD, USA, 2009.
  31. S. Hirose, J. H. Park, and A. Yun, “A simple variant of the Merkle-Damgård scheme with a permutation,” Journal of Cryptology, vol. 25, no. 2, pp. 271–309, 2012. View at: Publisher Site | Google Scholar
  32. M. Bellare, R. Canetti, and H. Krawczyk, “Keying hash functions for message authentication,” in Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology-CRYPTO ’96, pp. 1–15, Santa Barbara, CA, USA, August 1996. View at: Google Scholar
  33. FIPS PUB 180-4, Secure hash standard (shs), August 2015.
  34. A. Perrig, R. Canetti, J. D. Tygar, and D. Song, “The TESLA broadcast authentication protocol,” RSA CryptoBytes, vol. 5, no. 2, pp. 2–13, 2002. View at: Google Scholar
  35. ISO/IEC 9798-2:2008 information technology–security techniques–entity authentication–part 2: Mechanisms using symmetric encipherment algorithms.
  36. ISO/IEC 29192-5:2016 information technology–security techniques–lightweight cryptography–part 5: hash-functions.
  37. J. Guo, T. Peyrin, and A. Poschmann, “The PHOTON family of lightweight hash functions,” in Proceedings of the 31st Annual Cryptology Conference on Advances in Cryptology-CRYPTO 2011, pp. 222–239, Santa Barbara, CA, USA, August 2011. View at: Google Scholar
  38. A. Bogdanov, M. Knezevic, G. Leander, D. Toz, K. Varici, and I. Verbauwhede, “SPONGENT: a lightweight hash function,” in Proceedings of the 13th International Workshop Cryptographic Hardware and Embedded Systems (CHES 2011), pp. 312–325, Nara, Japan, September 2011. View at: Google Scholar
  39. H. Handschuh and D. Naccache, “Shacal,” in Proceedings of the First open NESSIE Workshop, Heverlee, Belgium, 2000. View at: Google Scholar
  40. H. Kuwakado, “Lesamnta-LW reference c99 implementation,” 2015, https://github.com/kuwakado/Lesamnta-LW. View at: Google Scholar
  41. C. De Cannière, “Trivium: a stream cipher construction inspired by block cipher design principles,” in Proceedings of the 9th International Conference on Information Security (ISC 2006), pp. 171–186, Samos Island, Greece, August 2006. View at: Google Scholar

Copyright © 2020 Yuhei Watanabe et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views156
Downloads49
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.