Securing resource constrained devices such as IoT, embedded or wireless sensor devices requires lightweight cryptographic mechanisms. An algebraic method for designing light-weight block ciphers which provides an efficient diffusion and confusion by using finite field arithmetic, matrix-based diffusion layers and group-theoretic permutation operations is presented. The design proposed in this paper incorporates algebraic transformations for secure substitution permutation processing with low memory requirement, low energy consumption and high encryption speed. Formal algebraic modeling is then used again for the analysis of resistance against linear, differential and algebraic cryptanalysis attacks. The experimental performance evaluation proves that it achieves the better performances in terms of encryption efficiency, optimization of memory consumption and computational overhead over the traditional “lightweight ciphers” approaches. The proposed approach provides a scalable and secure cryptographic solution for next-generation resource-constrained computing environments.