arXiv subjects

Zheng-An Yao

Publications and source records attributed to Zheng-An Yao.

8 recordsLinked to original sources

arXiv2025

Optimal Convergence Estimate of the Limit from Inverse Power Potential to Hard Sphere Boltzmann Equation

The inverse power potential $U(r)=r^{-1/s}, 0<s<1$, generates the Boltzmann kernel $B^{s}=|v-v_*|^{1-4s} b_s(θ)$ with an angular singularity as $θ\to 0$. Jang-Kepka-Nota-Velázquez (2023) proved the limit $B^{s}\to \frac14|v-v_*|$ as $s\to 0$, as well as weak convergence of solutions based on this kernel convergence. In this work we establish the following sharp quantitative estimate: $$ |b_s(θ)-\tfrac14| \le C\, s\,θ^{-2-2s}. $$ In particular, this sharp estimate yields the optimal $O(s)$ convergence rate for solutions of the homogeneous Boltzmann equation with large initial data in suitable Sobolev spaces; i.e., for any $t\in[0,T]$, we have $$f^s(t)=f^0(t)+O(s),$$ quantified by the $L^1_k$ norm for $k\ge 2.$

math.AP↗

arXiv2024

Linear Codes Constructed From Two Weakly Regular Plateaued Functions with Index (p-1)/2

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs. By setting $ p\equiv 1 \pmod 4 $, we construct an infinite family of linear codes using two distinct weakly regular unbalanced (and balanced) plateaued functions with index $ (p-1)/2 $. Their weight distributions are completely determined by applying exponential sums and Walsh transform. As a result, most of our constructed codes have a few nonzero weights and are minimal.

cs.IT↗

arXiv2021

The Elliptic Net Algorithm Revisited

Pairings have been widely used since their introduction to cryptography. They can be applied to identity-based encryption, tripartite Diffie-Hellman key agreement, blockchain and other cryptographic schemes. The Acceleration of pairing computations is crucial for these cryptographic schemes or protocols. In this paper, we will focus on the Elliptic Net algorithm which can compute pairings in polynomial time, but it requires more storage than Miller's algorithm. We use several methods to speed up the Elliptic Net algorithm. Firstly, we eliminate the inverse operation in the improved Elliptic Net algorithm. In some circumstance, this finding can achieve further improvements. Secondly, we apply lazy reduction technique to the Elliptic Net algorithm, which helps us achieve a faster implementation. Finally, we propose a new derivation of the formulas for the computation of the Optimal Ate pairing on the twisted curve. Results show that the Elliptic Net algorithm can be significantly accelerated especially on the twisted curve. The algorithm can be $80\%$ faster than the previous ones on the twisted 381-bit BLS12 curve and $71.5\%$ faster on the twisted 676-bit KSS18 curve respectively.

cs.CR↗

arXiv2016

The Complete Weight Enumerator of Several Cyclic Codes

Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime $p$, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding exponential sums. As applications of this general strategy, we determine the complete weight enumerator of several $p$-ary cyclic codes and give some examples to illustrate our results.

cs.IT↗

arXiv2016

A Class of Three-Weight Linear Codes and Their Complete Weight Enumerators

Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set. Their weight enumerators and complete weight enumerators are presented explicitly. The results show that they are linear codes with three weights and suitable for the constructions of authentication codes and secret sharing schemes.

cs.IT↗

arXiv2015

Complete Weight Enumerators of a Family of Three-Weight Linear Codes

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we present the explicit complete weight enumerator of a family of $p$-ary linear codes constructed with defining set. The weight enumerator is an mmediate result of the complete weight enumerator, which shows that the codes proposed in this paper are three-weight linear codes. Additionally, all nonzero codewords are minimal and thus they are suitable for secret sharing.

cs.IT↗

arXiv2015

Complete Weight Enumerators of Some Linear Codes

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they may have applications in cryptography and secret sharing schemes. Moreover, some examples are included to illustrate our results.

cs.IT↗

arXiv2015

The weight distributions of two classes of p ary cyclic codes with few weights

Cyclic codes have attracted a lot of research interest for decades as they have efficient encoding and decoding algorithms. In this paper, for an odd prime $p$, the weight distributions of two classes of $p$-ary cyclic codes are completely determined. We show that both codes have at most five nonzero weights.

cs.IT↗