Digital Security for Land Registration in Bangladesh: A Framework Based on Elliptic Curve Cryptography

Abstract

Land registration in Bangladesh continues to rely on paper-based processes that are susceptible to forgery, duplication, and inefficiency. These vulnerabilities contribute to widespread disputes over property ownership and create barriers to transparent governance. Recognizing that the root of these issues lies in the absence of a secure mechanism for verification, this study turns to algebraic cryptography as a potential solution. This paper introduces an algebraic cryptographic framework for securing land registration through Elliptic Curve Cryptography (ECC), specifically the Elliptic Curve Digital Signature Algorithm (ECDSA). It is built upon the hardness of the elliptic curve discrete logarithm problem, which ensures signatures that are computationally unforgeable. This study also considers the theoretical advantages of ECC over the Rivest–Shamir–Adleman (RSA) algorithm, particularly its ability to deliver equivalent security with smaller key sizes, faster verification, and lower storage requirements. The mathematical model developed in this paper formalizes these properties and evaluates their implications for a large-scale registry system. It explores how compact signatures, low verification latency, and limited data growth can be aligned with the resource constraints of Bangladeshi land offices. The contribution of this work lies in connecting rigorous mathematical security with a practical national need. By embedding algebraic cryptography into land registration, the framework provides a pathway to prevent fraudulent transfers and enhance institutional trust. This vision points toward a future in which property rights in Bangladesh are secured not by fragile paper, but by the certainty of algebraic cryptography.

Dhaka Univ. J. Sci. 74(1): 179-185, 2026 (January)