Mrinal Nandi

Packing Problem and Random Coverage in Continuous Domain

Mrinal Nandi · Asian Journal of Research in Computer Science · 2023

The packing problem is a well known-problem. There are several versions of this problem. In this paper we consider packing or covering of a disc of a given radius r by a number of discs of unit radius. We introduced two types of packing, hexagonal packing and square packing. We s...

Open access Research Article 10.9734/ajrcos/2023/v16i3347

ULBC: An Ultra Light-weight Block Cipher

Shreyasi Ghorai, Nilanjan Datta & Mrinal Nandi · Journal of Advances in Mathematics and Computer Science · 2023

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...

Open access Research Article 10.9734/jamcs/2023/v38i81793