Skip to content
Research Article Open access CC BY 4.0

ULBC: An Ultra Light-weight Block Cipher

Shreyasi Ghorai, Nilanjan Datta, Mrinal Nandi

Journal of Advances in Mathematics and Computer Science · pp. 86–100 · Published 23 Jun 2023

10.9734/jamcs/2023/v38i81793

Abstract

After explicitly observing the design criteria of two popular block ciphers, namely PRESENT and GIFT, we have proposed a new S-box that would be useful for designing a new light-weight block cipher, we name it as ULBC. The primary goal of the S-Box is to reduce the implementation cost, and make it cheaper than the two block ciphers GIFT and PRESENT. In this design, we have also developed a new property like BOGI which would be extremely helpful in building light-weight block ciphers. Depending on this property we can appropriately design permutation layer, such that no bad output will go bad input. ULBC is composed of a S-box, associated bit wiring and key schedule. Also, we have produced some of cryptanalytic attacks to assure certain security level. We have used two different methods to calculate differential characteristics and linear approximation. By using *-DDT method we have produced tight bounds of them. We find that 24 rounds are sufficient to resist some cryptanalytic attack. It is also found that by using this cipher 64-bits plain-text can be encrypted into 64-bits cipher-text.

Light-weight block cipher S-box BOGI

References (10)

  1. 1 PRESENT: An Ultra-Lightweight Block Cipher [DOI]
  2. 2 Cryptography in theory and practice [DOI]
  3. 3 Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques
  4. 4 GIFT: A Small Present Towards Reaching the Limit of Lightweight Encryption
  5. 5 Lightweight Block Ciphers for IoT: Energy Optimization and Survivability Techniques [DOI]
  6. 6 A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro [DOI]
  7. 7 An Enhanced Key Schedule Algorithm of PRESENT-128 Block Cipher for Random and Non-Random Secret Keys [DOI]
  8. 8 Study of S-box properties in block cipher [DOI]
  9. 9 New Impossible Differential Search Tool from Design and Cryptanalysis Aspects - Revealing Structural Properties of Several Ciphers.
  10. 10 Invariant Subspace Attack Against Midori64 and The Resistance Criteria for S-box Designs [DOI]

Cited by 2

BIZness: Bit Invariant Zero-Sum Property Based on Division Trail

Shibam Ghosh, Anup Kumar Kundu, Mostafizar Rahman · Lecture Notes in Computer Science · 2024

MITM and Differential Fault Attack on ULBC

Shreyasi Ghorai, Mrinal Nandi · 2024 Asian Conference on Communication and Networks (ASIANComNet) · 2024

Article metrics

Real usage data collected on this platform.

45

Page views

0

PDF downloads

9

Outbound clicks

2

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.