Implementation of PRINCE with resource-efficient structures based on FPGAs

Li, Lang; Feng, Jingya; Botao, Liu; Guo, Ying; Li, Qiuping

doi:10.1631/fitee.2000688

Cited by 3 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the input plaintext is

0 x 0000000000000000

and the input master key is

0 x 00000000000000000000

, the value of the ciphertext is

0 x 5041 b 83331 b 27668

. The result is the same as the test value set by Berger et al This means that the newly proposed structure and our optimization ideas are correct 30 …”

Section: Hardware Implementations and Comparisonsmentioning

confidence: 67%

“…The result is the same as the test value set by Berger et al This means that the newly proposed structure and our optimization ideas are correct. 30 Table 5 shows the hardware implementation results of the optimized LILLIPUT and other ciphers. Compared with other ciphers, the optimized LILLIPUT is 1271 GEs, which has certain advantages in terms of area consumption.…”

Section: Low Area Implementationmentioning

confidence: 99%

See 1 more Smart Citation

Low area and high throughput hardware implementations for the LILLIPUT cipher

Yang,

Li,

Huang

2023

Circuit Theory & Apps

Self Cite

View full text Add to dashboard Cite

SummaryThe widespread use of Internet of Things devices has increased the demand for lower cost and more efficient lightweight ciphers. However, there is a difficult trade‐off between cost and efficiency for lightweight block ciphers. The optimizations of area and throughput are important for some constrained environments. This paper proposes two novel hardware architectures for the LILLIPUT cipher. In the novel low area structure, a new permutation layer is provided for LILLIPUT. The relationship between encryption algorithm and key scheduling algorithm is utilized to achieve optimal sharing among components, which significantly reduces hardware area. The experimental results show that the number of XOR gates and S‐boxes required for low area optimization is reduced by 52 and 8, respectively. The total area is reduced by about 18%. For high throughput structure, this paper provides 2‐round, 5‐round, and 15‐round loop unrolling designs for LILLIPUT to improve throughput. The experimental results show that the throughput of the 5‐round loop unrolling structure reaches a good level, which is relatively the most cost‐effective. In practical application, ciphers can be unrolled implementations according to the needs of devices to improve the execution speed, which can greatly reduce the execution time and complexity of the algorithm.

show abstract