DLTs are sensitive to having secure authentication to ensure privacy, scalability, and against advanced adversaries. The method involves the combination of finite field based key generation and encoding with identity of polynomials so as to generate secure representations of users. Multi-party authentication schemes are introduced in the form of hypergraph to describe the complicated interactions between the participants and make them fault tolerant. The framework has hardness assumptions of discrete logarithm problems and combinatorial optimization problems to give cryptographic hardness. It creates a verification step based algorithm that can be used to effectively verify and has reduced communication overhead. The proposed solution is a scalable solution based on algorithmic, ensuring authentication in the next-generation distributed ledger.