PolarSig: An efficient digital signature based on polar codes

Forghani, Pouyan; Shooshtari, Masoumeh Koochak; Aref, Mohammad Reza

doi:10.1049/iet-com.2019.0578

Cited by 3 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper investigates the realm of polar codes, taking inspiration from the PolarSig (13) approach in order to do so. In contrast to PolarSig, in which frozen bits were omitted and punctured for the purpose of optimizing polar codes for digital signatures, the study in this article focuses exclusively on the original, unaltered polar codes used in PolarSig.…”

Section: Resultsmentioning

confidence: 99%

“…Based on the previous study of polar code-based digital signature, we observe that Forghani (13) reduced the length of the polar code by randomly omitting and puncturing of frozen bits, leading to the successful decoding of syndromes. This paper works on the original length of the polar code and proposes several padding techniques that can be used to decode syndromes effectively.…”

Section: Introductionmentioning

confidence: 93%

“…This scheme has various features, like low signing complexity and a small key size. Later on, Forghani et al proposed the PolarSig scheme using polar codes in 2020 that depend on the CFS scheme (13) . It has low signing complexity, a small public key size, and is secure against forgery and key recovery attacks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Padding Techniques for Identifying Decodable Syndrome in Post-Quantum Digital Signature Schemes

Khurana,

Narwal,

Deepika

2023

IJST

View full text Add to dashboard Cite

Objectives:The aim of this study is to design a MATLAB algorithm that will identify decodable syndromes easily. Methods: The most time-consuming step in developing code-based digital signature schemes is to identify a decodable syndrome. So, to find a decodable syndrome in a short period of time several padding techniques are presented in this paper. Our study uses a polar code with blocklength 16 with a rate of 0.5, and its Successive Cancellation (SC) decoding algorithm is used to decode the syndrome. The techniques suggested in this paper can be used to generate polar code-based digital signatures more quickly. Findings: Our study evaluates the effectiveness of padding techniques by simulating random syndromes 10,000 times over Binary Symmetric Channel (BSC) and Additive White Gaussian Noise (AWGN) channel by calculating the success rate, failure rate, and mean failure count for each channel. Novelty: In this paper, we present graphs showing the number of syndromes that failed to decode in the BSC and AWGN channels when simulating a predefined number of times. Additionally, we calculate the success rate, failure rate, and mean failure count of decoding for both channels, which demonstrate that the proposed padding techniques are highly effective in decoding syndromes in AWGN.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 93%

See 1 more Smart Citation

Padding Techniques for Identifying Decodable Syndrome in Post-Quantum Digital Signature Schemes

Khurana,

Narwal,

Deepika

2023

IJST

View full text Add to dashboard Cite

show abstract

“…Forghani et al [47] then proposed a digital signature scheme based on polar codes. This paper used polar codes [48] with the CFS scheme that reduces the public key size and signing time.…”

Section: Code-based Digital Signature Schemesmentioning

confidence: 99%

“…Digital Signature SchemePublic Key Size Security (in bits) CFS (𝑚, 𝑡) (16, 9)[13] 9,437,184 bits 83 KKS (𝑁, 𝐾, 𝑛, 𝑘, 𝑡 1 , 𝑡 2 , 𝑡, 𝑙) (9800, 4510, 1900, 259, 844, 1056, 1046, 8)[52] 6.8 MB 128 Stern (2𝑛, 𝑛) (694, 347)[53] 347 bits 83 PolarSig (𝑁 ′ , 𝑘 ′ ) (788, 246)[47] 50.2 KB 128 Ring signature (𝑚, 𝑡) (15, 12)[37] 0.7 MB 80 Modified pqsigRM (𝑟, 𝑚) (6, 12)[46] 0.773 MB 128 Parallel CFS (𝑚, 𝑡) (16, 10)[28] …”

mentioning

confidence: 99%

Analysis of code-based digital signature schemes

Khurana

Narwal

2023

IJECE

View full text Add to dashboard Cite

<span lang="EN-US">Digital signatures are in high demand because they allow authentication and non-repudiation. Existing digital signature systems, such as digital signature algorithm (DSA), elliptic curve digital signature algorithm (ECDSA), and others, are based on number theory problems such as discrete logarithmic problems and integer factorization problems. These recently used digital signatures are not secure with quantum computers. To protect against quantum computer attacks, many researchers propose digital signature schemes based on error-correcting codes such as linear, Goppa, polar, and so on. We studied 16 distinct papers based on various error-correcting codes and analyzed their various features such as signing and verification efficiency, signature size, public key size, and security against multiple attacks.</span>

show abstract