Khudra: A New Lightweight Block Cipher for FPGAs

Kolay, Souvik; Mukhopadhyay, Debdeep

doi:10.1007/978-3-319-12060-7_9

Cited by 28 publications

(25 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as in this evaluation, we mainly focus on the area, and power consumption, we do not elaborate into those design alternatives. Interested readers can look into [13]. Similar observations can be made for the implementations on FPGA platforms also.…”

Section: Asic Design Flow and Metricsmentioning

confidence: 65%

“…The area requirement for KHUDRA is slightly lesser, while the better throughput for PRESENT is due to less number of rounds, followed by SPECK. However, as mentioned in the paper [13], the throughput of KHUDRA can be improved significantly at the cost of slight increase in area. The inner rounds could be unrolled at slight increase in both area and latency (note that each round is a small 16×16 Feistel structure, using 4×4 SBoxes, and this reduces the overall clock cycles increasing the throughput significantly.…”

Section: Asic Design Flow and Metricsmentioning

confidence: 99%

“…According to ECRYPT's stream cipher benchmarks (eBASC), 1 Speck is one of the fastest ciphers available, both for long as well as short plaintext messages. KHUDRA [13] is a lightweight block cipher targeted specifically for FPGA platforms. It uses a recursive Feistel structure and focuses on balancing the use of look-up-tables (LUTs) and registers, so as to minimize the requirement of FPGA slices.…”

Section: Our Contributionsmentioning

confidence: 99%

“…The block cipher KHUDRA [13] was designed keeping in mind the requirement of designing block ciphers which are also lightweight on FPGAs that are often preferred where reconfigurability and low development cost is a mandate. It has been shown that some algorithm choices like PRESENT are more apt for ASIC libraries with specialized library cells, while on FPGAs their compactness diminishes [13].…”

Section: Khudra-64/80mentioning

confidence: 99%

“…It has been shown that some algorithm choices like PRESENT are more apt for ASIC libraries with specialized library cells, while on FPGAs their compactness diminishes [13]. KHUDRA is unique in that way as its design process is with FPGAs as primary target.…”

Section: Khudra-64/80mentioning

confidence: 99%

See 4 more Smart Citations

An Evaluation of Lightweight Block Ciphers for Resource-Constrained Applications: Area, Performance, and Security

et al. 2017

Self Cite

View full text Add to dashboard Cite

In March 2017, NIST (National Institute of Standards and Technology) has announced to create a portfolio of lightweight algorithms through an open process. The report emphasizes that with emerging applications like automotive systems, sensor networks, healthcare, distributed control systems, the Internet of Things (IoT), cyber-physical systems, and the smart grid, a detailed evaluation of the so called light-weight ciphers helps to recommend algorithms in the context of profiles, which describe physical, performance, and security characteristics. In recent years, a number of lightweight block ciphers have been proposed for encryption/decryption of data which makes such choices complex. Each such cipher offers a unique combination of resistance to classical cryptanalysis and resource-efficient implementations. At the same time, these implementations must be protected against implementation-based attacks such as side-channel analysis. In this paper, we present a holistic comparison study of four lightweight block ciphers, PRESENT, SIMON, SPECK, and KHUDRA, along with the more traditional Advanced Encryption Standard (AES). We present a uniform comparison of the performance and efficiency of these block ciphers in terms of area and power consumption, on ASIC and FPGA-based platforms. Additionally, we also compare the amenability to side-channel secure implementations for these ciphers on ASIC-based platforms. Our study is expected to help designers make suitable choices when securing a given application, across a wide range of implementation platforms.

show abstract

Section: Asic Design Flow and Metricsmentioning

confidence: 65%

Section: Asic Design Flow and Metricsmentioning

confidence: 99%

Section: Our Contributionsmentioning

confidence: 99%

Section: Khudra-64/80mentioning

confidence: 99%

Section: Khudra-64/80mentioning

confidence: 99%

See 3 more Smart Citations

An Evaluation of Lightweight Block Ciphers for Resource-Constrained Applications: Area, Performance, and Security

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

Hardware Trojan detection for lightweight ciphers implemented on field‐programmable gate arrays using the replay algorithm

Abed

Mohd

Hayajneh

et al. 2021

Circuit Theory & Apps

View full text Add to dashboard Cite

Summary Hardware Trojans (HTs) are malicious and intentional modification of the hardware design, embedded by an adversary to leak sensitive data, modify functionality, or cause malfunction. Lightweight ciphers are designed for resource‐constrained devices (RCDs) to balance resources and security, but often targeted by HTs. This work aims to create a trusted lightweight cipher design and detect complex sequential HTs using a runtime monitoring method with minimal resource overhead. The novelty of the approach is that it combines full or partial temporal redundancy, resource minimization, and runtime monitoring. The algorithm employs temporal redundancy, by executing a first run of the cipher, and then replays the cipher fully (ReplayN method) or partially (ReplayN/2 method). A mismatch indicates HT activity, and a third replay is executed to determine the correct results. The ReplayN/2 algorithm further optimizes time and energy by limiting replay to the second half of the cipher rounds. The proposed method is compared with other existing methods including triple modular redundancy (TMR), adapted triple modular redundancy (ATMR), and reverse‐function redundancy (RFR). All methods were implemented in field‐programmable gate array (FPGA) technology. Implementation performance metrics were measured and compared, including resource utilization (i.e., logical elements [LEs]), power, energy (E), and speed (i.e., Fmax). The results show that the proposed algorithm outperforms existing methods in most of the metrics. In terms of speed and area, the replay algorithm is faster by 24% and reduces total LEs by 42% when compared with existing methods. Regarding power, replay algorithm reduces power by 45% when compared with TMR and ATMR. With respect to energy, replay methods reduce energy by an average of 6% when compared with TMR and ATMR. The ReplayN/2 reduces energy by an average 15% when compared with TMR and ATMR. Based on the normalE×LE (i.e., energy × area) metric, ReplayN/2 is the top performing method as it balances area and energy metrics. Using normalE×LEnormalFmax metric, the replay methods are the best performing methods as they best balance area, energy, and speed. Also, based on ThroughputLE2 metric, the replay methods are the top performing methods.

show abstract

Security analysis of Khudra: a lightweight block cipher for FPGAs

Yibin

Chen

2015

Security Comm. Networks

View full text Add to dashboard Cite

Khudra is a lightweight block cipher for field‐programmable gate arrays, which appeared in SPACE 2014. In this paper, we consider the security of Khudra against the related‐key attack. Firstly, we give some observations of F‐function. Then we design a simple searching algorithm for related‐key differential characteristics. By utilizing the observations and the searching algorithm, we launch related‐key differential attacks on 16‐round Khudra and full Khudra without whitening keys. Furthermore, we build a 13‐round related‐key rectangle distinguisher and attack on 16‐round Khudra, which requires 253 chosen plaintexts and 264.08 encryptions. Moreover, with the 13‐round distinguisher, there exists an attack on full Khudra without whitening keys. Then, we present a 14‐round related‐key impossible differential distinguisher. However, the 14‐round distinguisher cannot work well, we propose a 11‐round related‐key impossible differential, which lead to an attack on 14‐round Khudra without the pre‐whitening keys. These results provide a helpful understanding of Khudra security evaluation against related‐key attack. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Khudra: A New Lightweight Block Cipher for FPGAs

Cited by 28 publications

References 36 publications

An Evaluation of Lightweight Block Ciphers for Resource-Constrained Applications: Area, Performance, and Security

An Evaluation of Lightweight Block Ciphers for Resource-Constrained Applications: Area, Performance, and Security

Hardware Trojan detection for lightweight ciphers implemented on field‐programmable gate arrays using the replay algorithm

Security analysis of Khudra: a lightweight block cipher for FPGAs

Contact Info

Product

Resources

About