Research Projects

Towards meeting the growing demand for security in advanced computational scenarios, it is a continuous endeavor to formulate and develop cost-effective strong security primitives. Code-based public key cryptosystems are attractive alternatives to guarantee digital security, even against quantum computers. Their main ideas come from coding theory. The tools that are most relevant in the context of developing and analyzing code-based constructions are field theory, algebraic number theory and knowledge regarding various computational models. A common theme throughout code-based cryptography is to prove the security by reducing to a plausible computational assumption. In this project, we propose to construct new code-based public key cryptosystems that derive their security from the difficulty of solving syndrome decoding problem, which is known to be an NP hard problem. The migration of the post-quantum hypothetical world requires the design of several important crypto primitives like signature schemes and its related variants that are both efficient and quantum attack resistance. We aim to design our schemes with enhanced security and devise new techniques to make the primitives more practical. More explicitly, we would like to study existing code-based cryptographic primitives and recent advances on various types of attacks against code-based schemes. We also identify code families for which the code indistinguishability assumption holds and design new code-based cryptographic scheme with small key sizes. We provide concrete security and performance analysis of our proposed constructions.