A survey on the additional proposals for post-quantum digital signature schemes

Nguyen Kim Tuan, Nguyễn Thị Phượng Hằng, Hoang Duc Tho +1 more

Youngho Yoo, Reza Azarderakhsh, Amir Jalali +2 more

Maksim Iavich, Giorgi Iashvili, Sergiy O. Gnatyuk +2 more

Alvary Kefas Kwala, Alpna Mishra, Shri Kant

Kim Tuan Nguyen

In this paper, the authors propose a new type of post–quantum digital signature scheme based on hard problems, which belongs to the group of unsolvable problems that currently have no solution. Therefore, this type of digital signature scheme can be resistant to quantum attacks based on the quantum algorithm proposed by P. Shor. In addition to quantum resistance, the type of signature scheme proposed here can also be used as pre–quantum digital signature schemes that are widely used in current practical applications.

Fengxia Liu, Zhiyong Zheng, Zixian Gong +5 more

Abstract Lattice-based digital signature has become one of the widely recognized post-quantum algorithms because of its simple algebraic operation, rich mathematical foundation and worst-case security, and also an important tool for constructing cryptography. This survey explores lattice-based digital signatures, a promising post-quantum resistant alternative to traditional schemes relying on factoring or discrete logarithm problems, which face increasing risks from quantum computing. The study covers conventional paradigms like Hash-and-Sign and Fiat-Shamir, as well as specialized applications including group, ring, blind, and proxy signatures. It analyzes the versatility and security strengths of lattice-based schemes, providing practical insights. Each chapter summarizes advancements in schemes, identifying emerging trends. We also pinpoint future directions to deploy lattice-based digital signatures including quantum cryptography.