An Undeniable Signature Scheme based on Quasi-Dyadic Codes

Hua, Lei; Han, Mu; Ma, Shidian; Feng, Xiaolin

doi:10.1109/iaeac.2018.8577671

Cited by 3 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, the paper presents the results of comparative studies of the complexity of the practical implementation of noise-immune coding and decoding using algebraic geometric codes and other (the most well-known and common) codes. The results of this research can be used to improve various code-based methods of information security [16][17][18][19][20][21][22][23][24][25][26].…”

Section: Introductionmentioning

confidence: 99%

Noise Immunity of the Algebraic Geometric Codes

Кuznetsov¹,

Kolovanova²,

Смірнов³

et al. 2019

IJC

View full text Add to dashboard Cite

Linear block noise-immune codes constructed according to algebraic curves (algebraic geometric codes) are considered, their design properties are evaluated, algorithms of construction and decoding are studied. The energy efficiency of the transmission of discrete messages by M-ary orthogonal signals in the application of algebraic geometric codes is studied; the achievable energy gain from the use of noise-immune coding is estimated. The article shows that in discrete channels without memory it is possible to obtain a significant energy gain, which increases with the transition to long algebraic geometric codes constructed from curves with a large number of points relative to the genus of the curve. It is found that the computational complexity of implementing algebraic geometric codes is comparable to other known noise-immune codes, for example, Reed-Solomon codes and others. Thus, high energy efficiency in combination with the acceptable computational complexity of implementation confirms the prospects of algebraic geometric codes use in modern telecommunication systems and networks to improve the noise immunity of data transmission channels.

show abstract